Maintaining availability in partitioned replicated databases
ACM Transactions on Database Systems (TODS)
Dynamic voting algorithms for maintaining the consistency of a replicated database
ACM Transactions on Database Systems (TODS)
The availability of quorum systems
Information and Computation
Efficient message ordering in dynamic networks
PODC '96 Proceedings of the fifteenth annual ACM symposium on Principles of distributed computing
Dynamic voting for consistent primary components
PODC '97 Proceedings of the sixteenth annual ACM symposium on Principles of distributed computing
A dynamic view-oriented group communication service
PODC '98 Proceedings of the seventeenth annual ACM symposium on Principles of distributed computing
ACM Transactions on Computer Systems (TOCS)
Increasing the resilience of distributed and replicated database systems
Journal of Computer and System Sciences - Fourteenth ACM SIGACT-SIGMOD-SIGART symposium on principles of database systems
Reliable Distributed Computing with the ISIS Toolkit
Reliable Distributed Computing with the ISIS Toolkit
Efficient Dynamic Voting Algorithms
Proceedings of the Fourth International Conference on Data Engineering
Evaluating quorum systems over the Internet
FTCS '96 Proceedings of the The Twenty-Sixth Annual International Symposium on Fault-Tolerant Computing (FTCS '96)
Analyzing dynamic voting using Petri nets
SRDS '96 Proceedings of the 15th 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)
Fastpath Optimizations for Cluster Recovery in Shared-Disk Systems
Proceedings of the 2004 ACM/IEEE conference on Supercomputing
Fault tolerant algorithms for heat transfer problems
Journal of Parallel and Distributed Computing
The obscure nature of epidemic quorum systems
Proceedings of the 9th workshop on Mobile computing systems and applications
Challenges in evaluating distributed algorithms
Future directions in distributed computing
Hi-index | 0.00 |
Abstract: Fault tolerant distributed systems often select a primary component to allow a subset of the processes to function when failures occur. The dynamic voting paradigm defines rules for selecting the primary component adaptively: when a partition occurs, if a majority of the previous primary component is connected, a new and possibly smaller primary is chosen. Several studies have shown that dynamic voting leads to more available solutions than other paradigms for maintaining a primary component. However, these studies have assumed that every attempt made by the algorithm to form a new primary component terminates successfully. Unfortunately, in real systems, this is not always the case: a change in connectivity can interrupt the algorithm while it is still attempting to form a new primary component; in such cases, algorithms may block until processes can resolve the outcome of the interrupted attempt. This paper uses simulations to evaluate the effect of interruptions on the availability of dynamic voting algorithms. We study four dynamic voting algorithms, and identify two important characteristics that impact an algorithm's availability in runs with frequent connectivity changes. First, we show that the number of processes that need to be present in order to resolve past attempts impacts the availability, especially during long runs with numerous connectivity changes. Second, more surprisingly, we show that the number of communication rounds exchanged in an algorithm plays a significant role in the availability achieved, especially in the degradation of availability as connectivity changes become more frequent.