Conflict-Free Replicated Data Types.¶
Shapiro, M., Preguiça, N., Baquero, C., & Zawirski, M. (2011). Conflict-Free Replicated Data Types. Stabilization, Safety, and Security of Distributed Systems (SSS 2011).
Cited by¶
3 citations across 3 artifacts.
Each citation links to the sentence it supports in the citing article.
Primes¶
- Eventual Consistency
- Distributed databases and file sync — local writes accepted without coordination, propagated, and reconciled; conflict-free replicated data types are the deepest formalisation, with mathematically well-defined merges.
This sourceFormalizes CRDTs with commutative, associative, idempotent merge functions guaranteeing convergence without coordination.
- Distributed databases and file sync — local writes accepted without coordination, propagated, and reconciled; conflict-free replicated data types are the deepest formalisation, with mathematically well-defined merges.
- Mission Command
- Distributed systems. Eventual-consistency architectures and CRDTs: each node holds the invariants (the intent) and acts on its local view; the system converges without a central authority adjudicating every write.
This sourceDefines CRDTs: replicas act on local views under a shared commutative/associative/idempotent merge invariant, converging without central coordination.
- Distributed systems. Eventual-consistency architectures and CRDTs: each node holds the invariants (the intent) and acts on its local view; the system converges without a central authority adjudicating every write.
Verification¶
This reference passed the adversarial substantiation pipeline: it was checked to exist and to support the claim it is attached to. See how references were verified.
Registry ID ref:94058d233ebc · see in the full table