A New Distributed Resource-Allocation Algorithm with Optimal Failure Locality
Paolo A. G. Sivilotti, Scott M. Pike, Nigamanth Sridhar · 2000
Failure locality measures an algorithm's robustness to process failures. We present an algorithm for the dining philosophers problem - a classic problem in distributed resource allocation - that has optimal failure locality. As a refinement, the algorithm can be easily parameterized with a simple failure model to achieve super-optimal failure locality in the average case.