Lazy replication
- 3 September 1990
- proceedings article
- Published by Association for Computing Machinery (ACM)
Abstract
We have designed a new method for constructing logically centralized, highly available services to be used in a distributed environment. Our method is intended for services that appear to clients to be logically centralized: in spite of the service's distributed implementation, it has the same observable behavior as a single copy. We take the semantics of the application implemented by the service into account in order to weaken implementation constraints and thus improve response time and increase availability; constraints can be relaxed as long as clients cannot observe the difference.Keywords
This publication has 12 references indexed in Scilit:
- Lazy replication: exploiting the semantics of distributed servicesPublished by Association for Computing Machinery (ACM) ,1990
- Exploiting virtual synchrony in distributed systemsPublished by Association for Computing Machinery (ACM) ,1987
- Axioms for concurrent objectsPublished by Association for Computing Machinery (ACM) ,1987
- Distributed Version Management for Read-Only ActionsIEEE Transactions on Software Engineering, 1987
- Highly available distributed services and fault-tolerant distributed garbage collectionPublished by Association for Computing Machinery (ACM) ,1986
- An algorithm for concurrency control and recovery in replicated distributed databasesACM Transactions on Database Systems, 1984
- Efficient solutions to the replicated log and dictionary problemsPublished by Association for Computing Machinery (ACM) ,1984
- 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