Dining Philosophers that Tolerate Malicious Crashes Mikhail Nesterenko
Abstract:
We present a solution to the problem of dining philosophers. Our solution tolerates malicious crashes. In a malicious crash the failed process behaves arbitrarily for a nite 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 aected 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. 1
Citations
| 19 | Mutual exclusion between neighboring nodes in an arbitrary system graph tree that stabilizes using read/write atomicity – Antonoiu, Srimani - 1999 |
