Abstract
In this paper we present a new token-based distributed mutual exclusion algorithm. The algorithm relies on two distributed dynamic structures in order to provide mutual exclusion: the “Naimi Forest” to route token requests, and the “Raymond Virtual Tree” to serve token requests. Our strategy combines the best characteristics of two algorithms cited as the most efficient in the literature concerning message traffic. We present a performance simulation study. Results show that our algorithm has better performance considering the number of message exchanged per critical section entry.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callMore From: Revista Facultad de Ingeniería - Universidad de Tarapacá
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
