870 search results - page 8 / 174 » The failure detector abstraction |
PODC
1992
ACM
13 years 11 months ago
1992
ACM
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...
EDCC
2010
Springer
14 years 16 days ago
2010
Springer
: While lots of consensus algorithms have been proposed for crash-prone asynchronous message-passing systems enriched with a failure detector of the class Ω (the class of eventua...
IPPS
2000
IEEE
14 years 3 days ago
2000
IEEE
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...
PRDC
2007
IEEE
14 years 2 months ago
2007
IEEE
Failure detector class Ωk has been defined in [18] as an extension to failure detector Ω, and an algorithm has been given in [16] to solve k-set agreement using Ωk in async...
DC
2008
13 years 7 months ago
2008
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 ...