Content deleted Content added
m Reverted edit(s) by 209.7.72.117 identified as test/vandalism using STiki |
Nowhere was it mentioned that the process with the highest ID is selected as the co-ordinator. Added that fact, making the algorithm less confusing. |
||
Line 1:
The '''bully algorithm''' is a method in [[distributed computing]] for dynamically selecting a coordinator by process ID number. The process with the highest process ID number is selected as the coordinator.
==Assumptions==
Line 17:
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:
# P broadcasts an election message (inquiry) to all other processes with higher process IDs, expecting an "I am alive" response from them if they are alive.
# 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.
| |||