Election Algorithm
Many distributed algorithm require one process to acts as coordinator, initiator, or otherwise perform some special role.
The goal of an election algorithm is to ensure that when an election starts concludes with all process agreeing on who the new coordinator is to be.
Types of Election Algorithm
- Token ring algorithm
- Bully Algorithm
1. Token ring algorithm
When any process notice that the coordinator is not functioning, it builds an ELECTION MESSAGE containing its own process number and sends the message to its successor.
Example:
We start with 6 processes, connected in a logical ring. Process 6 is the leader, as it has the highest number.
Process 6 fails.
Process 3 notices that Process 6 does not respond. So it starts an election, sending a message containing its id to the next node in the ring.
Process 5 passes the message on, adding its own id to the message.
Process 0 passes the message on, adding its own id to the message.
Process 1 passes the message on, adding its own id to the message.
Process 4 passes the message on, adding its own id to the message.
When Process 3 receives the message back, it knows the message has gone around the ring, as its own id is in the list. Picking the highest id in the list, it starts the coordinator message “5 is the leader” around the ring.
Process 5 passes on the coordinator message.
Process 0 passes on the coordinator message.
Process 1 passes on the coordinator message.
Process 4 passes on the coordinator message.
Process 3 receives the coordinator message, and stops it.
2. Bully Algorithm
When any process notices that the coordinator is no longer responding to request, it initiates an ELECTION.
The process holds an ELECTION message as follows:
Example:
We start with 6 processes, all directly connected to each other. Process 6 is the leader,
as it has the highest number.
Process 6 fails.
Process 3 notices that Process 6 does not respond. So it starts an election, notifying those processes with ids greater than 3.
Both Process 4 and Process 5 respond, telling Process 3 that they’ll take over from here.
Process 4 sends election messages to both Process 5 and Process 6.
Only Process 5 answers and takes over the election.
Process 5 sends out only one election message to Process 6.
When Process 6 does not respond Process 5 declares itself the winner.
