26 search results - page 2 / 6 » The weakest failure detector for solving k-set agreement |
PODC
2004
ACM
13 years 11 months ago
2004
ACM
AINA
2010
IEEE
13 years 10 months ago
2010
IEEE
: This paper is on failure detectors to solve the consensus problem in asynchronous systems made up of anonymous processes prone to crash and connected by asynchronous reliable cha...
FOCS
1993
IEEE
13 years 9 months ago
1993
IEEE
: Weprove tight bounds on the time needed to solve k-set agreement, a natural generalization of consensus. We analyze this problem in a synchronous, message-passing model where pro...
DSN
2002
IEEE
13 years 10 months ago
2002
IEEE
This paper shows that, in an environment where we do not bound the number of faulty processes, the class P of Perfect failure detectors is the weakest (among realistic failure det...
WDAG
2009
Springer
13 years 10 months ago
2009
Springer
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...