42 search results - page 3 / 9 » The Weakest Failure Detector for Solving Consensus |
WDAG
2010
Springer
13 years 4 months ago
2010
Springer
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...
OPODIS
1997
13 years 7 months ago
1997
Unreliable fault detectors can be used to solve the consensus problem in asynchronous distributed systems that are subject to crash faults. We extend this result to asynchronous d...
SIAMCOMP
1998
13 years 5 months ago
1998
We present a consensus algorithm that combines unreliable failure detection and randomization, two well-known techniques for solving consensus in asynchronous systems with crash f...
SIAMCOMP
2000
13 years 5 months ago
2000
We study the problem of achieving reliable communication with quiescent algorithms (i.e., algorithms that eventually stop sending messages) in asynchronous systems with process cra...
SPAA
2009
ACM
14 years 6 months ago
2009
ACM
Dining philosophers is a classic scheduling problem for local mutual exclusion on arbitrary conflict graphs. We establish necessary conditions to solve wait-free dining under even...