Sciweavers

231 search results - page 10 / 47
» Asynchronous failure detectors
Sort
View
OPODIS
2010
13 years 6 months ago
Failure Detectors Encapsulate Fairness
Failure detectors are commonly viewed as abstractions for the synchronism present in distributed system models. However, investigations into the exact amount of synchronism encapsu...
Scott M. Pike, Srikanth Sastry, Jennifer L. Welch
DC
2008
13 years 8 months ago
Failure detectors as type boosters
The power of an object type T can be measured as the maximum number n of processes that can solve consensus using only objects of T and registers. This number, denoted cons(T), is ...
Rachid Guerraoui, Petr Kouznetsov
SRDS
2000
IEEE
14 years 29 days ago
Optimal Implementation of the Weakest Failure Detector for Solving Consensus
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...
Mikel Larrea, Antonio Fernández, Sergio Ar&...
DC
2008
13 years 8 months ago
The weakest failure detectors to boost obstruction-freedom
This paper determines necessary and sufficient conditions to implement wait-free and non-blocking contention managers in a shared memory system. The necessary conditions hold even...
Rachid Guerraoui, Michal Kapalka, Petr Kouznetsov
DSN
2002
IEEE
14 years 1 months ago
A Realistic Look At Failure Detectors
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...
Carole Delporte-Gallet, Hugues Fauconnier, Rachid ...