Consistency in a partitioned network: a survey
ACM Computing Surveys (CSUR)
Availability in partitioned replicated databases
PODS '86 Proceedings of the fifth ACM SIGACT-SIGMOD symposium on Principles of database systems
Dynamic quorum adjustment for partitioned data
ACM Transactions on Database Systems (TODS)
SIGMOD '87 Proceedings of the 1987 ACM SIGMOD international conference on Management of data
Impossibility of distributed consensus with one faulty process
Journal of the ACM (JACM)
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
Concurrency Control in Distributed Database Systems
ACM Computing Surveys (CSUR)
Fail-stop processors: an approach to designing fault-tolerant computing systems
ACM Transactions on Computer Systems (TOCS)
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
Enhancements to the Voting Algorithm
VLDB '87 Proceedings of the 13th International Conference on Very Large Data Bases
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
Understanding fault-tolerant distributed systems
Communications of the ACM
PODC '91 Proceedings of the tenth annual ACM symposium on Principles of distributed computing
A tight upper bound on the benefits of replication and consistency control protocols
PODS '91 Proceedings of the tenth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
ACM Transactions on Computer Systems (TOCS)
Design of optimal distributed file systems: a framework for research
ACM SIGOPS Operating Systems Review
Multiview access protocols for large-scale replication
ACM Transactions on Database Systems (TODS)
Light-Weight Currency Management Mechanisms in Mobile and Weakly-Connected Environments
Distributed and Parallel Databases
The Grid Protocol: A High Performance Scheme for Maintaining Replicated Data
IEEE Transactions on Knowledge and Data Engineering
A One-Phase Algorithm to Detect Distributed Deadlocks in 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
A survey of permission-based distributed mutual exclusion algorithms
Computer Standards & Interfaces
Information Dissemination in Partitionable Mobile Ad Hoc Networks
SRDS '99 Proceedings of the 18th IEEE Symposium on Reliable Distributed Systems
Application-based dynamic primary views in asynchronous distributed systems
Journal of Parallel and Distributed Computing
Are quorums an alternative for data replication?
ACM Transactions on Database Systems (TODS)
IEEE Transactions on Knowledge and Data Engineering
ICCC'11 Proceedings of the 2011 international conference on Computers and computing
Hi-index | 0.02 |
Voting is used commonly to enforce mutual exclusion in distributed systems. Each node is assigned a number of votes, and only the group with a majority of votes is allowed to perform a restricted operation. This paper describes techniques for dynamically reassigning votes upon node or link failure, in an attempt to make the system more resilient to future failures. We focus on autonomous methods for achieving this, that is, methods that allow the nodes to make independent choices about changing their votes and picking new vote values, rather than group consensus techniques that require tight coordination among the remaining nodes. Protocols are given which allow nodes to install new vote values while still maintaining mutual exclusion requirements. The lemmas and theorems to validate the protocols are presented. A simple example shows how to apply the method to a database object-locking scheme; the protocols, however, are versatile and general purpose, and can be used for any application requiring mutual exclusion. In addition, policies are presented that allow nodes to autonomously select their new vote values. Simulation results are presented comparing the autonomous methods to static vote assignments and to group consensus strategies. These results demonstrate that under high failure rates, dynamic vote reassignment shows great improvement over a static assignment of votes in terms of availability. In addition, many autonomous methods for determining a new vote assignment yield almost as much availability as a group consensus method and at the same time are faster and more flexible.