Evaluating and Optimizing Stabilizing Dining Philosophers

Abstract : We study theoretical and practical aspects of five of the most well-known self-stabilizing dining philosophers algorithms. We theoretically prove that three of them are incorrect. For practical evaluation, we simulate these five algorithms as well as two classic non-self-stabilizing algorithms and evaluate their fault-tolerance, latency and throughput of critical section access. We present a new combined algorithm that achieves the best throughput of the two remaining correct self-stabilizing algorithms by determining the system load and switching between these basic algorithms. We prove the combined algorithm correct, simulate it and study its performance characteristics.
Complete list of metadatas

Contributor : Sébastien Tixeuil <>
Submitted on : Wednesday, May 10, 2017 - 1:08:23 PM
Last modification on : Wednesday, May 15, 2019 - 3:54:08 AM



Jordan Adamek, Giovanni Farina, Mikhail Nesterenko, Sébastien Tixeuil. Evaluating and Optimizing Stabilizing Dining Philosophers. Journal of Parallel and Distributed Computing, Elsevier, 2017, 109, pp.63-74. ⟨10.1016/j.jpdc.2017.05.003⟩. ⟨hal-01520335⟩



Record views