Fail-aware failure detectors
- 24 December 2002
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE)
Abstract
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 crashed processes. Some recent research has however proposed that any "reasonable" failure detector for solving the election problem must be perfect. We address this problem by introducing two new classes of fail-aware failure detectors that are (1) implementable in existing asynchronous distributed systems, (2) not necessarily perfect, and (3) can be used to solve the election problem. In particular we show that there exists a fail-aware failure detector that allows to solve the election problem and which is strictly weaker than a perfect failure detector.Keywords
This publication has 7 references indexed in Scilit:
- On the Possibility of Consensus in Asynchronous Systems with Finite Average Response TimesPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2005
- Fail-aware failure detectorsPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2002
- Unreliable failure detectors for reliable distributed systemsJournal of the ACM, 1996
- Fail-awareness in timed asynchronous systemsPublished by Association for Computing Machinery (ACM) ,1996
- The weakest failure detector for solving consensusPublished by Association for Computing Machinery (ACM) ,1992
- Unreliable failure detectors for asynchronous systems (preliminary version)Published by Association for Computing Machinery (ACM) ,1991
- Impossibility of distributed consensus with one faulty processJournal of the ACM, 1985