sign in
english version rss feed

inria-00397981, version 1

CRDTs: Consistency without concurrency control

Mihai Leția (Author to contact preferably) a1, Nuno Preguiça (Author to contact preferably) b2, Marc Shapiro () 34

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.

  • Domain : Computer Science/Other
  • Keywords : commutative replicated data type – replicated data – consistency – weak consistency – eventual consistency
  • Internal note : RR-6956
 
  • inria-00397981, version 1
  • oai:hal.inria.fr:inria-00397981
  • From: 
  • Submitted on: Monday, 6 July 2009 09:50:30
  • Updated on: Monday, 6 July 2009 14:02:22
all articles on CCSd database...
all articles on CCSd database...
all articles on CCSd database...
all articles on CCSd database...
all articles on CCSd database...
all articles on CCSd database...
all articles on CCSd database...
all articles on CCSd database...
all articles on CCSd database...
all articles on CCSd database...
all articles on CCSd database...
all articles on CCSd database...
all articles on CCSd database...
all articles on CCSd database...
all articles on CCSd database...
all articles on CCSd database...
all articles on CCSd database...
all articles on CCSd database...
all articles on CCSd database...
all articles on CCSd database...