Eventually-serializable data services

Alan Fekete, David Gupta, Victor Luchangco, Nancy Lynch, Alex Shvartsman

Research output: Contribution to conferencePaperpeer-review

Abstract

We present a new specification for distributed data services that trade-off immediate consistency guarantees for improved system availability and efficiency, while ensuring the long-term consistency of the data. An eventually-serializable data service maintains the operations requested in a partial order that gravitates over time towards a total order. It provides clear and unambiguous guarantees about the immediate and long-term behavior of the system. To demonstrate its utility, we present an algorithm, based on one of Ladin, Liskov, Shrira, and Ghemawat [12], that implements this specification. Our algorithm provides the interface of the abstract service, and generalizes their algorithm by allowing general operations and greater flexibility in specifying consistency requirements. We also describe how to use this specification as a building block for applications such as directory services.

Original languageEnglish (US)
Pages300-309
Number of pages10
DOIs
StatePublished - 1996
Externally publishedYes
EventProceedings of the 1996 15th Annual ACM Symposium on Principles of Distributed Computing - Philadelphia, PA, USA
Duration: May 23 1996May 26 1996

Conference

ConferenceProceedings of the 1996 15th Annual ACM Symposium on Principles of Distributed Computing
CityPhiladelphia, PA, USA
Period5/23/965/26/96

ASJC Scopus subject areas

  • Software
  • Hardware and Architecture
  • Computer Networks and Communications

Fingerprint

Dive into the research topics of 'Eventually-serializable data services'. Together they form a unique fingerprint.

Cite this