On the performance of Dijkstra's third self-stabilizing algorithm for mutual exclusion and related algorithms
From MaRDI portal
Publication:992514
DOI10.1007/s00446-010-0104-6zbMath1231.68295OpenAlexW2109578404MaRDI QIDQ992514
Viacheslav Chernoy, Shmuel Zaks, Mordechai Shalom
Publication date: 9 September 2010
Published in: Distributed Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00446-010-0104-6
ringanalysis of algorithmsdistributed computingmutual exclusionself-stabilizationstabilization timeDijkstra's third algorithmthree-state algorithm
Analysis of algorithms (68W40) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Distributed systems (68M14)
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
- Unnamed Item
- Stabilization of general loop-free routing
- 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
- Self-stabilizing systems in spite of distributed control
