How to assign votes in a distributed system
Journal of the ACM (JACM)
An efficient and fault-tolerant solution for distributed mutual exclusion
ACM Transactions on Computer Systems (TOCS)
A N algorithm for mutual exclusion in decentralized systems
ACM Transactions on Computer Systems (TOCS)
Asynchronous group mutual exclusion (extended abstract)
PODC '98 Proceedings of the seventeenth annual ACM symposium on Principles of distributed computing
A simple local-spin group mutual exclusion algorithm
Proceedings of the eighteenth annual ACM symposium on Principles of distributed computing
An optimal algorithm for mutual exclusion in computer networks
Communications of the ACM
A note on group mutual exclusion
Proceedings of the twentieth annual ACM symposium on Principles of distributed computing
Quorum-Based Algorithms for Group Mutual Exclusion
IEEE Transactions on Parallel and Distributed Systems
Token Based Group Mutual Exclusion for Asynchronous Rings (Extended Abstract)
ICDCS '01 Proceedings of the The 21st International Conference on Distributed Computing Systems
A Quorum-Based Extended Group Mutual Exclusion Algorithm without Unnecessary Blocking
ICPADS '04 Proceedings of the Parallel and Distributed Systems, Tenth International Conference
A regular group quorum system of degree ⌈√n/2⌉
ICA3PP'12 Proceedings of the 12th international conference on Algorithms and Architectures for Parallel Processing - Volume Part II
| Hi-index | 0.00 |
The group mutual exclusion problem is a generalization of the ordinary mutual exclusion problem where each application process can be a member of different groups and members of the same group are allowed simultaneous access to their critical sections. Members of different groups must access their critical sections in a mutually exclusive manner. In 2003, Joung proposed a especially designed group quorum system for group mutual exclusion named the surficial system. Given the total number of manager processes in the system n and the number of groups sought m, the degree of the surficial system is , which means that up to k processes can be in their critical section simultaneously. In this paper, we propose a new group quorum system for group mutual exclusion of degree , which is much higher than k. Also, when k= k′, our system produces quorums of smaller size. This makes our system far more efficient and practical.