A lightweight group mutual k-exclusion algorithm using bi-k-arbiters

Authors:
Yu-Chen Kuo;Huang-Chen Lee
Affiliations:
Department of Computer and Information Science, Soochow University, Taipei, Taiwan, ROC;Department of Computer and Information Science, Soochow University, Taipei, Taiwan, ROC
Venue:
DISC'05 Proceedings of the 19th international conference on Distributed Computing
Year:
2005

Citing 2
Cited 0

A simple group mutual l-exclusion algorithm

Information Processing Letters
Quorum-Based Algorithms for Group Mutual Exclusion

IEEE Transactions on Parallel and Distributed Systems

Quantified Score

Hi-index	0.00

Visualization

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.