Sciweavers

22 search results - page 1 / 5
» Optimal Implementation of the Weakest Failure Detector for S...
Sort
View
SRDS
2000
IEEE
13 years 9 months 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&...
PODC
1992
ACM
13 years 8 months ago
The Weakest Failure Detector for Solving Consensus
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...
Tushar Deepak Chandra, Vassos Hadzilacos, Sam Toue...
AINA
2010
IEEE
13 years 9 months ago
Consensus in Anonymous Distributed Systems: Is There a Weakest Failure Detector?
: 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...
François Bonnet, Michel Raynal
JACM
2010
104views more  JACM 2010»
13 years 3 months ago
Tight failure detection bounds on atomic object implementations
This article determines the weakest failure detectors to implement shared atomic objects in a distributed system with crash-prone processes. We first determine the weakest failure...
Carole Delporte-Gallet, Hugues Fauconnier, Rachid ...
DC
2008
13 years 4 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