Randomized self-stabilizing and space optimal leader election under arbitrary scheduler on rings

DOI10.1007/s00446-007-0034-0zbMath1266.68063OpenAlexW2089195674MaRDI QIDQ1954232

Joffroy Beauquier, Colette Johnen, Maria Gradinariu

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

zbMATH Keywords

self-stabilizationschedulerleader electionprotocol compositionrandomized protocol

Mathematics Subject Classification ID

Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Distributed systems (68M14) Reliability, testing and fault tolerance of networks and computer systems (68M15)

Related Items (8)

The expressive power of snap-stabilization ⋮ Weak vs. Self vs. Probabilistic Stabilization ⋮ Randomized self-stabilizing and space optimal leader election under arbitrary scheduler on rings ⋮ Constant-Space Localized Byzantine Consensus ⋮ Randomized Dining Philosophers without Fairness Assumption ⋮ RANDOMIZED SELF-STABILIZING LEADER ELECTION IN PREFERENCE-BASED ANONYMOUS TREES ⋮ Compact deterministic self-stabilizing leader election on a ring: the exponential advantage of being talkative ⋮ On probabilistic snap-stabilization

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Stabilization-preserving atomicity refinement
• Token-based self-stabilizing uniform algorithms
• Verification of multiprocess probabilistic protocols
• Self-stabilization of dynamic systems assuming only read/write atomicity
• Memory requirements for silent stabilization
• Reactive, generative, and stratified models of probabilistic processes
• Coupling and self-stabilization
• Randomized self-stabilizing and space optimal leader election under arbitrary scheduler on rings
• Memory space requirements for self-stabilizing leader election protocols
• Self-Stabilizing Symmetry Breaking in Constant Space
• Fault-Tolerant and Self-stabilizing Mobile Robots Gathering
• Self-stabilizing token circulation on asynchronous uniform unidirectional rings
• Memory-efficient and self-stabilizing network RESET (extended abstract)
• Formal verification of timed properties of randomized distributed algorithms
• Optimal Randomized Self-stabilizing Mutual Exclusion on Synchronous Rings
• When graph theory helps self-stabilization

This page was built for publication: Randomized self-stabilizing and space optimal leader election under arbitrary scheduler on rings