Scott M. Pike The Ohio State University Columbus, OH 43210, USA...  Home/Search
Context Related
| ohiostate.edu/~pike/Papers/I...FL1.pdf Cached: PS.gz PS PDF This document uses CoBlitz to cache paper downloads. If your firewall is blocking outgoing connections to port 3125, you can use these links to download local copies.
Image Update HelpPS.gz PS PDF From: ohiostate.edu/~ns...resprojects (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
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 eventuallyperfect failure detector #P , we construct the first known dining... (Update)
Cited by: More
Container-Based Component Deployment: A Case Study - Sridhar, Hallstrom, Sivilotti (2004) (Correct)
Active bibliography (related documents): More All
1.1: Local Tolerance to Unbounded Byzantine Faults - Nesterenko, Arora (2002) (Correct)
0.6: Dining Philosophers that Tolerate Malicious Crashes - Mikhail Nesterenko Department (2002) (Correct)
0.1: On the Respective Power of . . . - Friedman, al. (Correct)
Similar documents based on text: More All
0.7: Unknown - (Correct)
0.4: A New Distributed Resource-Allocation Algorithm with.. - Sivilotti, Pike, Sridhar (2000) (Correct)
0.3: Binary Trees: A Challenge Problem For Separating Concerns - Scott Pike The (2001) (Correct)
BibTeX entry: (Update)
S. M. Pike and P. A. G. Sivilotti. Dining philosophers with crash locality 1. In Proceedings of the 24th IEEE International Conference on Distributed Computing Systems. IEEE, 2004. (to appear). http://citeseer.ist.psu.edu/pike04dining.html More
@misc{ pike04dining,
author = "S. Pike and P. Sivilotti",
title = "Dining philosophers with crash locality",
text = "S. M. Pike and P. A. G. Sivilotti. Dining philosophers with crash locality
1. In Proceedings of the 24th IEEE International Conference on Distributed
Computing Systems. IEEE, 2004. (to appear).",
year = "2004",
url = "citeseer.ist.psu.edu/pike04dining.html" }
Citations (may not include all citations):718 Distributed Algorithms (context) - Lynch - 1996
716 Parallel Program Design: A Foundation (context) - Chandy, Misra - 1988
214 Consensus in the presence of partial synchrony - Dwork, Lynch et al. - 1988
210 Co-operating sequential processes (context) - Dijkstra - 1968
181 Understanding fault-tolerant distributed systems - Cristian - 1991
153 the minimal synchronism needed for distributed consensus (context) - Dolev, Dwork et al. - 1987
75 Unreliable failure detectors for reliable distributed system.. - Chandra, Toueg - 1996
27 A dining philosophers algorithm with polynomial response tim.. (context) - Awerbuch, Saks - 1990
21 Efficient fault tolerant algorithms for resource allocation .. (context) - Choy, Singh - 1992
18 Fast allocation of nearby resources in a distributed system - Lynch - 1980
7 An adaptive failure detection protocol - Fetzer, Raynal et al. - 2001
3 An algorithm with optimal failure locality for the dining ph.. (context) - Tsay, Bagrodia - 1994
3 A new distributed resource-allocation algorithm with optimal.. - Sivilotti, Pike et al. - 2000
2 Dining philosophers that tolerate malicious crashes - Nesterenko, Arora - 2002
1 Efficient fault-tolerance algorithms for distributed resourc.. (context) - Choy, Singh - 1995
1 Personal Correspondence (context) - Nesterenko - 2003
1 The drinking philosopher's problem (context) - Chandy, Misra - 1984
Documents on the same site (http://www.cse.ohio-state.edu/~nsridhar/Research/res-projects.html):
Container-Based Component Deployment: A Case Study - Sridhar, Hallstrom, Sivilotti (2004) (Correct)
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC