A Simulation Study on Distributed Mutual Exclusion
β Scribed by Ye-In Chang
- Publisher
- Elsevier Science
- Year
- 1996
- Tongue
- English
- Weight
- 357 KB
- Volume
- 33
- Category
- Article
- ISSN
- 0743-7315
No coin nor oath required. For personal study only.
π SIMILAR VOLUMES
In this paper, we present a taxonomy of mutual exclusion in distributed systems where there is no shared memory and all communication is solely by passing messages. We classify these algorithms based upon their distinct features, as well as unify them based on their commonalities. Such classificatio
Several algorithms reducing the number of messages were presented later (see Ricart and Agrawala [21] and Carvalho and Roucairol [4]). The number of messages was proportional to N. The algorithm presented by Chandy and Misra [6] (in which permission is in the form of a fork) is the most efficient of
In this paper, we present a self-stabilizing quorum-based distributed mutual exclusion algorithm. Our algorithm is designed for an asynchronous message-passing model. The algorithm scales well since it has constant synchronization delay and its message complexity is proportional to the square root o