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

DOI10.1016/J.TCS.2010.05.001zbMATH Open1222.68043OpenAlexW2041740671MaRDI QIDQ719296FDOQ719296

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

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

zbMATH Keywords

distributed algorithmleader electionself-stabilizationunfair daemonsilent algorithm

Mathematics Subject Classification ID

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

Cites Work

• Self-stabilization
• Self-stabilizing systems in spite of distributed control
• Title not available (Why is that?)
• Time optimal self-stabilizing synchronization
• Distributed reset
• Title not available (Why is that?)

Cited In (22)

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

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)