Providing high availability using lazy replication
Rivka Ladin, Barbara H. Liskov, Liuba Shrira et al. · ACM Transactions on Computer Systems · 1992
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.
Cited by 384 works. doi:10.1145/138873.138877 Open-access PDF
Authors
References
- Time, clocks, and the ordering of events in a distributed system
- Time, clocks, and the ordering of events in a distributed system
- Crash Recovery in a Distributed Data Storage System
- Grapevine
- Weighted voting for replicated data
- A principle for resilient sharing of distributed resources
- Reliable communication in the presence of failures
- Introduction 1-2
- Lightweight causal and atomic group multicast
- Replication in the harp file system