by
Barbara Liskov
,
Rivka Ladin
,
Rivka Ladin
,
Rivka Ladin
,
Barbara Liskov
,
Barbara Liskov
,
Liuba Shrira
,
Liuba Shrira
,
Liuba Shrira
,
Sanjay Ghemawat
,
Sanjay Ghemawat
,
Sanjay Ghemawat
in IEEE Computer Society Technical Committee on Operating Systems and Application Environments
Add To MetaCart
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 define the required order dynamically during the execution, operations for which the service defines the order, and operations that must be globally ordered with respect to both client ordered and service ordered operations. The method performs well in terms of response time, amount of stored state, number of messages, and availability. It is especially well suited to applications in which most operations require only the client-defined order.
Citations
|
456
|
Weighted voting for replicated data
– Gifford
- 1979
|
|
455
|
Reliable Communication in the Presence of Failures
– Birman, Joseph
- 1987
|
|
267
|
Exploiting Virtual Synchrony in Distributed Systems
– Birman, Joseph
|
|
257
|
Fail-Stop Processors: an Approach to Designing Faulttolerant
– Schlichting, Schneider
- 1983
|
|
223
|
Distributed Programming in Argus
– Liskov
- 1988
|
|
212
|
Preserving and using context information in interprocess communication
– Peterson, Bucholz, et al.
- 1989
|
|
170
|
Grapevine: An exercise in distributed computing
– Birrell, Levin, et al.
- 1982
|
|
124
|
Replication Methods for Abstract Data Types
– Herlihy
- 1984
|
|
122
|
A principle for resilient sharing of distributed resources
– Alsberg, Day
- 1976
|
|
100
|
Designing a global name service
– Lampson
- 1986
|
|
98
|
Detection of Mutual Inconsistency in Distributed Databases
– Parker
- 1983
|
|
89
|
An algorithm for concurrency control and recovery in replicated distributed databases
– Bernstein, Goodman
- 1984
|
|
88
|
Availability in Partitioned Replicated Databases
– Abbadi, Toueg
- 1986
|
|
88
|
Efficient Solutions to the Replicated Log and Dictionary
– Wuu, Bernstein
- 1984
|
|
80
|
Crash Recovery in a Distributed Data Storage System
– Lampson, Sturgis
- 1976
|
|
78
|
Axioms for concurrent objects
– Wing
- 1987
|
|
73
|
An efficient faulttolerant protocol for replicated data management
– Abbadi, Skeen, et al.
- 1985
|
|
48
|
Sacrificing Serializability to Attain High Availability of Data in an Unreliable Network
– Fischer, Michael
- 1982
|
|
45
|
Viewstamped replication: a new primary copy method to support highly available distributed systems
– Oki, Liskov
- 1988
|
|
39
|
Highly-available distributed services and fault-tolerant distributed garbage collection
– Liskov, Ladin
- 1986
|
|
38
|
Implementing Fault-Tolerant Replicated Objects Using Psync
– Mishra, Peterson, et al.
- 1989
|
|
36
|
Distributed Version Management for Read-only Actions
– Weihl
- 1987
|
|
25
|
Two Phase Gossip: Managing Distributed Event Histories
– Heddaya, Hsu, et al.
- 1989
|
|
21
|
Reliable Object Storage to Support Atomic Actions
– Oki, Liskov, et al.
- 1985
|
|
19
|
Fast causal multicast
– Birman, Schiper, et al.
- 1990
|
|
16
|
Viewstamped Replication for Highly Available Distributed Systems
– Oki
- 1988
|
|
11
|
Increasing Availability in Partitioned Database Systems
– Skeen, Wright
- 1984
|
|
10
|
Constructing a Highly-Available Location Service for a Distributed Environment
– Hwang
- 1988
|
|
10
|
A Method for Constructing Highly Available Services and a Technique for Distributed Garbage Collection
– Ladin
- 1989
|
|
5
|
Orphan detection (extended abstract
– Liskov, Scheifler, et al.
- 1987
|
|
4
|
A Deadlock Detection Scheme for Argus
– Farrell
- 1988
|
|
4
|
A Technique for Constructing Highly-Available Services. Algorithmica
– Ladin, Liskov, et al.
- 1988
|
|
3
|
the Ordering of Events in a Distributed System
– Lainport, Clocks
- 1978
|
|
2
|
Network Time Protocol (versionl ) specification and implementation. DARPA-Internet Report RFC-1059
– Mills
- 1988
|
