Lazy replication: exploiting the semantics of distributed services
- 1 August 1990
- proceedings article
- Published by Association for Computing Machinery (ACM)
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. In this paper, we propose lazy replication as a way to preserve consistency by exploiting the semantics of the service's operations to relax the constraints on ordering. Three kinds of operations are supported: operations for which the clients ...Keywords
This publication has 21 references indexed in Scilit:
- Two phase gossip: Managing distributed event historiesInformation Sciences, 1989
- Preserving and using context information in interprocess communicationACM Transactions on Computer Systems, 1989
- 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
- Fail-stop processorsACM Transactions on Computer Systems, 1983
- GrapevineCommunications of the ACM, 1982
- Weighted voting for replicated dataPublished by Association for Computing Machinery (ACM) ,1979
- Time, clocks, and the ordering of events in a distributed systemCommunications of the ACM, 1978