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)
Dynamic quorum adjustment for partitioned data
ACM Transactions on Database Systems (TODS)
Maintaining availability in partitioned replicated databases
ACM Transactions on Database Systems (TODS)
Performance Characterization of Quorum-Consensus Algorithms for Replicated Data
IEEE Transactions on Software Engineering
Efficient solution to the distributed mutual exclusion problem
Proceedings of the eighth annual ACM Symposium on Principles of distributed computing
Dynamic voting algorithms for maintaining the consistency of a replicated database
ACM Transactions on Database Systems (TODS)
Exploiting logical structures in replicated databases
Information Processing Letters
The tree quorum protocol: an efficient approach for managing replicated data
Proceedings of the sixteenth international conference on Very large databases
A N algorithm for mutual exclusion in decentralized systems
ACM Transactions on Computer Systems (TOCS)
Locks with constrained sharing (extended abstract)
PODS '90 Proceedings of the ninth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
On optimistic methods for concurrency control
ACM Transactions on Database Systems (TODS)
Achieving robustness in distributed database systems
ACM Transactions on Database Systems (TODS)
A Majority consensus approach to concurrency control for multiple copy databases
ACM Transactions on Database Systems (TODS)
Consistency in Hierarchical Database Systems
Journal of the ACM (JACM)
Inexact agreement: accuracy, precision, and graceful degradation
Proceedings of the fourth annual ACM symposium on Principles of distributed computing
Consistency and recovery control for replicated files
Proceedings of the tenth ACM symposium on Operating systems principles
An efficient, fault-tolerant protocol for replicated data management
PODS '85 Proceedings of the fourth ACM SIGACT-SIGMOD symposium on Principles of database systems
Fail-stop processors: an approach to designing fault-tolerant computing systems
ACM Transactions on Computer Systems (TOCS)
The notions of consistency and predicate locks in a database system
Communications of the ACM
Efficient Dynamic Voting Algorithms
Proceedings of the Fourth International Conference on Data Engineering
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
NAMING AND SYNCHRONIZATION IN A DECENTRALIZED COMPUTER SYSTEM
NAMING AND SYNCHRONIZATION IN A DECENTRALIZED COMPUTER SYSTEM
Delay-Optimal Quorum Consensus for Distributed Systems
IEEE Transactions on Parallel and Distributed Systems
Disaster recovery techniques for database systems
Communications of the ACM
Diamond Quorum Consensus for High Capacity and Efficiency in a Replicated Database System
Distributed and Parallel Databases
Using Reconfiguration for Efficient Management of Replicated Data
IEEE Transactions on Knowledge and Data Engineering
Resilient Logical Structures for Efficient Management of Replicated Data
VLDB '92 Proceedings of the 18th International Conference on Very Large Data Bases
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
Are quorums an alternative for data replication?
ACM Transactions on Database Systems (TODS)
Specifying and using intrusion masking models to process distributed operations
Journal of Computer Security
Data replication model for remote procedure call transactions
DIWEB'06 Proceedings of the 5th WSEAS International Conference on Distance Learning and Web Engineering
Timed buffers: A technique for update propagation in nomadic environments
Computer Communications
Quorum based data replication in grid environment
RSKT'08 Proceedings of the 3rd international conference on Rough sets and knowledge technology
A new approach for efficiently achieving high availability in mobile computing
ICCSA'05 Proceedings of the 2005 international conference on Computational Science and Its Applications - Volume Part III
| Hi-index | 0.02 |
In this paper, we present a low-cost fault-tolerant protocol for managing replicated data. We impose a logical tree structure on the set of copies of an object and develop a protocol that uses the information available in the logical structure to reduce the communication requirements for read and write operations. The tree quorum protocol is a generalization of the static voting protocol with two degrees of freedom for choosing quorums. In general, this results in significantly lower communication costs for comparable data availability. The protocol exhibits the property of graceful degradation, i.e., communication costs for executing operations are minimal in a failure-free environment but may increase as failures occur. This approach in designing distributed systems is desirable since it provides fault-tolerance without imposing unnecessary costs on the failure-free mode of operations.