67 search results - page 4 / 14 » Randomized protocols for asynchronous consensus |
PODC
1999
ACM
13 years 10 months ago
1999
ACM
ÐIn this paper, we investigate the k-set consensus problem in asynchronous distributed systems. In this problem, each participating process begins the protocol with an input value...
SRDS
2006
IEEE
13 years 11 months ago
2006
IEEE
The paper presents a comparative performance study of the two main classes of randomized binary consensus protocols: a local coin protocol, with an expected high communication com...
DSN
2007
IEEE
13 years 9 months ago
2007
IEEE
Model-checking of asynchronous distributed protocols is challenging because of the large size of the state and solution spaces. This paper tackles this problem in the context of l...
WDAG
2010
Springer
13 years 4 months ago
2010
Springer
Abstract. We give randomized agreement algorithms with constant expected running time in asynchronous systems subject to process failures, where up to a minority of processes may f...
SIAMCOMP
2010
13 years 15 days ago
2010
This paper studies the inherent trade-off between termination probability and total step complexity of randomized consensus algorithms. It shows that for every integer k, the prob...