Brief announcement: semantics of eventually consistent replicated sets

Authors:
Annette Bieniusa;Marek Zawirski;Nuno Preguiça;Marc Shapiro;Carlos Baquero;Valter Balegas;Sérgio Duarte
Affiliations:
INRIA/LIP6, Paris, France;INRIA/LIP6, Paris, France,UPMC, Paris, France;CITI, Universidade Nova de Lisboa, Portugal,INRIA/LIP6, Paris, France;INRIA/LIP6, Paris, France;HASLab, INESC Tec and Universidade do Minho, Portugal;CITI, Universidade Nova de Lisboa, Portugal;CITI, Universidade Nova de Lisboa, Portugal
Venue:
DISC'12 Proceedings of the 26th international conference on Distributed Computing
Year:
2012

Citing 3
Cited 1

Dynamo: amazon's highly available key-value store

Proceedings of twenty-first ACM SIGOPS symposium on Operating systems principles
Transactional storage for geo-replicated systems

SOSP '11 Proceedings of the Twenty-Third ACM Symposium on Operating Systems Principles
Conflict-free replicated data types

SSS'11 Proceedings of the 13th international conference on Stabilization, safety, and security of distributed systems

Replicated data types: specification, verification, optimality

Proceedings of the 41st ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages

Quantified Score

Hi-index	0.00

Visualization

Abstract

This paper studies the semantics of sets under eventual consistency. The set is a pervasive data type, used either directly or as a component of more complex data types, such as maps or graphs. Eventual consistency of replicated data supports concurrent updates, reduces latency and improves fault tolerance, but forgoes strong consistency (e.g., linearisability). Accordingly, several cloud computing platforms implement eventually-consistent replicated sets [2,4].