Voting class — an approach to achieving high availability for replicated data

Authors:
Jian Tang
Affiliations:
Department of Computer Science, Memorial University of Newfoundland, St. John's, Nfld, A1C 5S7, Canada
Venue:
DPDS '90 Proceedings of the second international symposium on Databases in parallel and distributed systems
Year:
1990

Citing 14
Cited 0

Optimism and consistency in partitioned distributed database systems

ACM Transactions on Database Systems (TODS)
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
Concurrency control and recovery in database systems

Concurrency control and recovery in database systems
Dynamic quorum adjustment for partitioned data

ACM Transactions on Database Systems (TODS)
Dynamic voting

SIGMOD '87 Proceedings of the 1987 ACM SIGMOD international conference on Management of data
A static pessimistic scheme for handling replicated databases

SIGMOD '89 Proceedings of the 1989 ACM SIGMOD international conference on Management of data
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
Nonblocking commit protocols

SIGMOD '81 Proceedings of the 1981 ACM SIGMOD international conference on Management of data
A Scheme for Maintaining Consistency and Availability of Replicated Files in a Partitioned Distributed System

Proceedings of the Fifth International Conference on Data Engineering
Enhancements to the Voting Algorithm

VLDB '87 Proceedings of the 13th International Conference on Very Large Data Bases
Weighted voting for replicated data

SOSP '79 Proceedings of the seventh ACM symposium on Operating systems principles
Maintaining Availability in Partitioned Replicated Databases

Maintaining Availability in Partitioned Replicated Databases

Quantified Score

Hi-index	0.00

Visualization

Abstract

In a distributed system, data are often replicated to increase the availability in the face of node and communication failures. However, updates to replicated data must be properly controlled to avoid data inconsistency. This can adversely affect the availability. In this paper, we propose an approach to the design of replica control schemes which can provide higher availability than currently existing voting schemes. The approach is based on the observation that the existing voting schemes actually belong to a general class, called voting class. This class of voting schemes can be represented in a very simple and uniform way. Thus a designer can choose the optimal scheme within the voting class by evaluating each of them and choose the one which maximizes the availability.