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 light-weight 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. © Springer-Verlag Berlin Heidelberg 2005.
Cite
CITATION STYLE
Kuo, Y. C., & Lee, H. C. (2005). A lightweight group mutual k-exclusion algorithm using Bi-k-arbiters. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 3724 LNCS, pp. 509–510). Springer Verlag. https://doi.org/10.1007/11561927_45
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
