34 search results - page 2 / 7 » Consensus in Anonymous Distributed Systems: Is There a Weake... |
SRDS
2000
IEEE
13 years 9 months ago
2000
IEEE
The concept of unreliable failure detector was introduced by Chandra and Toueg [2] as a mechanism that provides information about process failures. Depending on the properties the...
DSN
2002
IEEE
13 years 10 months ago
2002
IEEE
This paper shows that, in an environment where we do not bound the number of faulty processes, the class P of Perfect failure detectors is the weakest (among realistic failure det...
PODC
2009
ACM
13 years 10 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...
WDAG
2009
Springer
13 years 9 months ago
2009
Springer
This paper defines the basic notions of local and non-local tasks, and determines the minimum information about failures that is necessary to solve any non-local task in message-p...
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...