How to assign votes in a distributed system
Journal of the ACM (JACM)
Concurrency control and recovery in database systems
Concurrency control and recovery in database systems
Efficient solution to the distributed mutual exclusion problem
Proceedings of the eighth annual ACM Symposium on Principles of distributed computing
Dynamic voting algorithms for maintaining the consistency of a replicated database
ACM Transactions on Database Systems (TODS)
Exploiting logical structures in replicated databases
Information Processing Letters
Hierarchical Quorum Consensus: A New Algorithm for Managing Replicated Data
IEEE Transactions on Computers
A N algorithm for mutual exclusion in decentralized systems
ACM Transactions on Computer Systems (TOCS)
Crumbling walls: a class of practical and efficient quorum systems
Proceedings of the fourteenth annual ACM symposium on Principles of distributed computing
The Load, Capacity, and Availability of Quorum Systems
SIAM Journal on Computing
A Majority consensus approach to concurrency control for multiple copy databases
ACM Transactions on Database Systems (TODS)
Consistency and recovery control for replicated files
Proceedings of the tenth ACM symposium on Operating systems principles
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
IEEE Transactions on Parallel and Distributed Systems
Dual-Level Key Management for secure grid communication in dynamic and hierarchical groups
Future Generation Computer Systems
A Hierarchical Modeling and Analysis for Grid Service Reliability
IEEE Transactions on Computers
IEEE Transactions on Computers
Dependability and security in medical information system
HCI'07 Proceedings of the 12th international conference on Human-computer interaction: applications and services
| Hi-index | 14.99 |
Recently there has been a resurgence of interest in quorum-based methods for maintaining consistency of a group of replicated servers as a way to achieve load balancing in addition to high availability. We describe a SuperGrid protocol that performs well for small number of items (less than 100) and evaluate its performance analytically and through simulation experiments. Although it has been shown that it is possible to construct quorum systems where the load is $O(1/\sqrt N )$ and the availability is $\exp ( - \Omega (\sqrt N ))$, these asymptotic results do not perform very well when the number of items is relatively small. In such cases, our results show that the Supergrid protocol outperforms the recent Crumbling Walls protocol and the Paths system. It is also simple and easy to implement.