A new approach of bully election algorithm for distributed computing

Many distributed algorithms require one process to act as a unique process to play a particular role in distributed systems. Election algorithms are meant for electing such a process called coordinator from among the currently running processes of distributed systems in such a manner that at any instance of time there will be a single coordinator for all the processes in the system. So, election algorithms are extremely crucial in any distributed system. Bully algorithm is one of the classical approaches for electing the coordinator in distributed systems. In this paper, we have presented an efficient version of bully algorithm to minimize the redundancy in electing the coordinator, to reduce the recovery problem of a crashed process in distributed systems and thus to maximize the effectiveness of traditional bully algorithm.