Randomized self-stabilizing and space optimal leader election under arbitrary scheduler on rings
DOI10.1007/S00446-007-0034-0zbMATH Open1266.68063OpenAlexW2089195674MaRDI QIDQ1954232FDOQ1954232
Authors: J. Beauquier, Maria Gradinariu, Colette Johnen 
Publication date: 20 June 2013
Published in: Distributed Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00446-007-0034-0
Recommendations
- Self-stabilizing leader election in optimal space under an arbitrary scheduler
- scientific article; zbMATH DE number 2006655
- Deterministic, constant space, self-stabilizing leader election on uniform rings
- Time-Optimal Self-stabilizing Leader Election on Rings in Population Protocols
- 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 space and time complexity of loosely-stabilizing leader election
- scientific article; zbMATH DE number 177572
- Improved bounds for electing a leader in a synchronous ring
Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Reliability, testing and fault tolerance of networks and computer systems (68M15) Distributed systems (68M14)
Cites Work
- Title not available (Why is that?)
- Randomized self-stabilizing and space optimal leader election under arbitrary scheduler on rings
- Title not available (Why is that?)
- Memory-efficient and self-stabilizing network RESET (extended abstract)
- Title not available (Why is that?)
- Self-stabilization of dynamic systems assuming only read/write atomicity
- Reactive, generative, and stratified models of probabilistic processes
- Memory requirements for silent stabilization
- Coupling and self-stabilization
- Fault-Tolerant and Self-stabilizing Mobile Robots Gathering
- Stabilization-preserving atomicity refinement
- Title not available (Why is that?)
- When graph theory helps self-stabilization
- Formal verification of timed properties of randomized distributed algorithms
- Memory space requirements for self-stabilizing leader election protocols
- Token-based self-stabilizing uniform algorithms
- Verification of multiprocess probabilistic protocols
- Optimal Randomized Self-stabilizing Mutual Exclusion on Synchronous Rings
- Self-stabilizing token circulation on asynchronous uniform unidirectional rings
- Self-Stabilizing Symmetry Breaking in Constant Space
Cited In (12)
- Constant-Space Localized Byzantine Consensus
- Compact deterministic self-stabilizing leader election on a ring: the exponential advantage of being talkative
- The expressive power of snap-stabilization
- Randomized self-stabilizing and space optimal leader election under arbitrary scheduler on rings
- On probabilistic snap-stabilization
- Randomized self-stabilizing leader election in preference-based anonymous trees
- Weak vs. self vs. probabilistic stabilization
- Randomized dining philosophers without fairness assumption
- Deterministic, constant space, self-stabilizing leader election on uniform rings
- The Bit Complexity of Randomized Leader Election on a Ring
- Optimal Randomized Self-stabilizing Mutual Exclusion on Synchronous Rings
- Title not available (Why is that?)
This page was built for publication: Randomized self-stabilizing and space optimal leader election under arbitrary scheduler on rings
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1954232)
