Explore >> Select a destination

You are here

 decomposition.al
Implementing a Garbage-Collected Graph CRDT (Part 2 of 2) - CMPS290S, Fall 2018
| | mattweidner.com
CRDT Survey, Part 3: Algorithmic Techniques - Matthew Weidner
10.8 parsecs away

Travel
| | [AI summary] This text provides an in-depth exploration of CRDTs (Conflict-Free Replicated Data Types), covering various data structures and algorithms for managing concurrent data in distributed systems. It includes discussions on unique sets, state-based CRDTs, and optimized versions that avoid tombstones. The text also touches on different CRDT types, such as OR-sets and unique sets, and their implementations, along with their applications in collaborative applications. The content is part of a series of blog posts by Matthew Weidner, a PhD student at CMU, focusing on the theory and practice of CRDTs.
| | nomad.foo
cola: a text CRDT for real-time collaborative editing
13.7 parsecs away

Travel
| | A deep dive into the theoretical framework and the technical implementation of a text CRDT.
| | systemdesign.one
Gossip Protocol - System Design
11.4 parsecs away

Travel
| | scalable broadcast algorithm in distributed system
| | briankung.dev
Implementing the Raft Consensus Algorithm with David Beazley - Brian Kung
20.1 parsecs away

Travel
| I survived David Beazley's weeklong course on the Raft consensus algorithm that powers technologies like Kubernetes, MongoDB, and Neo4j. Image from https://raft.github.io/ The Raft Consensus Algorithm is a way for a gaggle of computers to agree on a sequence of events, or a "log" of events. Raft is useful for things like databases - once...