22 search results - page 2 / 5 » Optimal Implementation of the Weakest Failure Detector for S... |
SIAMCOMP
2000
13 years 4 months ago
2000
We study the problem of achieving reliable communication with quiescent algorithms (i.e., algorithms that eventually stop sending messages) in asynchronous systems with process cra...
DSN
2002
IEEE
13 years 9 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...
EDCC
2010
Springer
13 years 9 months ago
2010
Springer
: While lots of consensus algorithms have been proposed for crash-prone asynchronous message-passing systems enriched with a failure detector of the class Ω (the class of eventua...
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...
WDAG
2010
Springer
13 years 3 months ago
2010
Springer
Abstract: Due the multiplicity of loci of control, a main issue distributed systems have to cope with lies in the uncertainty on the system state created by the adversaries that ar...