See this document in CiteSeerX!

Lazy Replication: Exploiting the Semantics of Distributed Services (1990)  (Make Corrections)  (81 citations)
Rivka Ladin, Barbara Liskov, Liuba Shrira, Sanjay Ghemawat
IEEE Computer Society Technical Committee on Operating Systems and Application Environments



  Home/Search   Context   Related

 
View or download:
mit.edu/publicatio...MITLCSTR484.pdf
mit.edu/publication...MITLCSTR484.ps
Cached:  PS.gz  PS  PDF   Image  Update  Help
Problem Downloading?
From:  mit.edu/publications/pubs/pdf/ (more)
(Enter author homepages)

Rate this article: (best)
  Comment on this article  
(Enter summary)

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 ... (Update)

Context of citations to this paper:   More

...incompletely or ambiguously speci ed, it remains important to provide formal consistency guarantees. Ladin, Liskov, Shrira, and Ghemawat [13] de ne a replicated data service. They specify general conditions for such a service, and present an algorithm based on lazy...

Cited by:   More
Independent Updates and Incremental - Agreement In Replicated   (Correct)
Subscription Propagation in Highly-Available - Publish Subscribe Middleware   (Correct)
Providing Efficient I/O Redundancy in MPI Environments - Gropp, Ross, Miller (2004)   (Correct)

Similar documents (at the sentence level):
26.0%:   Providing High Availability Using Lazy Replication - Ladin (1992)   (Correct)

Active bibliography (related documents):   More   All
0.4:   HARP: A Hierarchical Asynchronous Replication Protocol for.. - Adly (1993)   (Correct)
0.3:   Distributed Systems: A Comprehensive Survey - Borghoff, Nast-Kolb   (Correct)
0.3:   Fundamental Study Revisiting the PAXOS algorithm - De Prisco, Lampson, Lynch (2000)   (Correct)

Similar documents based on text:   More   All
0.6:   Coordinated Resource Management in a Replicated Object.. - Ghemawat, Gruber..   (Correct)
0.5:   Providing Persistent Objects in Distributed Systems - Liskov, Castro, Shrira, Adya (1999)   (Correct)
0.4:   Replication in the Harp File System - Liskov, Ghemawat, Gruber, Johnson, .. (1991)   (Correct)

Related documents from co-citation:   More   All
30:   Preserving and Using Context Information in Interprocess Communication - Peterson, Buchholdz et al. - 1989
26:   Weighted Voting for Replicated Data - Gifford - 1979
23:   Reliable communication in the presence of failures (context) - Birman, Joseph - 1987

BibTeX entry:   (Update)

Rivka Ladin, Barbara Liskov, Liuba Shrira, and Sanjay Ghemawat. Lazy replication: exploiting the semantics of distributed services. Technical report MIT/LCS/TR--484. Laboratory for Computer Science, Massachusetts Institute of Technology, Cambridge, MA, July 1990. http://citeseer.ist.psu.edu/ladin90lazy.html   More

@inproceedings{ ladin90lazy,
    author = "Rivka Ladin and Barbara Liskov and Liuba Shrira",
    title = "Lazy Replication: Exploiting the Semantics of Distributed Services",
    booktitle = "{IEEE} Computer Society Technical Committee on Operating Systems and Application Environments",
    volume = "4",
    number = "3",
    publisher = "{IEEE} Computer Society",
    pages = "4--7",
    year = "1990",
    url = "citeseer.ist.psu.edu/ladin90lazy.html" }
Citations (may not include all citations):
361   Reliable Communication in the Presence of Failures (context) - Birman, Joseph - 1987  ACM   DBLP
216   Exploiting Virtual Synchrony in Distributed Systems (context) - Birman, Joseph - 1987  ACM   DBLP
214   Preserving and using context information in interprocess com.. - Peterson, Bucholz et al. - 1989  ACM   DBLP
177   Fail-Stop Processors: An Approach to Designing Fault-Toleran.. - Schlichting, Schneider - 1983  DBLP
174   Distributed Programming in Argus (context) - Liskov - 1988  ACM   DBLP
136   Grapevine: An Exercise in Distributed Computing (context) - Birrell, Levin et al. - 1982  DBLP
92   Detection of Mutual Inconsistency in Distributed Systems (context) - Parker, Popek et al. - 1983  ACM   DBLP
83   Designing a Global Name Service - Lampson - 1986  ACM   DBLP
81   A Principle for Resilient Sharing of Distributed Resources (context) - Alsberg, Day - 1976  ACM   DBLP
79   A Quorum-consensus Replication Method for Abstract Data Type.. (context) - Herlihy - 1986  ACM   DBLP
64   An Algorithm for Concurrency Control and Recovery in Replica.. (context) - Bernstein, Goodman - 1984  ACM   DBLP
58   Crash Recovery in a Distributed Data Storage System - Lampson, Sturgis - 1979
57   Efficient Solutions to the Replicated Log and Dictionary Pro.. (context) - Wuu, Bernstein - 1984
51   Axioms for concurrent objects (context) - Herlihy, Wing - 1987  ACM   DBLP
49   Highly-Available Distributed Services and Fault-Tolerant Dis.. (context) - Liskov, Ladin - 1986
42   Sacrificing Serializability to Attain High Availability of D.. (context) - Fischer, Michael - 1982
35   An Efficient Fault-tolerant Protocol for Replicated Dam Mana.. (context) - -Abbadi, Skeen et al. - 1985
31   Viewstamped Replication: A New Primary Copy Method to Suppor.. (context) - Old, Liskov - 1988
28   Distributed Version Management for Read-only Actions (context) - Weihl - 1987
28   Implementing Fault-Tolerant Replicated Objects Using Psync (context) - Sh, Schlichting - 1989
20   Two Phase Gossip: Managing Distributed Event Histories (context) - Heddaya, Hsu et al. - 1989  ACM
15   Viewstamped Replication for Highly Available Distributed Sys.. (context) - Oki - 1988  ACM
15   Reliable Object Storage to Support Atomic Actions (context) - Oki - 1983  ACM   DBLP
12   Orphan Detection (context) - Liskov, Scheifler et al. - 1987
11   and the Ordering of Events in a Distributed System (context) - Lainport - 1978
10   Fast Causal Multicast (context) - Birman, Schiper et al. - 1990  ACM   DBLP
7   A Method for Constructing Highly Available Services and An A.. (context) - Ladin - 1989
6   DARPA-Internet Report RFC (context) - Mills - 1988
6   Constructing a Highly-Available Location Service for a Distr.. (context) - Hwang - 1988  ACM
5   Increasing Availability in Partitioned Database Systems (context) - Skeen, Wright - 1984
4   A Technique for Constructing Highly-Available Services - Ladin, Liskov et al. - 1988  ACM
4   Maintaining Availability in Partitioned Replicated Databases (context) - EI-Abbadi, Toueg - 1986  ACM   DBLP
1   Weighled Voting for Replicated Data (context) - Gifford - 1979
1   Senior Thesis (context) - Farrell - 1988



The graph only includes citing articles where the year of publication is known.


Documents on the same site (http://www.lcs.mit.edu/publications/pubs/pdf/):   More
Proving Correctness of a Distributed Shared Memory Implementation - Castro (1999)   (Correct)
Experience with Fine-Grain Synchronization in MIMD Machines.. - Yeung, Agarwal (1993)   (Correct)
Write Barrier Removal by Static Analysis - Zee, Rinard (2002)   (Correct)

Online articles have much greater impact   More about CiteSeer.IST   Add search form to your site   Submit documents   Feedback  

CiteSeer.IST - Copyright Penn State and NEC