An O(n)-time self-stabilizing leader election algorithm

Authors:
Ajoy K. Datta;Lawrence L. Larmore;Priyanka Vemula
Affiliations:
-;-;-
Venue:
Journal of Parallel and Distributed Computing
Year:
2011

Citing 6
Cited 0

Time optimal self-stabilizing synchronization

STOC '93 Proceedings of the twenty-fifth annual ACM symposium on Theory of computing
Self-stabilizing unidirectional network algorithms by power-supply

SODA '97 Proceedings of the eighth annual ACM-SIAM symposium on Discrete algorithms
Self-stabilization

Self-stabilization
Self-stabilizing systems in spite of distributed control

Communications of the ACM
Distributed Reset

IEEE Transactions on Computers
Self-Stabilizing Leader Election in Optimal Space

SSS '08 Proceedings of the 10th International Symposium on Stabilization, Safety, and Security of Distributed Systems

Quantified Score

Hi-index	0.00

Visualization

Abstract

A self-stabilizing asynchronous distributed leader election algorithm is presented. The algorithm works for any connected unoriented (bidirectional) network with unique IDs. The solution also constructs a BFS tree of the network rooted at the elected leader. The proposed solution is silent and works under the unfair daemon. The algorithm stabilizes in O(n) rounds, where n is the number of processes in the network.