ConceptTheory & Algos
Leader election
The process where exactly one process in a connected graph outputs a special leader signal.
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.
Breadth-first search trees1Distributed networks1Distributed systems1Graph theory1Raft protocol1Synchronous network model1Term1
Opens up
Concepts that name this one as a prerequisite.
Lecturers
2Each in their own terms, from the easiest level.
Robert Morris
A mechanism in Raft where servers choose a new leader when the term expires and the candidate requires a majority of votes to win.Nancy Ann Lynch
A distributed algorithm problem where processes must elect a single leader among themselves.
Lectures that assume it
4Connections
13The lectures that define it or assume it, and the concepts next to it.
Concepts6
Lectures7
- Consensus & Fault Tolerance — Raft (Part 1)
- Synchronous Distributed Algorithms: Symmetry-Breaking and Shortest-Paths Spanning Trees
- Asynchronous Distributed Algorithms: Shortest-Paths Spanning Trees
- Raft Consensus Algorithm (User Study Lecture)
- The Raft Consensus Algorithm: Leader Election & Log Replication
- Consensus: Total Order Broadcast & Fault-Tolerant Agreement