How to Reach Consensus Using Paper, Pencil and the Raft Algorithm
summary
Explains the Raft consensus algorithm and how to teach and understand it using only paper, pencil, and manual simulation. Covers Raft’s use in distributed systems for leader election, log replication and fault tolerance, with concrete references to implementations like etcd and Consul.
AI-written summary · about
chapters (10)
- 0:00Introduction
- 2:02Cluster theory and consensus
- 10:00Preparing role-play
- 13:14Leader election start
- 20:21Log data writing
- 32:44Record replication and commit
- 40:53Leader failure handling
- 47:52Offline node recovery
- 1:06:14Summary and extra topics
- 1:11:28Q&A
related talks
01h 32mHow to Reach Consensus with Paper, Pencil and the Raft Algorithm
47mUnderstanding Raft Consensus
41mThe Raft Consensus Algorithm
14mDistributed Consensus in 15 Minutes!
47mDistributed Systems: When Democracy and Computer Science Come Together
01h 13mPaxos vs Raft: Have we reached consensus on distributed consensus?
40mConsensus Algorithms in Distributed Systems
29mTowards Session-Typed Consensus