42 search results - page 7 / 9 » The Weakest Failure Detector for Solving Consensus |
SIAMCOMP
2008
13 years 5 months ago
2008
Abstract. To cope with the impossibility of solving agreement problems in asynchronous systems made up of n processes and prone to t process crashes, system designers tailor their ...
WDAG
1997
Springer
13 years 11 months ago
1997
Springer
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...
OPODIS
2008
13 years 9 months ago
2008
In this paper, we study the atomic multicast problem, a fundamental abstraction for building faulttolerant systems. In the atomic multicast problem, the system is divided into non...
JSA
2008
13 years 7 months ago
2008
Nowadays, there are many protocols able to cope with process crashes, but, unfortunately, a process crash represents only a particular faulty behavior. Handling tougher failures (...
SRDS
2010
IEEE
13 years 5 months ago
2010
IEEE
We introduce the notion of a swift algorithm. Informally, an algorithm that solves the repeated consensus is swift if, in a partial synchronous run of this algorithm, eventually no...