On the Performance of Beauquier and Debas’ Self-stabilizing Algorithm for Mutual Exclusion

DOI10.1007/978-3-540-69355-0_19zbMath1143.68340OpenAlexW53394148MaRDI QIDQ3511401

Viacheslav Chernoy, Mordechai Shalom, Shmuel Zaks

Publication date: 10 July 2008

Published in: Structural Information and Communication Complexity (Search for Journal in Brave)

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

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20)

Related Items (2)

A Self-stabilizing Algorithm with Tight Bounds for Mutual Exclusion on a Ring ⋮ On the performance of Dijkstra's third self-stabilizing algorithm for mutual exclusion and related algorithms

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
• An exercise in proving self-stabilization with a variant function
• 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: On the Performance of Beauquier and Debas’ Self-stabilizing Algorithm for Mutual Exclusion