Bully algorithm: Difference between revisions

Revision as of 16:20, 4 May 2005

Revision as of 16:37, 4 May 2005

Line 1:

The '''bully alorithm''' is a method in [[distributed computing]] for dynamically selecting a coordinator by process ID number.

When a process P determines that the current coordinator is down because of message timeouts or failure of the coordinator to initiate a handshake, it performs the following sequence of actions:

# BroadcastsP broadcasts an election message to all other processes.

# If P hears from no process with a higher process ID than it, it wins the election and broadcasts victory.

# If P hears from a process with a higher ID, P waits a certain amount of time for that process to broadcast itself as the leader. If it does not receive this message in time, it re-broadcasts the election message.