Senior Backend Engineer / Stage 8 · Distributed data
Distinguish leader election from durable consensus
Trace a term change with a majority.
"Already know" meets prerequisites. "Not relevant" removes the topic from your total but leaves what builds on it waiting.
Self-check
- In a five-node cluster, partition the current leader with one follower. Explain which side can elect a leader, what the isolated side can safely acknowledge, and what must happen to conflicting uncommitted entries after reconnection.
- Evidence to include: Annotate terms, votes and the committed prefix. Explain the candidate log restriction and why an old-term entry's presence on several nodes is not by itself the general commitment rule. Use the paper's rules rather than inventing a consensus implementation.
Try it without the material first, then compare. Save your answer in your notes below. Report a problem with this self-check
Learning activities
2 activities- Not doneThe Raft Consensus Algorithm (opens another site)
A short introduction from the authors plus RaftScope, a five-server cluster in the browser where you can stop the leader and watch a new term begin.
15 min - Not doneIn Search of an Understandable Consensus Algorithm (Extended Version) (opens another site)
The paper by Diego Ongaro and John Ousterhout. Read section 5 (pages 5 to 9) for terms, leader election, log replication and the safety argument; the rest is optional.
45 min