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)
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
Asynchronous group mutual exclusion
Distributed Computing
A group quorum system of degree 1+√1+n/m
ICDCN'06 Proceedings of the 8th international conference on Distributed Computing and Networking
| Hi-index | 0.00 |
We consider the problem of constructing regular group quorum systems of large degree. In particular, we show that for every integer p1, there is a regular m-group quorum system over an $n=(\lfloor p(p+1)/2\rfloor)$-element set of degree $\lfloor(p+1)/2\rfloor=\lceil \sqrt{n/2}\rceil$ for every m≤p, where each quorum has size p.