CRDTs: Part 1
This is a series about Conflict-Free Replicated Data Types, or CRDTs for short. Their purpose is to allow seamless replication of data on different nodes in a distributed system. Merging is by construction always possible, without any conflicts. This series assumes no knowledge about CRDTs, but be prepared to learn a thing or two about algebras. All code samples on this page are interactive and executed in your browser. Understanding the code is necessary for understanding the concepts, so you should be familiar with JavaScript.
Relations
about Conflict-free replicated data type (CRDT)
In distributed computing, a conflict-free replicated data type (CRDT) is a data structure which can b...
referenced in Are CRDTs suitable for shared editing?
Performance analysis of the Yjs CRDT in practice and in the worst case scenario.
references A comprehensive study of Convergent and Commutative Replicated Data Types
Eventual consistency aims to ensure that replicas of some mutable shared object converge without fore...
references Composing and decomposing op-based CRDTs with semidirect products
Operation-based Conflict-free Replicated Data Types (CRDTs) are eventually consistent replicated data...
references Time, clocks, and the ordering of events in a distributed system
The concept of one event happening before another in a distributed system is examined, and is shown t...
Edit details Edit relations Attach new author Attach new topic Attach new resource
from 1 review
- Resource level 2.0 /10
- beginner intermediate advanced
- Resource clarity 10.0 /10
- hardly clear sometimes unclear perfectly clear
- Reviewer's background 2.0 /10
- none basics intermediate advanced expert
Comments 1
10 rating 2 level 10 clarity 2 user's background