Sciweavers

42 search results - page 2 / 9
» The Weakest Failure Detector for Solving Consensus
Sort
View
PODC
2009
ACM
13 years 10 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
WDAG
2007
Springer
128views Algorithms» more  WDAG 2007»
13 years 11 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...
WDAG
2009
Springer
160views Algorithms» more  WDAG 2009»
13 years 9 months ago
Brief Announcement: The Minimum Failure Detector for Non-Local Tasks in Message-Passing Systems
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...
Carole Delporte-Gallet, Hugues Fauconnier, Sam Tou...
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 ...