A delay-optimal quorum-based mutual exclusion algorithm for distributed systems
โ Scribed by . Guohong Cao; M. Singhal
- Book ID
- 121851710
- Publisher
- IEEE
- Year
- 2001
- Tongue
- English
- Weight
- 387 KB
- Volume
- 12
- Category
- Article
- ISSN
- 1045-9219
No coin nor oath required. For personal study only.
๐ SIMILAR VOLUMES
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
In the problem of k-mutual exclusion, concurrent access to shared resource or the critical section (CS) must be synchronized such that at any time at most k processes can access the CS. In this paper, we propose a generalized grid quorum strategy for k-mutual exclusion, which imposes a logical grid