CS 551: Distributed Operating Systems
The Bully Election Algorithm

The Bully Election Algorithm

by Garcia-Molina (1982)

Recall the assumption that each process has a unique number.

The algorithm:

The process that initiates the election need only send messages about election to higher numbered processes.
Any processes that respond effectively tell the first process that they overrule him and that he is out of the running as they have higher ids.
These processes then start sending election messages to the other high-numbers processes.

See example on next page.

Copyright © 2001-2003: Colorado State University for CS 551. All rights reserved.