Corpus ID: 7924338

CRDTs: Consistency without concurrency control

@article{Letia2009CRDTsCW,
  title={CRDTs: Consistency without concurrency control},
  author={Mihai Letia and Nuno M. Preguiça and M. Shapiro},
  journal={ArXiv},
  year={2009},
  volume={abs/0907.0929}
}
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. 
49 Citations
A comprehensive study of Convergent and Commutative Replicated Data Types
  • 311
  • PDF
Convergent and Commutative Replicated Data Types
  • 62
Putting Order in Strong Eventual Consistency
  • 5
  • PDF
Making operation-based CRDTs operation-based
  • 30
  • PDF
Efficient State-Based CRDTs by Delta-Mutation
  • 48
  • PDF
Delta state replicated data types
  • 43
  • PDF
Enabling distributed revision control systems in delay-tolerant networks
  • Highly Influenced
High Responsiveness for Group Editing CRDTs
  • 17
  • PDF
Adaptive lock-free maps: purely-functional to scalable
  • 7
  • PDF
...
1
2
3
4
5
...

References

SHOWING 1-10 OF 15 REFERENCES
A Commutative Replicated Data Type for Cooperative Editing
  • 147
  • PDF
Generalized Consensus and Paxos
  • 241
  • PDF
Optimistic replication
  • 741
  • PDF
Consensus on transaction commit
  • 342
  • PDF
Logoot: A Scalable Optimistic Replication Algorithm for Collaborative Editing on P2P Networks
  • 134
  • PDF
...
1
2
...