A Self-stabilizing Algorithm with Tight Bounds for Mutual Exclusion on a Ring

DOI10.1007/978-3-540-87779-0_5zbMath1161.68863OpenAlexW1224305491MaRDI QIDQ3540221

Viacheslav Chernoy, Shmuel Zaks, Mordechai Shalom

Publication date: 20 November 2008

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-540-87779-0_5

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Distributed algorithms (68W15)

Related Items

On the Performance of Beauquier and Debas’ Self-stabilizing Algorithm for Mutual Exclusion ⋮ A Self-stabilizing Algorithm with Tight Bounds for Mutual Exclusion on a Ring

Cites Work

• Unnamed Item
• Stabilization of general loop-free routing
• On the performance of Dijkstra's third self-stabilizing algorithm for mutual exclusion and related algorithms
• A belated proof of self-stabilization
• On the costs of self-stabilization
• An exercise in proving self-stabilization with a variant function
• Self-stabilization (in spite of distributed control) in tree-structured systems
• On the Performance of Beauquier and Debas’ Self-stabilizing Algorithm for Mutual Exclusion
• A Self-stabilizing Algorithm with Tight Bounds for Mutual Exclusion on a Ring
• Self-stabilizing systems in spite of distributed control

This page was built for publication: A Self-stabilizing Algorithm with Tight Bounds for Mutual Exclusion on a Ring