Skip to main content
Article thumbnail
Location of Repository

Dining philosophers with crash locality 1

By et al. Scott M. Pike


Ideally, distributed algorithms isolate the side-effects of faults within local neighborhoods of impact. Failure locality quanti-£es 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 eventuallyperfect failure detector ✸P, we construct the £rst 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 ✸P achieves locality 0. Second, ✸P is the weakest failur

Publisher: IEEE
Year: 2004
OAI identifier: oai:CiteSeerX.psu:
Provided by: CiteSeerX
Download PDF:
Sorry, we are unable to provide the full text but you may find it at the following location(s):
  • (external link)
  • (external link)
  • Suggested articles

    To submit an update or takedown request for this paper, please submit an Update/Correction/Removal Request.