Modified Bully Election Algorithm for Crash Recovery in Distributed Systems

Many distributed algorithms require one process to act as coordinator, initiator or otherwise perform some special role. The main role of an elected coordinator is to manage the use of shared resource in an optimal manner. An election algorithm is an algorithm for solving the coordinator election problem. The coordinator election problem is to choose a process from among a group of processes on different processors in a distributed system to act as the centre coordinator. Therefore, election algorithms are very important in any distributed systems. Bully election algorithm is one of the classical approaches in distributed computing for dynamically electing a coordinator with highest priority number or highest process ID number. In this paper, we are compared base and efficient version of bully algorithm to minimize the number of messages during the election and when a process recovers from a crashed state in distributed systems.