An efficient algorithm for leader-election in synchronous distributed systems
Sung-Hoon Park, Yoon Kim, Jeoung Sun Hwang · 2003
Leader election is an important problem in distributed computing. H. Garcia-Molina's (1982) Bully algorithm is a classic solution to leader election in synchronous systems with crash failures. In this paper, we indicate the problems with the Bully algorithm and re-write it to use a failure detector instead of explicit time-outs. We show that this algorithm is more efficient than Garcia-Molina's one in terms of processing time.