[go: up one dir, main page]
More Web Proxy on the site http://driver.im/ skip to main content
10.1109/DSN.2006.55guideproceedingsArticle/Chapter ViewAbstractPublication PagesConference Proceedingsacm-pubtype
Article

One-step Consensus with Zero-Degradation

Published: 25 June 2006 Publication History

Abstract

In the asynchronous distributed system model, consensus is obtained in one communication step if all processes propose the same value. Assumingf \lt n/3, this is regardless of the failure detector output. A zero-degrading protocol reaches consensus in two communication steps in every stable run, i.e., when the failure detector makes no mistakes and its output does not change. We show that no leaderbased consensus protocol can be simultaneously one-step and zero-degrading. We propose two approaches to circumvent the impossibility result and present corresponding consensus protocols. Further, we present an atomic broadcast protocol that has a latency of 3d in every stable run and a latency of 2d in case of no collisions. Finally, we evaluate its performance in a cluster of workstations.

Cited By

View all
  • (2019)The Impact of RDMA on AgreementProceedings of the 2019 ACM Symposium on Principles of Distributed Computing10.1145/3293611.3331601(409-418)Online publication date: 16-Jul-2019
  • (2017)A short counterexample property for safety and liveness verification of fault-tolerant distributed algorithmsACM SIGPLAN Notices10.1145/3093333.300986052:1(719-734)Online publication date: 1-Jan-2017
  • (2017)A short counterexample property for safety and liveness verification of fault-tolerant distributed algorithmsProceedings of the 44th ACM SIGPLAN Symposium on Principles of Programming Languages10.1145/3009837.3009860(719-734)Online publication date: 1-Jan-2017
  • Show More Cited By

Recommendations

Comments

Please enable JavaScript to view thecomments powered by Disqus.

Information & Contributors

Information

Published In

cover image Guide Proceedings
DSN '06: Proceedings of the International Conference on Dependable Systems and Networks
June 2006
588 pages
ISBN:0769526071

Publisher

IEEE Computer Society

United States

Publication History

Published: 25 June 2006

Qualifiers

  • Article

Contributors

Other Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

  • Downloads (Last 12 months)0
  • Downloads (Last 6 weeks)0
Reflects downloads up to 30 Jan 2025

Other Metrics

Citations

Cited By

View all
  • (2019)The Impact of RDMA on AgreementProceedings of the 2019 ACM Symposium on Principles of Distributed Computing10.1145/3293611.3331601(409-418)Online publication date: 16-Jul-2019
  • (2017)A short counterexample property for safety and liveness verification of fault-tolerant distributed algorithmsACM SIGPLAN Notices10.1145/3093333.300986052:1(719-734)Online publication date: 1-Jan-2017
  • (2017)A short counterexample property for safety and liveness verification of fault-tolerant distributed algorithmsProceedings of the 44th ACM SIGPLAN Symposium on Principles of Programming Languages10.1145/3009837.3009860(719-734)Online publication date: 1-Jan-2017
  • (2017)Para$$^2$$2Formal Methods in System Design10.1007/s10703-017-0297-451:2(270-307)Online publication date: 1-Nov-2017
  • (2015)The Next 700 BFT ProtocolsACM Transactions on Computer Systems10.1145/265899432:4(1-45)Online publication date: 20-Jan-2015
  • (2010)The next 700 BFT protocolsProceedings of the 5th European conference on Computer systems10.1145/1755913.1755950(363-376)Online publication date: 13-Apr-2010
  • (2008)Distributed computing in SOSP and OSDIACM SIGACT News10.1145/1388240.138825739:2(84-91)Online publication date: 1-Jun-2008
  • (2008)BoscoProceedings of the 22nd international symposium on Distributed Computing10.1007/978-3-540-87779-0_30(438-450)Online publication date: 22-Sep-2008

View Options

View options

Figures

Tables

Media

Share

Share

Share this Publication link

Share on social media