An algorithm for concurrency control and recovery in replicated distributed databases
ACM Transactions on Database Systems (TODS)
A quorum-consensus replication method for abstract data types
ACM Transactions on Computer Systems (TOCS)
Reliable communication in the presence of failures
ACM Transactions on Computer Systems (TOCS)
Concurrency control and recovery in database systems
Concurrency control and recovery in database systems
Viewstamped Replication: A New Primary Copy Method to Support Highly-Available Distributed Systems
PODC '88 Proceedings of the seventh annual ACM Symposium on Principles of distributed computing
Maintaining availability in partitioned replicated databases
ACM Transactions on Database Systems (TODS)
The tree quorum protocol: an efficient approach for managing replicated data
Proceedings of the sixteenth international conference on Very large databases
Employing replication to achieve high availability and efficiency in distributed systems
Employing replication to achieve high availability and efficiency in distributed systems
IEEE Transactions on Software Engineering
Achieving robustness in distributed database systems
ACM Transactions on Database Systems (TODS)
Reliability mechanisms for SDD-1: a system for distributed databases
ACM Transactions on Database Systems (TODS)
Transaction Processing: Concepts and Techniques
Transaction Processing: Concepts and Techniques
VELOS: A New Approach for Efficiently Achieving High Availability in Partitioned Distributed Systems
IEEE Transactions on Knowledge and Data Engineering
Multiclass Replicated Data Management: Exploiting Replication to Improve Efficiency
IEEE Transactions on Parallel and Distributed Systems
Read-Only Transactions in Partitioned Replicated Databases
Proceedings of the Fifth International Conference on Data Engineering
Efficiently Maintaining Availability in the Presence of Partitionings in Distributed Systems
Proceedings of the Seventh International Conference on Data Engineering
Distributed Systems - Architecture and Implementation, An Advanced Course
Weighted voting for replicated data
SOSP '79 Proceedings of the seventh ACM symposium on Operating systems principles
The failure and recovery problem for replicated databases
PODC '83 Proceedings of the second annual ACM symposium on Principles of distributed computing
A STUDY OF THE RELIABILITY OF INTERNET SITES
A STUDY OF THE RELIABILITY OF INTERNET SITES
The management of replication in a distributed system
The management of replication in a distributed system
Achieving Strong Consistency in a Distributed File System
IEEE Transactions on Software Engineering
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
Agent based dynamic recovery protocol in distributed databases
ISPDC'03 Proceedings of the Second international conference on Parallel and distributed computing
Hi-index | 0.00 |
In large systems, replication can become important means to improve data access times and availability. Existing recovery protocols, on the other hand, were proposed for small-scale distributed systems. Such protocols typically update stale, newly-recovered sites with replicated data and resolve the commit uncertainty of recovering sites. Thus, given that in large systems failures are more frequent and that data access times are costlier, such protocols can potentially introduce large overheads in large systems and must be avoided, if possible. We call these protocols dependent recovery protocols since they require a recovering site to consult with other sites. Independent recovery has been studied in the context of one-copy systems and has been proven unattainable. This paper offers independent recovery protocols for large-scale systems with replicated data. It shows how the protocols can be incorporated into several well-known replication protocols and proves that these protocols continue to ensure data consistency. The paper then addresses the issue of nonblocking atomic commitment. It presents mechanisms which can reduce the overhead of termination protocols and the probability of blocking. Finally, the performance impact of the proposed recovery protocols is studied through the use of simulation and analytical studies. The results of these studies show that the significant benefits of independent recovery can be enjoyed with a very small loss in data availability and a very small increase in the number of transaction abortions.