Chapter 1
The chaos of a leaderless world
Chapter 2
The bully on the playground
Chapter 3
Passing the crown in a ring
Chapter 4
Modern consensus and the cloud
Ch 2 · The bully on the playground
007skaty Split-Vote Livelock
Split the vote, split the vote, Matching timers freeze the whole system!
BETA
007skaty Track how mean comments spread to discover the heavy cost of network bullying.
007skaty When a distributed system leader fails, nodes message higher IDs and the biggest responsive node bullies its way to the top
Quiz
In the Bully Algorithm, how does a node determine if it can declare itself the leader?
007skaty Nodes send Election, Answer, and Coordinator signals to stop rivals from claiming power.
Quiz
Which message is sent by the winning node in the Bully Algorithm to announce its victory?
Fun Fact
Bully name: The Bully Algorithm gets its name because nodes with higher IDs literally bully lower-ID nodes out of the election.
Glossary
bully algorithm (noun)
A distributed computing protocol used to elect a coordinator by selecting the active node with the highest identifier. Hector Garcia-Molina first proposed this leader election method in a 1982 paper on distributed systems.
A distributed computing protocol used to elect a coordinator by selecting the active node with the highest identifier. Hector Garcia-Molina first proposed this leader election method in a 1982 paper on distributed systems.