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
An efficient and fault-tolerant solution for distributed mutual exclusion
ACM Transactions on Computer Systems (TOCS)
ACM Transactions on Computer Systems (TOCS)
Hierarchical Quorum Consensus: A New Algorithm for Managing Replicated Data
IEEE Transactions on Computers
On a Unified Framework for the Evaluation of Distributed Quorum Attainment Protocols
IEEE Transactions on Software Engineering
A Fault-Tolerant Algorithm for Replicated Data Management
IEEE Transactions on Parallel and Distributed Systems
A Majority consensus approach to concurrency control for multiple copy databases
ACM Transactions on Database Systems (TODS)
An efficient, fault-tolerant protocol for replicated data management
PODS '85 Proceedings of the fourth ACM SIGACT-SIGMOD symposium on Principles of database systems
Efficient Dynamic Voting Algorithms
Proceedings of the Fourth International Conference on Data Engineering
The Grid Protocol: A High Performance Scheme for Maintaining Replicated Data
Proceedings of the Sixth International Conference on Data Engineering
Weighted voting for replicated data
SOSP '79 Proceedings of the seventh ACM symposium on Operating systems principles
Minimizing the Maximum Delay for Reaching Consensus in Quorum-Based Mutual Exclusion Schemes
IEEE Transactions on Parallel and Distributed Systems
Diamond Quorum Consensus for High Capacity and Efficiency in a Replicated Database System
Distributed and Parallel Databases
Performance Modeling of Distributed and Replicated Databases
IEEE Transactions on Knowledge and Data Engineering
Increasing the Expressiveness of Analytical Performance Models for Replicated Databases
ICDT '99 Proceedings of the 7th International Conference on Database Theory
Delay Optimizations in Quorum Consensus
ISAAC '01 Proceedings of the 12th International Symposium on Algorithms and Computation
Are quorums an alternative for data replication?
ACM Transactions on Database Systems (TODS)
Distributed and Parallel Databases
A replication protocol with composite topology for high adaptability
ICCSA'03 Proceedings of the 2003 international conference on Computational science and its applications: PartI
Symmetric tree replication protocol for efficient distributed storage system
ICCS'03 Proceedings of the 2003 international conference on Computational science: PartIII
Dynamic hybrid replication effectively combining tree and grid topology
The Journal of Supercomputing
| Hi-index | 0.00 |
Management of replicated data has received considerable attention in the last few years. Several replica control schemes have been proposed which work in the presence of both node and communication link failures. However, this resiliency to failure inflicts a performance penalty in terms of the communication overhead incurred. Though the issue of performance of these schemes from the standpoint of availability of the system has been well addressed, the issue of message overhead has been limited to the analysis of worst case and best case message bounds. In this paper we derive expressions for computing the average message overhead of several well known replica control protocols and provide a comparative study of the different protocols with respect to both average message overhead and system availabilities.