An efficient algorithm for leader-election in synchronous distributed systems

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 dete...

Full description

Saved in:
Bibliographic Details
Main Authors: Sung-Hoon Park, Yoon Kim, Jeoung Sun Hwang
Format: Conference Proceeding
Language:English
Subjects:
Computer crashes
Computer science
Detectors
Distributed computing
Fault tolerant systems
Frequency
Information management
Network topology
Nominations and elections
Sun
Online Access:Request full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary: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.
DOI:10.1109/TENCON.1999.818613