Skip to main content

Tutorial Summary: Paxos Explained from Scratch

  • Conference paper

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

Abstract

Paxos is a flexible and fault tolerant protocol for solving the consensus problem, where participants in a distributed system need to agree on a common value. However, Paxos is reputed for being difficult to understand. This tutorial aims to address this difficulty by visualizing Paxos in a completely new way. Starting from a naive solution and strong assumptions, Paxos is derived in a step-wise fashion. In each step, minimal changes are made to the solution and assumptions, aimed at understanding why the solution fails. In this manner, a correct solution that corresponds to Paxos is eventually reached.

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

Buying options

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

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Lamport, L.: The part-time parliment. ACM Trans. on Comp. Syst. 16(2), 133–169 (1998)

    Article  Google Scholar 

  2. Lamport, L.: Paxos made simple. ACM SIGACT News 32(4), 18–25 (2001)

    Google Scholar 

  3. Burrows, M.: The chubby lock service for loosely-coupled distributed systems. In: Proc. OSDI, pp. 335–350 (2006)

    Google Scholar 

  4. Hunt, P., Konar, M., Junqueira, F.P., Reed, B.: Zookeeper: wait-free coordination for internet-scale systems. In: Proc. USENIX ATC (2010)

    Google Scholar 

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

    Article  MathSciNet  MATH  Google Scholar 

  6. Martin, J.P., Alvisi, L.: Fast byzantine consensus. IEEE Trans. Dependable Secur. Comput. 3(3), 202–215 (2006)

    Article  Google Scholar 

  7. Mao, Y., Junqueira, F.P., Marzullo, K.: Mencius: building efficient replicated state machines for wans. In: Proc. OSDI, pp. 369–384 (2008)

    Google Scholar 

  8. Meling, H., Marzullo, K., Mei, A.: When you don’t trust clients: Byzantine proposer fast paxos. In: Proc. ICDCS, pp. 193–202 (2012)

    Google Scholar 

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

    Article  MathSciNet  MATH  Google Scholar 

  10. Ongaro, D., Ousterhout, J.: In search of an understandable consensus algorithm. Technical report, Stanford University (2013)

    Google Scholar 

  11. Chandra, T.D., Griesemer, R., Redstone, J.: Paxos made live: an engineering perspective. In: Proc. PODC, pp. 398–407 (2007)

    Google Scholar 

  12. De Prisco, R., Lampson, B., Lynch, N.: Revisiting the paxos algorithm. Theor. Comput. Sci. 243(1-2), 35–91 (2000)

    Article  MATH  Google Scholar 

  13. van Renesse, R.: Paxos made moderately complex. Technical report, Cornell University (2011)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2013 Springer International Publishing Switzerland

About this paper

Cite this paper

Meling, H., Jehl, L. (2013). Tutorial Summary: Paxos Explained from Scratch. In: Baldoni, R., Nisse, N., van Steen, M. (eds) Principles of Distributed Systems. OPODIS 2013. Lecture Notes in Computer Science, vol 8304. Springer, Cham. https://doi.org/10.1007/978-3-319-03850-6_1

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-03850-6_1

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-03849-0

  • Online ISBN: 978-3-319-03850-6

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics