.png){kind=icon}
.png){kind=icon}
Return
Quorum-based algorithms for group mutual exclusion
.png){kind=icon}
PRE
AI
DOI：10.1109/TPDS.2003.1199064.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
We propose a quorum system, which we referred to as the surficial quorum system, for group mutual exclusion. The surficial quorum system is geometrically evident and is easy to construct. It also has a nice structure based on which a truly distributed algorithm for group mutual exclusion can be obtained and processes' loads can be minimized. When used with processes to access a resource simultaneously, where Maekawa's algorithm, the surficial quorum system allows up to root2n/m(m-1) processes to assess a resource simultaneously, where n is the total number of processes and m is the total number of groups. We also present two modifications of Maekawa's algorithm so that the number of processes that can access a resource at a time is not limited to the structure of the underlying quorum system, but to the number that the problem definition allows.
Keywords:
mutual exclusion
group mutual exclusion
resource allocation
quorum system
surficial quorum system
coteries
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
Organization
No organization information available