30 search results - page 1 / 6 » The weakest failure detectors to solve certain fundamental p... |
PODC
2004
ACM
13 years 10 months ago
2004
ACM
PODC
2009
ACM
13 years 9 months ago
2009
ACM
A failure detector is a distributed oracle that provides processes in a distributed system with hints about failures. The notion of a weakest failure detector captures the exact a...
AINA
2010
IEEE
13 years 10 months ago
2010
IEEE
: This paper is on failure detectors to solve the consensus problem in asynchronous systems made up of anonymous processes prone to crash and connected by asynchronous reliable cha...
SPAA
2009
ACM
14 years 5 months ago
2009
ACM
Dining philosophers is a classic scheduling problem for local mutual exclusion on arbitrary conflict graphs. We establish necessary conditions to solve wait-free dining under even...
PODC
1992
ACM
13 years 9 months ago
1992
ACM
We determine what information about failures is necessary and sufficient to solve Consensus in asynchronous distributed systems subject to crash failures. In Chandra and Toueg [199...