Back to Search
Start Over
Evaluating and optimizing stabilizing dining philosophers.
- Source :
-
Journal of Parallel & Distributed Computing . Nov2017, Vol. 109, p63-74. 12p. - Publication Year :
- 2017
-
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. [ABSTRACT FROM AUTHOR]
Details
- Language :
- English
- ISSN :
- 07437315
- Volume :
- 109
- Database :
- Academic Search Index
- Journal :
- Journal of Parallel & Distributed Computing
- Publication Type :
- Academic Journal
- Accession number :
- 124578720
- Full Text :
- https://doi.org/10.1016/j.jpdc.2017.05.003