The Community for Technology Leaders
Parallel and Distributed Systems, International Conference on (2004)
Newport Beach, California
July 7, 2004 to July 9, 2004
ISSN: 1521-9097
ISBN: 0-7695-2152-5
pp: 341
JaeHyrk Park , IRIS, Information and Communications University, Korea
Yoshifumi Manabe , Nippon Telegraph and Telephone Corporation, Japan
This paper presents a quorum-based distributed algorithm for the extended group mutual exclusion problem. In the group mutual exclusion problem, multiple processes can enter a critical section simultaneously if they belong to the same group. Processes in different groups cannot enter a critical section at the same time. In the extended group mutual exclusion, each process is a member of multiple groups at the same time. Each process can select which group it belongs at making a request. The algorithm for the group mutual exclusion cannot be applied for this extended problem, since there can be a case that two processes are prevented from entering a critical section simultaneously even when they are capable of doing so. We call the above situation unnecessary blocking. We present a quorum-based algorithm that prevents unnecessary blocking and show its correctness proof.
JaeHyrk Park, Yoshifumi Manabe, "A Quorum-Based Extended Group Mutual Exclusion Algorithm without Unnecessary Blocking", Parallel and Distributed Systems, International Conference on, vol. 00, no. , pp. 341, 2004, doi:10.1109/ICPADS.2004.1316113
96 ms
(Ver 3.3 (11022016))