An algorithm for concurrency control and recovery in replicated distributed databases
ACM Transactions on Database Systems (TODS)
How to assign votes in a distributed system
Journal of the ACM (JACM)
Consistency in a partitioned network: a survey
ACM Computing Surveys (CSUR)
A quorum-consensus replication method for abstract data types
ACM Transactions on Computer Systems (TOCS)
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
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
Dynamic voting algorithms for maintaining the consistency of a replicated database
ACM Transactions on Database Systems (TODS)
Weighted voting for operation dependent management of replicated data
Proceedings of the 4th international workshop on Distributed algorithms
A Majority consensus approach to concurrency control for multiple copy databases
ACM Transactions on Database Systems (TODS)
Efficient Dynamic Voting Algorithms
Proceedings of the Fourth International Conference on Data Engineering
Integrating Static and Dynamic Voting Protocols To Enhance File Availability
Proceedings of the Fourth International Conference on Data Engineering
Optimizing Vote and Quorum Assignments for Reading and Writing Replicated Data
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
Crumbling walls: a class of practical and efficient quorum systems
Proceedings of the fourteenth annual ACM symposium on Principles of distributed computing
An adaptive data replication algorithm
ACM Transactions on Database Systems (TODS)
Minimizing the Maximum Delay for Reaching Consensus in Quorum-Based Mutual Exclusion Schemes
IEEE Transactions on Parallel and Distributed Systems
Improving the Availability of Mutual Exclusion Systems on Incomplete Networks
IEEE Transactions on Computers
Efficient generation of all regular non-dominated coteries
Proceedings of the nineteenth annual ACM symposium on Principles of distributed computing
Nondominated Coteries on Graphs
IEEE Transactions on Parallel and Distributed Systems
Local majorities, coalitions and monopolies in graphs: a review
Theoretical Computer Science
A survey of permission-based distributed mutual exclusion algorithms
Computer Standards & Interfaces
Evaluating quorum systems over the Internet
FTCS '96 Proceedings of the The Twenty-Sixth Annual International Symposium on Fault-Tolerant Computing (FTCS '96)
Are quorums an alternative for data replication?
ACM Transactions on Database Systems (TODS)
The costs and limits of availability for replicated services
ACM Transactions on Computer Systems (TOCS)
Optimal decision strategies in Byzantine environments
Journal of Parallel and Distributed Computing
Proxy agent based replication control model for wireless internet
Information Sciences: an International Journal
| Hi-index | 0.01 |
This paper investigates the problem of finding an optimal static pessimistic replica control scheme. It has been widely accepted that coteries (proposed by Garcia-Molina and Barbara) provide the most general framework for such schemes. We demonstrate that voting schemes, a very small subset of static pessimistic schemes, are optimal for fully connected networks with negligible link failure rates, as well as for Ethernet systems. Wealso show that voting is not optimal for somewhat more general systems. We propose amodification of the algorithm of Z. Tong and R.Y. Kain (1988) for computing optimal voting in operation independent case, so that it runs in linear (rather than exponential) time. Finally, we propose the first efficient algorithm for computing the optimal vote assignment and appropriate thresholds for fully connected networks when relative frequencies of read and write operations are known. We also extend this result to Ethernet systems.