Dining Philosophers with Crash Locality 1

Please observe the copyright notices posted here governing the use of material from this page.

2004

Citation:
Scott M. Pike and Paolo A.G. Sivilotti, "Dining Philosophers with Crash Locality 1" in Proceedings of ICDCS 2004, pp. 22-29. © IEEE 2004. Best Paper Award (1st place out of 475 submitted papers).

Abstract:
Ideally, distributed algorithms isolate the side-effects of faults within local neighborhoods of impact. Failure locality quantifies this concept as the maximum radius of impact caused by a given fault. We present new locality results for the dining philosophers problem subject to crash failures. The optimal crash locality for dining is 0 in synchronous networks, but degrades to 2 in asynchronous networks. Using the eventually-perfect failure detector /spl diams/P , we construct the first known dining algorithms with crash locality 1 under partial synchrony. These algorithms close the failure-locality complexity gap and improve the crash tolerance of resource allocation algorithms in practical networks. We prove the optimality of our results with two fundamental theorems. First, no dining solution using /spl diams/P achieves locality 0. Second, /spl diams/P is the weakest failure detector in the Chandra-Toueg hierarchy to realize locality 1.

Link to copy of this pubilcation on file with the publisher:
http://ieeexplore.ieee.org/search/wrapper.jsp?arnumber=1281564
Download this publication:

Scott M. Pike