Skip to main content
SpringerLink
Log in

How to Solve Consensus in the Smallest Window of Synchrony

  • Conference paper
Distributed Computing (DISC 2008)

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 5218))

Included in the following conference series:

Abstract

This paper addresses the following question: what is the minimum-sized synchronous window needed to solve consensus in an otherwise asynchronous system? In answer to this question, we present the first optimally-resilient algorithm ASAP that solves consensus as soon as possible in an eventually synchronous system, i.e., a system that from some time GST onwards, delivers messages in a timely fashion. ASAP guarantees that, in an execution with at most f failures, every process decides no later than round GST + f + 2, which is optimal.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 109.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Boichat, R., Dutta, P., Frolund, S., Guerraoui, R.: Deconstructing paxos. SIGACT News 34(1), 47–67 (2003)

    Article  Google Scholar 

  2. Boichat, R., Dutta, P., Frolund, S., Guerraoui, R.: Reconstructing paxos. SIGACT News 34(2), 42–57 (2003)

    Article  Google Scholar 

  3. Chandra, T., Hadzilacos, V., Toueg, S.: The weakest failure detector for solving consensus. J. ACM 43(4), 685–722 (1996)

    Article  MATH  MathSciNet  Google Scholar 

  4. Chandra, T., Toueg, S.: Unreliable failure detectors for reliable distributed systems. J. ACM 43(2), 225–267 (1996)

    Article  MATH  MathSciNet  Google Scholar 

  5. Dolev, D., Reischuk, R., Strong, H.R.: Early stopping in byzantine agreement. J. ACM 37(4), 720–741 (1990)

    Article  MATH  MathSciNet  Google Scholar 

  6. Dutta, P., Guerraoui, R.: The inherent price of indulgence. In: PODC, pp. 88–97 (2002)

    Google Scholar 

  7. Dutta, P., Guerraoui, R.: The inherent price of indulgence. Distributed Computing 18(1), 85–98 (2005)

    Article  Google Scholar 

  8. Dutta, P., Guerraoui, R., Keidar, I.: The overhead of consensus failure recovery. Distributed Computing 19(5-6), 373–386 (2007)

    Article  Google Scholar 

  9. Dutta, P., Guerraoui, R., Lamport, L.: How fast can eventual synchrony lead to consensus? In: DSN, pp. 22–27 (2005)

    Google Scholar 

  10. Dwork, C., Lynch, N., Stockmeyer, L.: Consensus in the presence of partial synchrony. J. ACM 35(2), 288–323 (1988)

    Article  MathSciNet  Google Scholar 

  11. Fisher, M., Lynch, N., Paterson, M.: Impossibility of distributed consensus with one faulty process. J. ACM 32(2), 374–382 (1985)

    Article  Google Scholar 

  12. Gafni, E.: Round-by-round fault detectors: Unifying synchrony and asynchrony (extended abstract). In: PODC, pp. 143–152 (1998)

    Google Scholar 

  13. Guerraoui, R.: Indulgent algorithms (preliminary version). In: PODC, pp. 289–297 (2000)

    Google Scholar 

  14. Guerraoui, R., Raynal, M.: The information structure of indulgent consensus. IEEE Transactions on Computers 53(4), 453–466 (2004)

    Article  Google Scholar 

  15. Halpern, J.Y., Moses, Y.: Knowledge and common knowledge in a distributed environment. J. ACM 37(3), 549–587 (1990)

    Article  MATH  MathSciNet  Google Scholar 

  16. Keidar, I., Rajsbaum, S.: On the cost of fault-tolerant consensus when there are no faults (preliminary version). SIGACT News 32(2), 45–63 (2001)

    Article  Google Scholar 

  17. Keidar, I., Shraer, A.: Timeliness, failure-detectors, and consensus performance. In: PODC, pp. 169–178 (2006)

    Google Scholar 

  18. Keidar, I., Shraer, A.: How to choose a timing model? In: DSN, pp. 389–398 (2007)

    Google Scholar 

  19. Lamport, L.: Generalized consensus and paxos. Microsoft Research Technical Report MSR-TR-2005-33 (March 2005)

    Google Scholar 

  20. Lamport, L.: Lower bounds for asynchronous consensus. Distributed Computing 19(2), 104–125 (2006)

    Article  MathSciNet  Google Scholar 

  21. Lamport, L., Fisher, M.: Byzantine generals and transaction commit protocols (unpublished) (April 1982)

    Google Scholar 

  22. Lamport, L., Shostak, R., Pease, M.: The byzantine generals problem. ACM Trans. Program. Lang. Syst. 4(3), 382–401 (1982)

    Article  MATH  Google Scholar 

  23. Lamport, L.: Fast paxos. Distributed Computing 19(2), 79–103 (2006)

    Article  MathSciNet  Google Scholar 

  24. Lynch, N.: Distributed Algorithms. Morgan Kaufmann, San Francisco (1996)

    MATH  Google Scholar 

  25. Pease, M., Shostak, R., Lamport, L.: Reaching agreement in the presence of faults. J. ACM 27(2), 228–234 (1980)

    Article  MATH  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. EPFL LPD, Bat INR 310, Station 14, 1015, Lausanne, Switzerland

    Dan Alistarh, Seth Gilbert & Rachid Guerraoui

  2. Universidad Politecnica de Madrid, 28031, Madrid, Spain

    Corentin Travers

Authors
  1. Dan Alistarh
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Seth Gilbert
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Rachid Guerraoui
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. Corentin Travers
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Gadi Taubenfeld

Rights and permissions

Reprints and permissions

Copyright information

© 2008 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Alistarh, D., Gilbert, S., Guerraoui, R., Travers, C. (2008). How to Solve Consensus in the Smallest Window of Synchrony. In: Taubenfeld, G. (eds) Distributed Computing. DISC 2008. Lecture Notes in Computer Science, vol 5218. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-87779-0_3

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-87779-0_3

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-87778-3

  • Online ISBN: 978-3-540-87779-0

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation