CRDTs: Consistency without concurrency control - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Reports (Research Report) Year : 2009

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.
Fichier principal
Vignette du fichier
RR-6956.pdf (201.79 Ko) Télécharger le fichier
Origin : Files produced by the author(s)
Loading...

Dates and versions

inria-00397981 , version 1 (06-07-2009)

Identifiers

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

Cite

Mihai Leția, Nuno Preguiça, Marc Shapiro. CRDTs: Consistency without concurrency control. [Research Report] RR-6956, INRIA. 2009, pp.16. ⟨inria-00397981⟩
1650 View
5508 Download

Altmetric

Share

Gmail Facebook X LinkedIn More