Skip to Main content Skip to Navigation
New interface
Reports (Research report)

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)
Complete list of metadata

Cited literature [14 references]  Display  Hide  Download
Contributor : Marc Shapiro Connect in order to contact the contributor
Submitted on : Monday, July 6, 2009 - 9:50:30 AM
Last modification on : Wednesday, October 26, 2022 - 8:16:14 AM
Long-term archiving on: : Thursday, June 30, 2011 - 11:40:42 AM


Files produced by the author(s)


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


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



Record views


Files downloads