Explain Bully algorithm Can the Bully algorithm cope with si

Solution

Explanation of Bully Algorithm

Q ) Can the Bully algorithm cope with simultaneous elections? Justify your answer

In the bully algorithm every thing should be running through by using the process

. each and individual process knows the ID and address of every other process.

. In each process communication should be reliable

. Each and every process initiates an election if it fails it notices that the coordinator has failed.

. In Bully algorithm there are three types of messages are there

they are

1. Election

2. OK

3. coordinator

. Several processes can initiate an election simultaneously to get consistent result.

.any process P can initiate an election.

. P sends Election messages to all process with higher IDs and awaits OK messages.

Q ) Explain Bully algorithm

ANS :

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

1. P broadcasts an election message to all other processes with higher process IDs .

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

3. If P hears from a process with a higher ID , P waits a certain amount of time for ant process with a higher ID to broadcast itself as the leader .

4. If P gets an election message from another process with a lower ID it sends .