HackerPapers

arXiv:0907.0929cs.DC

CRDTs: Consistency without concurrency control

Mihai Letia, Nuno Preguiça, Marc Shapiro

Early discovery. Linked by one identifiable commenter. This paper is outside the main ranking; a mention is not an endorsement.

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.

arXiv comments
Journal reference
DOI
Subjects
cs.DCDistributed, Parallel, and Cluster Computing

On Hacker News

Linked by 1 identifiable commenter in 1 comment across 1 thread, from May 2014 to May 2014.

Comments linking this paper, per year.

Discussed in comments1 thread

  1. Distributed Systems and the End of the API 1 comment

    • A lot of different distributed storage and computation architectures are special cases of CRDTs, just with different sets of commutative operations and/or convergent types of state. (One of the aspects of CRDTs that I most appreciate, as it provides a framework within which one…

      cemerickView on HNParent context

Submitted to Hacker News

Connected through shared HN threads, not inferred similarity or a recommendation.