This simulator visualizes how election and coordinator messages ripple through a set of numbered processes after a leader failure, showing exactly which nodes get bullied aside and which one ultimately wins.
Pick a process to fail or simulate a network partition, then watch the election messages cascade upward by ID and the coordinator announcement broadcast back down to the survivors.
Controls let you crash individual processes, trigger network partitions, and step through each election and coordinator message in the resulting leader election sequence.
In the worst case, when the lowest-ID process detects the failure, the Bully Algorithm can generate a number of messages that grows quadratically with the number of processes in the system.
This simulator visualizes how election and coordinator messages ripple through a set of numbered processes after a leader failure, showing exactly which nodes get bullied aside and which one ultimately wins.
This simulator visualizes how election and coordinator messages ripple through a set of numbered processes after a leader failure, showing exactly which nodes get bullied aside and which one ultimately wins.
Pick a process to fail or simulate a network partition, then watch the election messages cascade upward by ID and the coordinator announcement broadcast back down to the survivors.
In the worst case, when the lowest-ID process detects the failure, the Bully Algorithm can generate a number of messages that grows quadratically with the number of processes in the system.