DocumentCode
1286732
Title
A highly available local leader election service
Author
Fetzer, Christof ; Cristian, Flaviu
Author_Institution
AT&T, Florham-Park, NJ, USA
Volume
25
Issue
5
fYear
1999
Firstpage
603
Lastpage
618
Abstract
We define the highly available local leader election problem (G. LeLann, 1977), a generalization of the leader election problem for partitionable systems. We propose a protocol that solves the problem efficiently and give some performance measurements of our implementation. The local leader election service has been proven useful in the design and implementation of several fail-aware services for partitionable systems
Keywords
distributed processing; fault tolerant computing; protocols; fail-aware services; highly available local leader election service; partitionable systems; performance measurements; protocol; timed asynchronous systems; Availability; Bridges; Broadcasting; Clocks; Helium; Local area networks; Measurement; Nominations and elections; Protocols; Synchronization;
fLanguage
English
Journal_Title
Software Engineering, IEEE Transactions on
Publisher
ieee
ISSN
0098-5589
Type
jour
DOI
10.1109/32.815321
Filename
815321
Link To Document