How to assign votes in a distributed system
Journal of the ACM (JACM)
The information structure of distributed mutual exclusion algorithms
ACM Transactions on Computer Systems (TOCS)
An efficient and fault-tolerant solution for distributed mutual exclusion
ACM Transactions on Computer Systems (TOCS)
ACM Transactions on Computer Systems (TOCS)
Hierarchical Quorum Consensus: A New Algorithm for Managing Replicated Data
IEEE Transactions on Computers
A high availability N hierarchical grid algorithm for replicated data
Information Processing Letters
Enhancing concurrency and availability for database systems
Enhancing concurrency and availability for database systems
A N algorithm for mutual exclusion in decentralized systems
ACM Transactions on Computer Systems (TOCS)
The availability of quorum systems
Information and Computation
A simple scheme to construct k-coteries with ON uniform quorum sizes
Information Processing Letters
A Geometric Approach for Constructing Coteries and k-Coteries
IEEE Transactions on Parallel and Distributed Systems
Properties of nondominated k-coteries
Journal of Systems and Software
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
Theoretical Computer Science
An optimal algorithm for mutual exclusion in computer networks
Communications of the ACM
Time, clocks, and the ordering of events in a distributed system
Communications of the ACM
Communicating sequential processes
Communications of the ACM
A note on group mutual exclusion
Proceedings of the twentieth annual ACM symposium on Principles of distributed computing
IEEE Transactions on Computers
The Grid Protocol: A High Performance Scheme for Maintaining Replicated Data
IEEE Transactions on Knowledge and Data Engineering
The Congenial Talking Philosophers Problem in Computer Networks (Extended Abstract)
Proceedings of the 13th International Symposium on Distributed Computing
Weighted voting for replicated data
SOSP '79 Proceedings of the seventh ACM symposium on Operating systems principles
Resource allocation with immunity to limited process failure
SFCS '79 Proceedings of the 20th Annual Symposium on Foundations of Computer Science
Avoiding deadlock in multitasking systems
IBM Systems Journal
A Quorum-Based Protocol for Searching Objects in Peer-to-Peer Networks
IEEE Transactions on Parallel and Distributed Systems
A Group k-Mutual Exclusion Algorithm for Mobile Ad Hoc Networks
IWANN '09 Proceedings of the 10th International Work-Conference on Artificial Neural Networks: Part II: Distributed Computing, Artificial Intelligence, Bioinformatics, Soft Computing, and Ambient Assisted Living
| Hi-index | 0.00 |
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 so 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 Maekawa's algorithm, the surficial quorum system allows up to 驴2n/m(m-1) processes to access 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.