Efficiently maintaining availability in the presence of partitionings in distributed systems
- 10 December 2002
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE)
Abstract
A new approach is presented for handling partitionings in replicated distributed databases. Mechanisms are developed through which transactions can access replicated data objects and observe delays similar to nonreplicated systems while enjoying the availability benefits of replication. The replication control protocol, called VELOS, achieves optimal availability, according to a well-known metric, while ensuring one-copy serializability. It is shown to provide better availability than other methods which meet the same optimality criterion. It offers these availability characteristics without relying on system transactions that must execute to restore availability, when failures and recoveries occur, but which introduce significant delays to user transactions.<>Keywords
This publication has 9 references indexed in Scilit:
- A new paradigm for high availability and efficiency in replicated distributed databasesPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2002
- Maintaining availability in partitioned replicated databasesACM Transactions on Database Systems, 1989
- Dynamic quorum adjustment for partitioned dataACM Transactions on Database Systems, 1987
- Limitations on database availability when networks partitionPublished by Association for Computing Machinery (ACM) ,1986
- Replication and fault-tolerance in the ISIS systemPublished by Association for Computing Machinery (ACM) ,1985
- An efficient, fault-tolerant protocol for replicated data managementPublished by Association for Computing Machinery (ACM) ,1985
- Achieving robustness in distributed database systemsACM Transactions on Database Systems, 1983
- Chapter 11. Atomic transactionsPublished by Springer Nature ,1981
- The serializability of concurrent database updatesJournal of the ACM, 1979