2003 · 27 citations · 9 references
ComputingComputer ScienceComputer SystemsAlgorithmsDistributed SystemsFault-tolerant SystemsDistributed AlgorithmsDistributed ComputingFault-tolerant CommunicationLeader ElectionReliable Distributed SystemsBully AlgorithmDistributed System Failure DetectionFailure DetectorsFault-tolerant Distributed AlgorithmsFault-tolerant Distributed SystemsLeader Election Under FailureSynchronous Leader Election
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.
9
Unreliable failure detectors for reliable distributed systems
Tushar Chandra, Sam Toueg · Journal of the ACM · 1996 · 2.5K citations · Full text
Elections in a Distributed Computing System
Garcia-Molina · IEEE Transactions on Computers · 1982 · 614 citations