Eventually-serializable data services

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

doi:10.1145/248052.248113

Eventually-serializable data services

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

Research output: Contribution to conference › Paper › peer-review

30 Scopus citations

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 language	English (US)
Pages	300-309
Number of pages	10
DOIs	https://doi.org/10.1145/248052.248113
State	Published - 1996
Externally published	Yes
Event	Proceedings of the 1996 15th Annual ACM Symposium on Principles of Distributed Computing - Philadelphia, PA, USA Duration: May 23 1996 → May 26 1996

Conference

Conference	Proceedings of the 1996 15th Annual ACM Symposium on Principles of Distributed Computing
City	Philadelphia, PA, USA
Period	5/23/96 → 5/26/96

ASJC Scopus subject areas

Software
Hardware and Architecture
Computer Networks and Communications

Access to Document

10.1145/248052.248113

Cite this

@conference{f6619eded2dd40bd803d5bb1a30a169d,

title = "Eventually-serializable data services",

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.",

author = "Alan Fekete and David Gupta and Victor Luchangco and Nancy Lynch and Alex Shvartsman",

year = "1996",

doi = "10.1145/248052.248113",

language = "English (US)",

pages = "300--309",

note = "Proceedings of the 1996 15th Annual ACM Symposium on Principles of Distributed Computing ; Conference date: 23-05-1996 Through 26-05-1996",

}

TY - CONF

T1 - Eventually-serializable data services

AU - Fekete, Alan

AU - Gupta, David

AU - Luchangco, Victor

AU - Lynch, Nancy

AU - Shvartsman, Alex

PY - 1996

Y1 - 1996

N2 - 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.

AB - 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.

UR - http://www.scopus.com/inward/record.url?scp=0029703449&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=0029703449&partnerID=8YFLogxK

U2 - 10.1145/248052.248113

DO - 10.1145/248052.248113

M3 - Paper

AN - SCOPUS:0029703449

SP - 300

EP - 309

T2 - Proceedings of the 1996 15th Annual ACM Symposium on Principles of Distributed Computing

Y2 - 23 May 1996 through 26 May 1996

ER -

Eventually-serializable data services

Abstract

Conference

ASJC Scopus subject areas

Access to Document

Other files and links

Fingerprint

Cite this