Consistency in a partitioned network: a survey
ACM Computing Surveys (CSUR)
Limitations on database availability when networks partition
PODC '86 Proceedings of the fifth annual ACM symposium on Principles of distributed computing
Concurrency control and recovery in database systems
Concurrency control and recovery in database systems
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
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)
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
Achieving robustness in distributed database systems
ACM Transactions on Database Systems (TODS)
The serializability of concurrent database updates
Journal of the ACM (JACM)
Replication and fault-tolerance in the ISIS system
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
A Survey of Techniques for Synchronization and Recovery in Decentralized Computer Systems
ACM Computing Surveys (CSUR)
A Nonblocking Quorum Consensus Protocol for Replicated Data
IEEE Transactions on Parallel and Distributed Systems
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
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
The management of replication in a distributed system
The management of replication in a distributed system
Independent Recovery in Large-Scale Distributed Systems
IEEE Transactions on Software Engineering
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
Availability and Reliability Issues in Distributed Databases Using Optimal Horizontal Fragmentation
DEXA '99 Proceedings of the 10th International Conference on Database and Expert Systems Applications
An analysis of update ordering in distributed replication systems
Future Generation Computer Systems - Special issue: Advanced services for clusters and internet computing
Detecting and tolerating failures in a loosely integrated heterogeneous database system
Computer Communications
| Hi-index | 0.00 |
This work presents a new protocol, VELOS, for tolerating partitionings in distributed systems with replicated data. Our primary goals were influenced by efficiency and availability constraints. The proposed protocol achieves optimal availability, according to a well known metric, while ensuring one-copy serializability. In addition, however, VELOS is designed to reduce the cost involved in achieving high availability. We have developed mechanisms through which transactions, in the absence of failures, can access replicated data objects and observe shorter delays than related protocols, and impose smaller loads on the network and the servers. Furthermore, VELOS offers high availability without relying on system transactions that must execute to restore availability when failures and recoveries occur. Such system transactions typically access all (replicas of all) data objects and thus introduce significant delays to user transactions and consume large quantities of resources such as network bandwidth and CPU cycles. Thus, we offer our protocol as a proof that high availability can be achieved inexpensively.