Skip to main content
SpringerLink
Log in

On the Cost of Fault-Tolerant Consensus When There Are No Faults – A Tutorial

  • Conference paper
Dependable Computing (LADC 2003)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 2847))

Included in the following conference series:

Abstract

We consider the consensus problem in realistic partial synchrony and timed asynchronous models where processes can crash. We describe algorithms and lower bounds that show that two communication steps are necessary and sufficient for solving consensus in these models in failure-free executions.

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 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.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

References

  1. Lampson, B.: How to build a highly available system using consensus. In: Babaoğlu, Ö., Marzullo, K. (eds.) WDAG 1996. LNCS, vol. 1151. Springer, Heidelberg (1996)

    Google Scholar 

  2. Lamport, L.: Time, clocks, and the ordering of events in a distributed system. Communications of the ACM 21(7), 558–565 (1978)

    Article  MATH  Google Scholar 

  3. Schneider, F.B.: Implementing fault tolerant services using the state machine approach: A tutorial. ACM Computing Surveys 22(4), 299–319 (1990)

    Article  Google Scholar 

  4. Fischer, M., Lynch, N., Paterson, M.: Impossibility of distributed consensus with one faulty process. Journal of the ACM 32, 374–382 (1985)

    Article  MATH  MathSciNet  Google Scholar 

  5. Cristian, F., Fetzer, C.: The timed asynchronous distributed system model. IEEE Transactions on Parallel and Distributed Systems, 642–657 (June 1999)

    Google Scholar 

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

    Article  MathSciNet  Google Scholar 

  7. Chandra, T.D., Toueg, S.: Unreliable failure detectors for reliable distributed systems. Journal of the ACM 43(2), 225–267 (1996)

    Article  MATH  MathSciNet  Google Scholar 

  8. Guerraoui, R.: Indulgent algorithms. In: 16th ACM Symposium on Principles of Distributed Computing (PODC), July 2000, pp. 289–298 (2000)

    Google Scholar 

  9. Schiper, A.: Early consensus in an asynchronous system with a weak failure detector. Distributed Computing 10(3), 149–157 (1997)

    Article  Google Scholar 

  10. Hufrin, M., Raynal, M.: Asimple and fast asynchronous consensus protocol based on a weak failure detector. Distributed Computing 12(4) (1999)

    Google Scholar 

  11. Mostefaoui, A., Raynal, M.: Solving consensus using Chandra-Toueg’s unreliable failure detectors: a general approach. In: 13th International Symposium on DIStributed Computing (DISC), Bratislava, Slovak Republic (1999)

    Google Scholar 

  12. Keidar, I., Dolev, D.: Efficient message ordering in dynamic networks. In: 15th ACM Symposium on Principles of Distributed Computing (PODC), May 1996, pp. 68–76 (1996)

    Google Scholar 

  13. Keidar, I., Rajsbaum, S.: On the cost of fault-tolerant consensus when there are no faults – a tutorial. Technical Report MIT-LCS-TR-821, MIT Laboratory for Computer Science, Apreliminary version in SIGACT News 32(2), Distributed Computing column, pp. 45–63 (published May 15, 2001)

    Google Scholar 

  14. Keidar, I., Rajsbaum, S.: A simple proof of the uniform consensus synchronous lower bound. Information Processing Letters 85(1), 47–52 (2003)

    Article  MATH  MathSciNet  Google Scholar 

  15. Keidar, I., Rajsbaum, S.: Open questions on consensus performance in wellbehaved runs. In: Schiper, A., Shvartsman, M.M.A.A., Weatherspoon, H., Zhao, B.Y. (eds.) Future Directions in Distributed Computing. LNCS, vol. 2584, pp. 35–39. Springer, Heidelberg (2003)

    Chapter  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Dept. of Electrical Engineering, Technion, Haifa, 32000, Israel

    Idit Keidar

  2. Instituto de Matemáticas, UNAM, Ciudad Universitaria, 04510, México, D.F.

    Sergio Rajsbaum

Authors
  1. Idit Keidar
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Sergio Rajsbaum
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Computing Laboratory, University of Kent,  

    Rogério de Lemos

  2. Instituto de Informática, Universidade Federal do Rio Grande do Sul, Caixa Postal 15064 – 90501-970, Porto Alegre, RS, Brazil

    Taisy Silva Weber

  3. Escola Politécnica Travessa 3, Número, Universidade de São Paulo,, 158, Edifício de Engenharia Eletricidade, 05508-900, São Paulo, SP, Brazil

    João Batista Camargo Jr.

Rights and permissions

Reprints and permissions

Copyright information

© 2003 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Keidar, I., Rajsbaum, S. (2003). On the Cost of Fault-Tolerant Consensus When There Are No Faults – A Tutorial. In: de Lemos, R., Weber, T.S., Camargo, J.B. (eds) Dependable Computing. LADC 2003. Lecture Notes in Computer Science, vol 2847. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-45214-0_29

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-45214-0_29

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-20224-0

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

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation