Convergent and Commutative Replicated Data Types

Abstract : Eventual consistency aims to ensure that replicas of some mutable shared object converge without foreground synchronisation. Previous approaches to eventual consistency are ad-hoc and error-prone. We study a principled approach: to base the design of shared data types on some simple formal conditions that are sufficient to guarantee eventual consistency. We call these types Convergent or Commutative Replicated Data Types (CRDTs). This paper formalises asynchronous object replication, either state based or oper- ation based, and provides a sufficient condition appropriate for each case. It describes several useful CRDTs, including container data types supporting both add and remove operations with clean semantics, and more complex types such as graphs and monotonic DAGs. It discusses some properties needed to implement non-trivial CRDTs.
Document type :
Journal articles
Liste complète des métadonnées

Cited literature [31 references]  Display  Hide  Download

https://hal.inria.fr/hal-00932833
Contributor : Marc Shapiro <>
Submitted on : Friday, January 17, 2014 - 5:36:46 PM
Last modification on : Thursday, March 21, 2019 - 1:12:10 PM
Document(s) archivé(s) le : Friday, April 18, 2014 - 11:52:57 AM

File

CRDTs-beatcs-2011-06.pdf
Files produced by the author(s)

Identifiers

  • HAL Id : hal-00932833, version 1

Citation

Marc Shapiro, Nuno Preguiça, Carlos Baquero, Marek Zawirski. Convergent and Commutative Replicated Data Types. Bulletin- European Association for Theoretical Computer Science, European Association for Theoretical Computer Science; 1999, 2011, pp.67-88. ⟨http://www.eatcs.org/images/bulletin/beatcs104.pdf⟩. ⟨hal-00932833⟩

Share

Metrics

Record views

603

Files downloads

790