DocumentCode
3504371
Title
An efficient algorithm for leader-election in synchronous distributed systems
Author
Park, Sung-Hoon ; Kim, Yoon ; Hwang, Jeoung Sun
Author_Institution
Dept. of Comput. Sci, Nam-Seoul Univ., Chung Nam, South Korea
Volume
2
fYear
1999
fDate
36495
Firstpage
1091
Abstract
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
Keywords
client-server systems; distributed algorithms; failure analysis; software performance evaluation; system recovery; Bully algorithm; crash failures; distributed computing; efficient algorithm; explicit time-outs; failure detector; leader election; processing time; synchronous distributed systems; Computer crashes; Computer science; Detectors; Distributed computing; Fault tolerant systems; Frequency; Information management; Network topology; Nominations and elections; Sun;
fLanguage
English
Publisher
ieee
Conference_Titel
TENCON 99. Proceedings of the IEEE Region 10 Conference
Conference_Location
Cheju Island
Print_ISBN
0-7803-5739-6
Type
conf
DOI
10.1109/TENCON.1999.818613
Filename
818613
Link To Document