Self-stabilizing leader election in optimal space under an arbitrary scheduler

Ajoy K Datta,Lawrence L Larmore,Priyanka Vemula

doi:10.1016/j.tcs.2010.05.001

Self-stabilizing leader election in optimal space under an arbitrary scheduler

Ajoy K Datta, Lawrence L Larmore + Show 1 more

Open Access

https://doi.org/10.1016/j.tcs.2010.05.001

Copy DOI

Journal: Theoretical Computer Science	Publication Date: May 13, 2010
Citations: 37	License type: elsevier-specific: oa user license

Affiliation: University of Nevada, Las Vegas

#Self-stabilizing Leader Election #Arbitrary Scheduler + Show 8 more

Abstract
Full-Text PDF
Similar Papers

Abstract

A silent self-stabilizing asynchronous distributed algorithm, SSLE, is given for the leader election problem in a connected unoriented (bidirectional) network with unique IDs. SSLE also constructs a BFS tree on the network rooted at that leader. SSLE uses O(logn) space per process and stabilizes in O(n) rounds, against the unfair daemon, where n is the number of processes in the network.

Full Text