Evaluating and optimizing stabilizing dining philosophers

Jordan Adamek

doi:10.1016/j.jpdc.2017.05.003

Return

Evaluating and optimizing stabilizing dining philosophers

2017-11-01

PRE

Jordan Adamek

Giovanni Farina

Sébastien Tixeuil

DOI：10.1016/j.jpdc.2017.05.003

Original

Original request for help

Save

Abstract

En 中文

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. (C) 2017 Elsevier Inc. All rights reserved.

Keywords:

Self-stabilization

Dining philosophers

Simulation

Distributed algorithms

Fault tolerance

AI Summary

Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.