Providing high availability using lazy replication
Authors:
Open Access
- 1 November 1992
- journal article
- Published by Association for Computing Machinery (ACM) in ACM Transactions on Computer Systems
- Vol. 10 (4) , 360-391
Abstract
To provide high availability for services such as mail or bulletin boards, data must be replicated. One way to guarantee consistency of replicated data is to force service operations to occur in the same order at all sites, but this approach is expensive. For some applications a weaker causal operation order can preserve consistency while providing better performance. This paper describes a new way of implementing causal operations. Our technique also supports two other kinds of operations: operations that are totally ordered with respect to one another and operations that are totally ordered with respect to all other operations. The method performs well in terms of response time, operation-processing capacity, amount of stored state, and number and size of messages; it does better than replication methods based on reliable multicast techniques.Keywords
This publication has 23 references indexed in Scilit:
- Lightweight causal and atomic group multicastACM Transactions on Computer Systems, 1991
- Two phase gossip: Managing distributed event historiesInformation Sciences, 1989
- Network Time Protocol (version 1) specification and implementation1988
- Distributed programming in ArgusCommunications of the ACM, 1988
- Reliable communication in the presence of failuresACM Transactions on Computer Systems, 1987
- A quorum-consensus replication method for abstract data typesACM Transactions on Computer Systems, 1986
- An algorithm for concurrency control and recovery in replicated distributed databasesACM Transactions on Database Systems, 1984
- GrapevineCommunications of the ACM, 1982
- Weighted voting for replicated data1979
- Time, clocks, and the ordering of events in a distributed systemCommunications of the ACM, 1978