CRDTs: Consistency without concurrency control

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.
Document type :
Reports
[Research Report] RR-6956, INRIA. 2009, pp.16
Liste complète des métadonnées


https://hal.inria.fr/inria-00397981
Contributor : Marc Shapiro <>
Submitted on : Monday, July 6, 2009 - 9:50:30 AM
Last modification on : Monday, May 29, 2017 - 2:25:04 PM
Document(s) archivé(s) le : Thursday, June 30, 2011 - 11:40:42 AM

Files

RR-6956.pdf
Files produced by the author(s)

Identifiers

  • HAL Id : inria-00397981, version 1
  • ARXIV : 0907.0929

Collections

Citation

Mihai Leția, Nuno Preguiça, Marc Shapiro. CRDTs: Consistency without concurrency control. [Research Report] RR-6956, INRIA. 2009, pp.16. <inria-00397981>

Share

Metrics

Record views

1128

Document downloads

2313