Sign inSign in
ConceptSystems & CS

Conflict-free Replicated data types

Conflict-free Replicated Data types are a family of algorithms for convergence that allow several people to concurrently update a document without making any assumptions about the network topology.
as Martin Kleppmann defines itHydraThe wording closest to all 4 definitions
Watch it explained

Know first

Named as a prerequisite by the lectures that define this. The number is how many say so. A grey one has no page yet.

Replication2Concurrency1Distributed consensus1Distributed systems1Eventual consistency1Mutable state1Partially ordered systems1

Opens up

Concepts that name this one as a prerequisite.

Lecturers

1
  • Martin Kleppmann

    Hydra · Undergraduate

    • 44:51Thinking in Events: From Databases to Distributed Collaboration Software
    • 2:16Collaboration Software
    • 10:31CRDTs and the Quest for Distributed Consistency

Lectures that assume it

1

Connections

11

The lectures that define it or assume it, and the concepts next to it.

1 lecturer. Definitions are written by AI from each lecture’s transcript. A time with a play mark starts the lecture at the moment the lecturer says it.