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

DOI10.1016/J.TCS.2010.05.001MaRDI QIDQ719296zbMATH OpenOpenAlexFDO

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

Publication date 10 October 2011

Published in Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.tcs.2010.05.001

zbMATH Keywords

distributed algorithmleader electionself-stabilizationunfair daemonsilent algorithm

Mathematics Subject Classification ID

Distributed algorithms (68W15) Distributed systems (68M14)

Recommendations

• An O(n)-time self-stabilizing leader election algorithm
• Self-stabilizing leader election in polynomial steps
• Self-stabilizing leader election in dynamic networks
• Compact self-stabilizing leader election for general networks
• scientific article; zbMATH DE number 2006655

Cites work

• scientific article; zbMATH DE number 1332668 (Why is no real title available?)
• scientific article; zbMATH DE number 6472584 (Why is no real title available?)
• Distributed reset
• Self-stabilization
• Self-stabilizing systems in spite of distributed control
• Time optimal self-stabilizing synchronization

Cited in

(22)

• Self-stabilizing leader election in polynomial steps
• Space complexity of self-stabilizing leader election in passively-mobile anonymous agents
• Randomized self-stabilizing and space optimal leader election under arbitrary scheduler on rings
• A silent self-stabilizing algorithm for the generalized minimal \(k\)-dominating set problem
• A self-stabilizing algorithm for the median problem in partial rectangular grids and their relatives
• Verifying recurrence properties in self-stabilization by checking the absence of finite counterexamples
• Compact deterministic self-stabilizing leader election on a ring: the exponential advantage of being talkative
• A self-stabilizing algorithm for a maximal 2-packing in a cactus graph under any scheduler
• ANALYSIS OF THE AVERAGE EXECUTION TIME FOR A SELF-STABILIZING LEADER ELECTION ALGORITHM
• The first fully polynomial stabilizing algorithm for BFS tree construction
• Stabilizing leader election in partial synchronous systems with crash failures
• scientific article; zbMATH DE number 2006655 (Why is no real title available?)
• Communication efficient self-stabilizing leader election
• Compact self-stabilizing leader election for general networks
• SELF-STABILIZING ANONYMOUS LEADER ELECTION IN A TREE
• Self-stabilizing leader election in dynamic networks
• Optimized silent self-stabilizing scheme for tree-based constructions
• An \(O(n)\)-time self-stabilizing leader election algorithm
• Near-optimal knowledge-free resilient leader election
• Self-stabilizing silent disjunction in an anonymous network
• On the power of oracle \(\varOmega ?\) for self-stabilizing leader election in population protocols
• Self-stabilizing silent disjunction in an anonymous network

This page was built for publication: Self-stabilizing leader election in optimal space under an arbitrary scheduler

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q719296)