Home » Publication » 19394

Dettaglio pubblicazione

2017, JOURNAL OF PARALLEL AND DISTRIBUTED COMPUTING, Pages 63-74 (volume: 109)

Evaluating and optimizing stabilizing dining philosophers (01a Articolo in rivista)

Adamek Jordan, Farina Giovanni, Nesterenko Mikhail, Tixeuil Sébastien

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. © 2017 Elsevier Inc.
Gruppo di ricerca: Distributed Systems
keywords
© Università degli Studi di Roma "La Sapienza" - Piazzale Aldo Moro 5, 00185 Roma