International Journal of Electrical, Electronics and Computer Engineering (IJEECE)
An election algorithm is an algorithm for solving the coordinator election problem. Various algorithms require a set of peer processes to elect a leader or a coordinator. It can be necessary to determine a new leader if the current one fails to respond. Provided that all processes have a unique identification number, leader election can be reduced to finding the non crashed process with the highest identifier. Garcia-Molina's Bully Algorithm is a classic solution to leader election in synchronous systems with crash failures.