Sciweavers

JACM
2010
104views more  JACM 2010»
13 years 11 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
14 years 15 days 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
PODC
2009
ACM
14 years 5 months ago
The weakest failure detector for solving k-set agreement
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...
Eli Gafni, Petr Kuznetsov
AINA
2010
IEEE
14 years 5 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
WDAG
2007
Springer
128views Algorithms» more  WDAG 2007»
14 years 6 months ago
From Crash-Stop to Permanent Omission: Automatic Transformation and Weakest Failure Detectors
Abstract. This paper studies the impact of omission failures on asynchronous distributed systems with crash-stop failures. We provide two different transformations for algorithms,...
Carole Delporte-Gallet, Hugues Fauconnier, Felix C...