6343 search results - page 31 / 1269 » Robust consensus computation |
PODC
1999
ACM
15 years 2 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...
PODC
2010
ACM
15 years 1 months ago
2010
ACM
We define two new classes of shared-memory objects: ratifiers, which detect agreement, and conciliators, which ensure agreement with some probability. We show that consensus can...
PODC
2012
ACM
13 years 11 days ago
2012
ACM
Two new algorithms are given for randomized consensus in a shared-memory model with an oblivious adversary. Each is based on a new construction of a conciliator, an object that gu...
PODC
2010
ACM
15 years 1 months ago
2010
ACM
: The Borowsky-Gafni (BG) simulation algorithm is a powerful reduction algorithm that shows that t-resilience of decision tasks can be fully characterized in terms of wait-freedom....
EUC
2007
Springer
15 years 4 months ago
2007
Springer
We demonstrate an improved consensus-driven utility accrual scheduling algorithm (DUA-CLA) for distributable threads which execute under run-time uncertainties in execution time, ...