Ichiro Suzuki
Abstract
A distributed algorithm is presented that realizes mutual exclusion among N nodes in a computer network. The algorithm requires at most N message exchanges for one mutual exclusion invocation. Accordingly, the delay to invoke mutual exclusion is smaller than in an algorithm of Ricart and Agrawala, which requires 2*(N - 1) message exchanges per invocation. A drawback of the algorithm is that the sequence numbers contained in the messages are unbounded. It is shown that this problem can be overcome by slightly increasing the number of message exchanges.
- 1 RICART, G., AND AGRAWALA, A.K. An optimal algorithm for mutual exclusion in computer networks. Commun. ACM 24, i (Jan. 1981), 9-17. Google Scholar
- 2 SUZUKI, I., AND KASAMI, T. An optimality theory for mutual exclusion algorithms in computer networks. In Proceedings of the 3rd International Conference on Distributed Computing Systems (Oct. 18-22, Fort Lauderdale, Fla.), IEEE, N.Y., 365-370.Google Scholar
Index Terms
- A distributed mutual exclusion algorithm
Recommendations
Fair group mutual exclusion
PODC '03: Proceedings of the twenty-second annual symposium on Principles of distributed computingIn the group mutual exclusion problem [6], which generalizes mutual exclusion [2], a process chooses a session when it requests entry to the Critical Section. A group mutual exclusion algorithm must ensure that the mutual exclusion property holds: If ...
A Fair Distributed Mutual Exclusion Algorithm
This paper presents a fair decentralized mutual exclusion algorithm for distributed systems in which processes communicate by asynchronous message passing. The algorithm requires between $N-1$ and $2(N-1)$ messages per critical section access, where $N$ ...
A Taxonomy of Distributed Mutual Exclusion
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 ...
Comments