How to assign votes in a distributed system
Journal of the ACM (JACM)
Consistency in a partitioned network: a survey
ACM Computing Surveys (CSUR)
Protocols for dynamic vote reassignment
PODC '86 Proceedings of the fifth annual ACM symposium on Principles of distributed computing
Availability in partitioned replicated databases
PODS '86 Proceedings of the fifth ACM SIGACT-SIGMOD symposium on Principles of database systems
The Reliability of Voting Mechanisms
IEEE Transactions on Computers
SIGMOD '87 Proceedings of the 1987 ACM SIGMOD international conference on Management of data
Performance Characterization of Quorum-Consensus Algorithms for Replicated Data
IEEE Transactions on Software Engineering
Achieving robustness in distributed database systems
ACM Transactions on Database Systems (TODS)
Consistency and recovery control for replicated files
Proceedings of the tenth ACM symposium on Operating systems principles
Computational algorithms for closed queueing networks with exponential servers
Communications of the ACM
Reducing Storage for Quorum Consensus Algorithms
VLDB '88 Proceedings of the 14th International Conference on Very Large Data Bases
Weighted voting for replicated data
SOSP '79 Proceedings of the seventh ACM symposium on Operating systems principles
ACM Transactions on Computer Systems (TOCS)
Storage Efficient and Secure Replicated Distributed Databases
IEEE Transactions on Knowledge and Data Engineering
A Theory of Coteries: Mutual Exclusion in Distributed Systems
IEEE Transactions on Parallel and Distributed Systems
Obtaining Coteries That Optimize the Availability of Replicated Databases
IEEE Transactions on Knowledge and Data Engineering
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
Application specific data replication for edge services
WWW '03 Proceedings of the 12th international conference on World Wide Web
A survey of permission-based distributed mutual exclusion algorithms
Computer Standards & Interfaces
Improving Availability and Performance with Application-Specific Data Replication
IEEE Transactions on Knowledge and Data Engineering
Distributed Computing
Dual-quorum replication for edge services
Proceedings of the ACM/IFIP/USENIX 2005 International Conference on Middleware
Dual-Quorum replication for edge services
Middleware'05 Proceedings of the ACM/IFIP/USENIX 6th international conference on Middleware
| Hi-index | 0.00 |
In the weighted voting protocol which is used to maintain the consistency of replicated data, the availability of the data to ready and write operations not only depends on the availability of the nodes storing the data but also on the vote and quorum assignments used. The authors consider the problem of determining the vote and quorum assignments that yield the best performance in a distributed system where node availabilities can be different and the mix of the read and write operations is arbitrary. The optimal vote and quorum assignments depend not only on the system parameters, such as node availability and operation mix, but also on the performance measure. The authors present an enumeration algorithm that can be used to find the vote and quorum assignments that need to be considered for achieving optimal performance. When the performance measure is data availability, an analytical method is derived to evaluate it for any vote and quorum assignment. This method and the enumeration algorithm are used to find the optimal vote and quorum assignment for several systems. The enumeration algorithm can also be used to obtain the optimal performance when other measures are considered.