Comparison of Various Leader Election Algorithms on Basis of Time and Message Complexity

A distributed system is a collection of processors that do not share memory or a clock. Each processor has its own memory, and the processors communicate via communication networks. A distributed algorithm is an algorithm, run on a distributed system, that does not assume the previous existence of a central coordinator .The main problem in distributed algorithm is the coordinator election algorithm. 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 central coordinator.