The Community for Technology Leaders
Green Image
The group mutual exclusion problem is a generalization of mutual exclusion problem such that a set of processes in the same group can enter critical section simultaneously. In this paper, we propose a distributed algorithm for the group mutual exclusion problem in asynchronous message passing distributed systems. Our algorithm is based on tokens, and a process that obtains a token can enter critical section. For reducing message complexity, it uses coterie as a communication structure when a process sends a request messages. Informally, coterie is a set of quorums, each of which is a subset of the process set, and any two quorums share at least one process. The message complexity of our algorithm is $O(|Q|)$ in the worst case, where $|Q|$ is a quorum size that the algorithm adopts. Performance of the proposed algorithm is presented by analysis and discrete event simulation. Especially, the proposed algorithm achieves high concurrency, which is a performance measure for the number of processes that can be in critical section simultaneously.
Distributed systems, Distributed data structures, Mutual exclusion, Synchronization

T. Masuzawa, H. Kakugawa and S. Kamei, "A Token-Based Distributed Group Mutual Exclusion Algorithm with Quorums," in IEEE Transactions on Parallel & Distributed Systems, vol. 19, no. , pp. 1153-1166, 2008.
85 ms
(Ver 3.3 (11022016))