Sign inSign in

Leader election

The process where exactly one process in a connected graph outputs a special leader signal.
as Nancy Ann Lynch defines itMITThe wording closest to all 3 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.

Breadth-first search trees1Distributed networks1Distributed systems1Graph theory1Raft protocol1Synchronous network model1Term1

Opens up

Concepts that name this one as a prerequisite.

Lecturers

2

Each in their own terms, from the easiest level.

  • Robert Morris

    MIT · Undergraduate

    A mechanism in Raft where servers choose a new leader when the term expires and the candidate requires a majority of votes to win.
    • 52:31Consensus & Fault Tolerance — Raft (Part 1)
  • Nancy Ann Lynch

    MIT · Graduate

    A distributed algorithm problem where processes must elect a single leader among themselves.
    • 2:25Asynchronous Distributed Algorithms: Shortest-Paths Spanning Trees

Lectures that assume it

4

Connections

13

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

2 lecturers. 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.