Distributed Agreement with Optimal Communication Complexity

@inproceedings{Gilbert2010DistributedAW,
  title={Distributed Agreement with Optimal Communication Complexity},
  author={Seth Gilbert and Dariusz R. Kowalski},
  booktitle={SODA},
  year={2010}
}
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… CONTINUE READING

Citations

Publications citing this paper.
SHOWING 1-10 OF 14 CITATIONS

References

Publications referenced by this paper.
SHOWING 1-6 OF 6 REFERENCES

Fast

  • V. King, J. Saia
  • scalable byzantine agreement in the full…
  • 2009
Highly Influential
5 Excerpts

Distributed Algorithms

  • N. Lynch
  • Morgan Kaufman
  • 1996
Highly Influential
5 Excerpts

Similar Papers

Loading similar papers…