Sciweavers

Share
PODC
2012
ACM
6 years 9 months ago
Asynchronous failure detectors
Failure detectors — oracles that provide information about process crashes — are an important ion for crash tolerance in distributed systems. Although current failure-detector...
Alejandro Cornejo, Nancy A. Lynch, Srikanth Sastry
WDAG
2010
Springer
196views Algorithms» more  WDAG 2010»
8 years 5 months ago
Brief Announcement: Failure Detectors Encapsulate Fairness
Abstract. We argue that failure detectors encapsulate fairness. Fairness is a measure of the number of steps a process takes relative to another processes and/or messages in transi...
Scott M. Pike, Srikanth Sastry, Jennifer L. Welch
WDAG
2010
Springer
218views Algorithms» more  WDAG 2010»
8 years 5 months ago
Anonymous Asynchronous Systems: The Case of Failure Detectors
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...
François Bonnet, Michel Raynal
DC
1999
8 years 6 months ago
A Simple and Fast Asynchronous Consensus Protocol Based on a Weak Failure Detector
or fault-tolerant asynchronous systems. It abstracts a family of problems known as Agreement (or Coordination) problems. Any solution to consensus can serve as a basic building blo...
Michel Hurfin, Michel Raynal
DC
2008
8 years 7 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
DC
2008
8 years 7 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
PODC
1992
ACM
8 years 11 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...
WDAG
1997
Springer
92views Algorithms» more  WDAG 1997»
8 years 11 months ago
Heartbeat: A Timeout-Free Failure Detector for Quiescent Reliable Communication
Abstract. We study the problem of achieving reliable communication with quiescent algorithms (i.e., algorithms that eventually stop sending messages) in asynchronous systems with p...
Marcos Kawazoe Aguilera, Wei Chen, Sam Toueg
SRDS
1996
IEEE
8 years 11 months ago
Fail-Aware Failure Detectors
In existing asynchronous distributed systems it is impossible to implement failure detectors which are perfect, i.e. they only suspect crashed processes and eventually suspect all...
Christof Fetzer, Flaviu Cristian
IPPS
2000
IEEE
8 years 11 months ago
Consensus Based on Failure Detectors with a Perpetual Accuracy Property
This paper is on the Consensus problem, in the context of asynchronous distributed systems made of n processes, at most f of them may crash. A family of failure detector classes s...
Achour Mostéfaoui, Michel Raynal
books