Abstract
In this paper, we propose a bi-k-arbiter quorum structure for the group mutual k-exclusion problem in distributed systems. We design a lightweight group mutual k-exclusion algorithm adopting the bi-k-arbiter to solve the group mutual k-exclusion problem. Adopting bi-k-arbiters, the concurrent processes accessing to the same resource could use the lightweight quorum to reduce the message complexity.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Atreya, R., Mittal, N.: A distributed group mutual exclusion algorithm using surrogate-quorums, Technical Report, The University of Texas at Dallas (2003)
Beauquier, J., Cantarell, S., Datta, A.K., Petit, F.: Group mutual exclusion in tree networks. Journal of Information Science and Engineering 19(3), 415–432 (2003)
Joung, Y.-J.: Quorum-based algorithms for group mutual exclusion. IEEE Transactions on Parallel and Distributed Systems 14(5), 463–476 (2003)
Kuo, Y.-C.: A simple scheme to construct k-arbiters with uniform quorum sizes. Journal of the Chinese Institute of Engineers 26(5), 709–714 (2003)
Vidyasankar, K.: A simple group mutual l-exclusion algorithm. Information Processing Letters 85, 79–85 (2003)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2005 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Kuo, YC., Lee, HC. (2005). A Lightweight Group Mutual k-Exclusion Algorithm Using Bi-k-Arbiters. In: Fraigniaud, P. (eds) Distributed Computing. DISC 2005. Lecture Notes in Computer Science, vol 3724. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11561927_45
Download citation
DOI: https://doi.org/10.1007/11561927_45
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-29163-3
Online ISBN: 978-3-540-32075-3
eBook Packages: Computer ScienceComputer Science (R0)