.png){kind=icon}
.png){kind=icon}
Return
A token-based distributed group mutual exclusion algorithm with quorums
.png){kind=icon}
PRE
AI
DOI：10.1109/TPDS.2008.22.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
The group mutual exclusion problem is a generalization of mutual exclusion problem such that a set of processes in the same group can enter a critical section simultaneously. In this paper, we propose a distributed algorithm for the group mutual exclusion problem in asynchronous message passing distributed systems. Our algorithm is based on tokens, and a process that obtains a token can enter a critical section. To reduce message complexity, it uses a coterie as a communication structure when a process sends a request messages. Informally, a coterie is a set of quorums, each of which is a subset of the process set, and any two quorums share at least one process. The message complexity of our algorithm is O(vertical bar Q vertical bar) in the worst case, where vertical bar Q vertical bar is a quorum size that the algorithm adopts. Performance of the proposed algorithm is presented by analysis and discrete event simulation. In particular, the proposed algorithm achieves high concurrency, which is a performance measure for the number of processes that can be in a critical section simultaneously.
Keywords:
distributed systems
distributed data structures
mutual exclusion
synchronization
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
IF:
6
Papers:
5.2K
Citations:
1.1W