11 search results - page 2 / 3 » On the Message Complexity of Indulgent Consensus |
SPAA
2009
ACM
14 years 7 days ago
2009
ACM
We consider bit communication complexity of binary consensus in synchronous message passing systems with processes prone to crashes. A distributed algorithm is locally scalable wh...
SODA
2010
ACM
14 years 2 months ago
2010
ACM
We consider the problem of fault-tolerant agreement in a crash-prone synchronous system. We present a new randomized consensus algorithm that achieves optimal communication effici...
SASO
2009
IEEE
14 years 4 days ago
2009
IEEE
—The complexity of distributed computing systems and their increasing interaction with the physical world impose challenging requirements in terms of adaptation, robustness, and ...
EUC
2007
Springer
13 years 11 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, ...
JACM
2008
13 years 5 months ago
2008
We consider a failure-free, asynchronous message passing network with n links, where the processors are arranged on a ring or a chain. The processors are identically programmed bu...