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.
|Titolo:||Evaluating and optimizing stabilizing dining philosophers|
FARINA, GIOVANNI (Corresponding author)
|Data di pubblicazione:||2017|
|Citazione:||Evaluating and optimizing stabilizing dining philosophers / Adamek, Jordan; Farina, Giovanni; Nesterenko, Mikhail; Tixeuil, Sébastien. - In: JOURNAL OF PARALLEL AND DISTRIBUTED COMPUTING. - ISSN 0743-7315. - ELETTRONICO. - 109(2017), pp. 63-74.|
|Appartiene alla tipologia:||01a Articolo in rivista|