Notification:
We are currently experiencing intermittent issues impacting performance. We apologize for the inconvenience.
By Topic

A quorum-based distributed algorithm for group mutual exclusion

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

3 Author(s)
Toyomura, M. ; Hiroshima Univ., Japan ; Kamei, S. ; Kakugawa, H.

The group mutual exclusion problem is a variant of mutual exclusion problem in a sense that only the same group of processes can enter their critical section simultaneously. We propose a quorum-based distributed algorithm for the group mutual exclusion problem in asynchronous message passing distributed systems. The message complexity of our algorithm is O(/Q/) in the best case and O(n/Q/) in the worst case, where /Q/ is a quorum size that the algorithm adopts, and n is the number of processes that make requests for resources.

Published in:

Parallel and Distributed Computing, Applications and Technologies, 2003. PDCAT'2003. Proceedings of the Fourth International Conference on

Date of Conference:

27-29 Aug. 2003