How to assign votes in a distributed system
Journal of the ACM (JACM)
A quorum-consensus replication method for abstract data types
ACM Transactions on Computer Systems (TOCS)
The Reliability of Voting Mechanisms
IEEE Transactions on Computers
SIGMOD '87 Proceedings of the 1987 ACM SIGMOD international conference on Management of data
Achieving robustness in distributed database systems
ACM Transactions on Database Systems (TODS)
Notes on Data Base Operating Systems
Operating Systems, An Advanced Course
Weighted voting for replicated data
SOSP '79 Proceedings of the seventh ACM symposium on Operating systems principles
Fundamentals of Applied Probability Theory
Fundamentals of Applied Probability Theory
Theory, Volume 1, Queueing Systems
Theory, Volume 1, Queueing Systems
Probabilistic language analysis of weighted voting algorithms
SIGMETRICS '90 Proceedings of the 1990 ACM SIGMETRICS conference on Measurement and modeling of computer systems
ACM Transactions on Computer Systems (TOCS)
Hierarchical Quorum Consensus: A New Algorithm for Managing Replicated Data
IEEE Transactions on Computers
Effect of Fault Tolerance on Response Time-Analysis of the Primary Site Approach
IEEE Transactions on Computers
The generalized tree quorum protocol: an efficient approach for managing replicated data
ACM Transactions on Database Systems (TODS)
Coding-Based Replication Schemes for Distributed Systems
IEEE Transactions on Parallel and Distributed Systems
A Fault-Tolerant Algorithm for Replicated Data Management
IEEE Transactions on Parallel and Distributed Systems
Analysis of Quorum-Based Protocols for Distributed (k + 1)-Exclusion
IEEE Transactions on Parallel and Distributed Systems
Partial replica selection based on relevance for information retrieval
Proceedings of the 22nd annual international ACM SIGIR conference on Research and development in information retrieval
Partial collection replication versus caching for information retrieval systems
SIGIR '00 Proceedings of the 23rd annual international ACM SIGIR conference on Research and development in information retrieval
Optimizing Vote and Quorum Assignments for Reading and Writing Replicated Data
IEEE Transactions on Knowledge and Data Engineering
Storage Efficient Replicated Databases
IEEE Transactions on Knowledge and Data Engineering
The Grid Protocol: A High Performance Scheme for Maintaining Replicated Data
IEEE Transactions on Knowledge and Data Engineering
Using Reconfiguration for Efficient Management of Replicated Data
IEEE Transactions on Knowledge and Data Engineering
IEEE Transactions on Software Engineering
Reducing Storage for Quorum Consensus Algorithms
VLDB '88 Proceedings of the 14th International Conference on Very Large Data Bases
The Tree Quorum Protocol: An Efficient Approach for Managing Replicated Data
VLDB '90 Proceedings of the 16th International Conference on Very Large Data Bases
Resilient Logical Structures for Efficient Management of Replicated Data
VLDB '92 Proceedings of the 18th International Conference on Very Large Data Bases
The Effect of Workload on the Performance and Availability of Voting Algorithms
MASCOTS '95 Proceedings of the 3rd International Workshop on Modeling, Analysis, and Simulation of Computer and Telecommunication Systems
INFOCOM '97 Proceedings of the INFOCOM '97. Sixteenth Annual Joint Conference of the IEEE Computer and Communications Societies. Driving the Information Revolution
Are quorums an alternative for data replication?
ACM Transactions on Database Systems (TODS)
An efficient QoS routing algorithm for quorumcast communication
Computer Networks: The International Journal of Computer and Telecommunications Networking
Fault tolerant algorithm based on dynamic and active load balancing for redundant services
Journal of Computer Science and Technology
| Hi-index | 0.01 |
The authors develop a model and define performance measures for a replicated data system that makes use of a quorum-consensus algorithm to maintain consistency. They consider two measures: the proportion of successfully completed transactions in systems where a transaction aborts if data is not available, and the mean response time in systems where a transaction waits until data becomes available. Based on the model, the authors show that for some quorum assignment there is an optimal degree of replication beyond which performance degrades. There exist other quorum assignments which have no optimal degree of replication. The authors also derive optimal read and write quorums which maximize the proportion of successful transactions.