This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
10th International Conference on Parallel and Distributed Systems (ICPADS'04)
A Quorum-Based Extended Group Mutual Exclusion Algorithm without Unnecessary Blocking
Newport Beach, California
July 07-July 09
ISBN: 0-7695-2152-5
Yoshifumi Manabe, Nippon Telegraph and Telephone Corporation, Japan
JaeHyrk Park, IRIS, Information and Communications University, Korea
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.
Citation:
Yoshifumi Manabe, JaeHyrk Park, "A Quorum-Based Extended Group Mutual Exclusion Algorithm without Unnecessary Blocking," icpads, pp.341, 10th International Conference on Parallel and Distributed Systems (ICPADS'04), 2004
Usage of this product signifies your acceptance of the Terms of Use.