Sciweavers

Share
SODA
2010
ACM

Distributed Agreement with Optimal Communication Complexity

12 years 2 months ago
Distributed Agreement with Optimal Communication Complexity
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 efficiency, using only O(n) bits of communication, and terminates in (almost optimal) time O(log n), with high probability. The same protocol, with minor modifications, can also be used in partially synchronous networks, guaranteeing correct behavior even in asynchronous executions, while maintaining efficient performance in synchronous executions. Finally, the same techniques also yield a randomized, faulttolerant gossip protocol that terminates in O(log n) rounds using O(n) messages (with bit complexity that depends on the data being gossiped).
Seth Gilbert, Dariusz Kowalski
Added 01 Mar 2010
Updated 02 Mar 2010
Type Conference
Year 2010
Where SODA
Authors Seth Gilbert, Dariusz Kowalski
Comments (0)
books