An efficient and fault-tolerant solution for distributed mutual exclusion
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
A N algorithm for mutual exclusion in decentralized systems
ACM Transactions on Computer Systems (TOCS)
The availability of quorum systems
Information and Computation
A simulation study on distributed mutual exclusion
Journal of Parallel and Distributed Computing
A Geometric Approach for Constructing Coteries and k-Coteries
IEEE Transactions on Parallel and Distributed Systems
Dynamic hashing + quorum = efficient location management for mobile computing systems
PODC '97 Proceedings of the sixteenth annual ACM symposium on Principles of distributed computing
The Load, Capacity, and Availability of Quorum Systems
SIAM Journal on Computing
Decentralized replicated-object protocols
Proceedings of the eighteenth annual ACM symposium on Principles of distributed computing
The Load and Availability of Byzantine Quorum Systems
SIAM Journal on Computing
Diamond Quorum Consensus for High Capacity and Efficiency in a Replicated Database System
Distributed and Parallel Databases
The Grid Protocol: A High Performance Scheme for Maintaining Replicated Data
Proceedings of the Sixth International Conference on Data Engineering
Weighted voting for replicated data
SOSP '79 Proceedings of the seventh ACM symposium on Operating systems principles
Two New Quorum Based Algorithms for Distributed Mutual Exclusion
ICDCS '97 Proceedings of the 17th International Conference on Distributed Computing Systems (ICDCS '97)
IEEE Transactions on Parallel and Distributed Systems
Replica synchronisation in grid databases
International Journal of Web and Grid Services
| Hi-index | 0.01 |
Abstract: In distributed systems it is often necessary to provide coordination among the multiple concurrent processes. Quorum systems provide a decentralized approach to provide such coordination that is resilient to node and communication link failures. Quorum systems are highly available and may be used to balance the load among the elements of the system. In this paper, we propose a modification to the hierarchical grid quorum system that leads to a smaller quorum size, better availability and load. We also propose a new hierarchical quorum construction based on the organization of elements in a triangular shape that presents better average quorum size, availability and load than other highly-available systems with almost optimal load.