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

DOI10.1016/j.jpdc.2011.05.008zbMath1225.68040OpenAlexW2072797971MaRDI QIDQ645826

Lawrence L. Larmore, Ajoy K. Datta, Priyanka Vemula

Publication date: 10 November 2011

Published in: Journal of Parallel and Distributed Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.jpdc.2011.05.008

zbMATH Keywords

distributed algorithmself-stabilizationleader electionunfair daemonsilent algorithm

Mathematics Subject Classification ID

Distributed systems (68M14)

Related Items (11)

Competitive self-stabilizing \(k\)-clustering ⋮ A silent self-stabilizing algorithm for the generalized minimal \(k\)-dominating set problem ⋮ Maintaining balanced trees for structured distributed streaming systems ⋮ Self-stabilizing 2-minimal dominating set algorithms based on loop composition ⋮ A self-stabilizing \(k\)-clustering algorithm for weighted graphs ⋮ Self-stabilizing silent disjunction in an anonymous network ⋮ Self-stabilizing leader election in polynomial steps ⋮ The first fully polynomial stabilizing algorithm for BFS tree construction ⋮ Self-stabilizing leader election in dynamic networks ⋮ Optimized silent self-stabilizing scheme for tree-based constructions ⋮ Near-optimal knowledge-free resilient leader election

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Self-stabilizing leader election in optimal space under an arbitrary scheduler
• Self-stabilizing systems in spite of distributed control
• Distributed reset
• Time optimal self-stabilizing synchronization

This page was built for publication: An \(O(n)\)-time self-stabilizing leader election algorithm