Randomized three-state alternator for uniform rings
Journal of Parallel and Distributed Computing
Self-stabilizing philosophers with generic conflicts
ACM Transactions on Autonomous and Adaptive Systems (TAAS)
Byzantine self-stabilizing pulse in a bounded-delay model
SSS'07 Proceedings of the 9h international conference on Stabilization, safety, and security of distributed systems
Global predicate detection in distributed systems with small faults
SSS'07 Proceedings of the 9h international conference on Stabilization, safety, and security of distributed systems
On self-stabilizing synchronous actions despite byzantine attacks
DISC'07 Proceedings of the 21st international conference on Distributed Computing
| Hi-index | 0.00 |
We present a solution to the problem of dining philosophers. Our solution tolerates malicious crashes. In a malicious crash the faile d process behaves arbitrarily for a finite time and then ceases all operation undetectably to other processes. The tolerance of our solution is achieved by the combination of stabilization and crash failure locality. Stabilization allows our program to recover from an arbitrary state. Crash failure locality ensures that only a limited number of processes are affected by a process crash. The crash failure locality of our solution is optimal.Finally,we argue that the malicious crash fault model and its extensions are worthy of further study as they admit tolerances that are not achieved under stronger fault models and are unnecessary under weaker fault models.