inria-00397981, version 1
CRDTs: Consistency without concurrency control
Mihai Leția
a, 1Nuno Preguiça
b, 2Marc Shapiro
3, 4
N° RR-6956 (2009)
Abstract: A CRDT is a data type whose operations commute when they are concurrent. Replicas of a CRDT eventually converge without any complex concurrency control. As an existence proof, we exhibit a non-trivial CRDT: a shared edit buffer called Treedoc. We outline the design, implementation and performance of Treedoc. We discuss how the CRDT concept can be generalised, and its limitations.
- a – Ecole Normale Supérieure de Lyon - ENS Lyon
- b – FCT - Universidade Nova de Lisboa, Portugal
- 1: Laboratoire de l'Informatique du Parallélisme (LIP)
- Université de Lyon – CNRS : UMR5668 – INRIA – École Normale Supérieure - Lyon – Université Claude Bernard - Lyon I
- 2: Centro de Investigação em Informática e Tecnologias da Informação (CITI)
- Universidade Nova de Lisboa
- 3: Laboratoire d'Informatique de Paris 6 (LIP6)
- CNRS : UMR7606 – Université Paris VI - Pierre et Marie Curie
- 4: REGAL (INRIA Rocquencourt)
- INRIA – CNRS : UMR7606 – Université Paris VI - Pierre et Marie Curie
- Domain : Computer Science/Other
- Keywords : commutative replicated data type – replicated data – consistency – weak consistency – eventual consistency
- Internal note : RR-6956
- inria-00397981, version 1
- http://hal.inria.fr/inria-00397981
- oai:hal.inria.fr:inria-00397981
- From: Marc Shapiro
- Submitted on: Monday, 6 July 2009 09:50:30
- Updated on: Monday, 6 July 2009 14:02:22






Associated documents

Export