.png){kind=icon}
返回
Evaluating and optimizing stabilizing dining philosophers
.png){kind=icon}
PRE
AI
DOI：10.1016/j.jpdc.2017.05.003.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
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.
Keyword:
Self-stabilization
Dining philosophers
Simulation
Distributed algorithms
Fault tolerance
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
查看更多机构
.png){kind=icon}
