Repository logo

Infoscience

  • English
  • French
Log In
Logo EPFL, École polytechnique fédérale de Lausanne

Infoscience

  • English
  • French
Log In
  1. Home
  2. Academic and Research Output
  3. Conferences, Workshops, Symposiums, and Seminars
  4. Distributed Agreement with Optimal Communication Complexity
 
conference paper

Distributed Agreement with Optimal Communication Complexity

Gilbert, Seth  
•
Kowalski, Dariusz R.
2010
Proceedings Of The Twenty-First Annual Acm-Siam Symposium On Discrete Algorithms
21st Annual ACM/SIAM Symposium on Discrete Algorithms

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(logn), 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, fault-tolerant gossip protocol that terminates in O(log*n) rounds using O(n) messages (with bit complexity that depends on the data being gossiped).

  • Details
  • Metrics
Type
conference paper
DOI
10.1137/1.9781611973075.78
Web of Science ID

WOS:000280699900078

Author(s)
Gilbert, Seth  
Kowalski, Dariusz R.
Date Issued

2010

Publisher

Siam, 3600 Univ City Science Center, Philadelphia, Pa 19104-2688 Usa

Published in
Proceedings Of The Twenty-First Annual Acm-Siam Symposium On Discrete Algorithms
ISBN of the book

978-0-898717-01-3

Series title/Series vol.

Proceedings in Applied Mathematics

Volume

135

Start page

965

End page

977

Subjects

Consensus

•

Protocols

•

Faults

Editorial or Peer reviewed

NON-REVIEWED

Written at

EPFL

EPFL units
DCL  
Event nameEvent placeEvent date
21st Annual ACM/SIAM Symposium on Discrete Algorithms

Austin, TX

Jan 17-19, 2010

Available on Infoscience
December 16, 2011
Use this identifier to reference this record
https://infoscience.epfl.ch/handle/20.500.14299/75301
Logo EPFL, École polytechnique fédérale de Lausanne
  • Contact
  • infoscience@epfl.ch

  • Follow us on Facebook
  • Follow us on Instagram
  • Follow us on LinkedIn
  • Follow us on X
  • Follow us on Youtube
AccessibilityLegal noticePrivacy policyCookie settingsEnd User AgreementGet helpFeedback

Infoscience is a service managed and provided by the Library and IT Services of EPFL. © EPFL, tous droits réservés