CRDTs: Consistency without concurrency control

Details CRDTs: Consistency without concurrency control CRDTs: Consistency without concurrency control

2009-07-06

arxiv.org/abs/0907.0929v1

Computer Science

Distributed, Parallel, and Cluster Computing

Scientific paper

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.

Affiliated with

Also associated with

No associations

Rating

CRDTs: Consistency without concurrency control does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with CRDTs: Consistency without concurrency control, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and CRDTs: Consistency without concurrency control will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-27265