TY - JOUR
T1 - CRDTs: Consistency without concurrency control in large, dynamic systems
AU - Preguiça, Nuno Manuel Ribeiro
PY - 2010/1/1
Y1 - 2010/1/1
N2 - 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.
AB - 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.
U2 - 10.1145/1773912.1773921
DO - 10.1145/1773912.1773921
M3 - Article
SN - 0163-5980
VL - 44
SP - 29
EP - 34
JO - Operating Systems Review
JF - Operating Systems Review
IS - 2
ER -