article

Fast Paxos

Author:

Leslie LamportAuthors Info & Claims

Distributed Computing, Volume 19, Issue 2

Pages 79 - 103

https://doi.org/10.1007/s00446-006-0005-x

Published: 01 October 2006 Publication History

Abstract

As used in practice, traditional consensus algorithms require three message delays before any process can learn the chosen value. Fast Paxos is an extension of the classic Paxos algorithm that allows the value to be learned in two message delays. How and why the algorithm works are explained informally, and a TLA+ specification of the algorithm appears as an appendix.

References

[1]

Brasileiro, F., Greve, F., Mostefaoui, A., Raynal, M.: Consensus in one communication step. In: Malyshkin, V. (ed.) Parallel Computing Technologies (6th International Conference, PaCT 2001), Lecture Notes in Computer Science, vol. 2127, pp. 42---50. Springer, Berlin Heidelberg New York (2001)

Digital Library

[2]

Castro, M., Liskov, B.: Practical byzantine fault tolerance. In: Proceedings of the Third Symposium on Operating Systems Design and Implementation, pp. 173---186. ACM, New York (1999)

Digital Library

[3]

Charron-Bost, B., Schiper, A.: Uniform consensus is harder than consensus (extended abstract). Tech. Rep. DSC/2000/028, École Polytechnique Fédérale de, Switzerland (2000). http://lsewww.epfl.ch/Publications/ById/263.html

[4]

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

Digital Library

[5]

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

Digital Library

[6]

Lamport, L.: Introduction to TLA. SRC Technical Note 1994-001, Digital Systems Research Center (1994). Currently available from http://www.hpl.hp.com/techreports/Compaq-DEC/SRC-TN-1994-001.html

[7]

Lamport L. (1998) The part-time parliament. ACM Trans. Comput. Syst. 16(2): 133---169

Digital Library

[8]

Lamport, L.: A summary of TLA+ (2000). Currently available from http://research.microsoft.com/users/lamport/tla/tla.html or by searching the Web for the 21-letter string obtained by removing the --- characters from uid-lamport-tla-homepage

[9]

Lamport L. (2001) Paxos made simple. ACM SIGACT News (Distributed Computing Column) 32(4): 18---25

[10]

Lamport, L.: Specifying Systems. Addison-Wesley, Boston (2003). Also available on the Web via a link at http://lamport.org.

[11]

Lamport, L.: Lower bounds for asynchronous consensus. Tech. Rep. MSR-TR-2004-71, Microsoft Research (2004). Currently available from http://research.microsoft.com/users/lamport/pubs/pubs.html, or by searching the Web for the 23-letter string obtained by removing the --- characters from all-lamports-pubs-onthe-web

[12]

Lampson B.W. How to build a highly available system using consensus. In: Babaoglu O. Marzullo K. (eds) Distributed Algorithms. Lecture Notes in Computer Science, vol. 1151, pp. 1---17. Springer Berlin, Heidelberg New York (1996)

Digital Library

[13]

Martin, J.P., Alvisi, L.: Fast byzantine consensus. In: Proceedings of the International Conference on Dependable Systems and Networks (DSN 2005). IEEE Computer Society, Yokohama (2005) (in press)

Digital Library

[14]

Pedone F., Schiper A. (2002) Handling message semantics with generic broadcast. Distributed Computing 15(2): 97---107

Digital Library

[15]

Pedone, F., Schiper, A., Urbán, P., Cavin, D.: Solving agreement problems with weak ordering oracles. In: Proceedings of the 4th European Dependable Computing Conference (EDCC-4). Lecture Notes in Computer Science, vol. 2485, pp. 44---61. Springer, Berlin Heidelberg New York (2002)

Digital Library

[16]

Zielinski, P.: Optimistic generic broadcast. In: Fraigniaud, P. (ed.) DISC '05: Proceedings of the 19th International Conference on Distributed Computing, Lecture Notes in Computer Science, vol. 3724, pp. 369---383. Springer, Berlin Heidelberg New York (2005)

Digital Library

Cited By

Wu CAmiri MQin HMehta BMarcus RLoo B(2024)Towards Full Stack Adaptivity in Permissioned BlockchainsProceedings of the VLDB Endowment10.14778/3641204.364121617:5(1073-1080)Online publication date: 1-Jan-2024
https://dl.acm.org/doi/10.14778/3641204.3641216
Honoré WQiu LKim YShin JKim JShao Z(2024)AdoB: Bridging Benign and Byzantine Consensus with Atomic Distributed ObjectsProceedings of the ACM on Programming Languages10.1145/36498268:OOPSLA1(419-448)Online publication date: 29-Apr-2024
https://dl.acm.org/doi/10.1145/3649826
Hildred JAbebe MDaudjee K(2023)Caerus: Low-Latency Distributed Transactions for Geo-Replicated SystemsProceedings of the VLDB Endowment10.14778/3632093.363210917:3(469-482)Online publication date: 1-Nov-2023
https://dl.acm.org/doi/10.14778/3632093.3632109
Show More Cited By

Index Terms

Fast Paxos
1. Software and its engineering
  1. Software organization and properties
    1. Software system structures
      1. Distributed systems organizing principles

Index terms have been assigned to the content through auto-classification.

Recommendations

Fast Flexible Paxos: Relaxing Quorum Intersection for Fast Paxos
ICDCN '21: Proceedings of the 22nd International Conference on Distributed Computing and Networking

Paxos, the de facto standard approach to solving distributed consensus, operates in two phases, each of which requires an intersecting quorum of nodes. Multi-Paxos reduces this to one phase by electing a leader but this leader is also a performance ...
Read More
Lower bounds for asynchronous consensus

Impossibility results and best-case lower bounds are proved for the number of message delays and the number of processes required to reach agreement in an asynchronous consensus algorithm that tolerates non-Byzantine failures. General algorithms exist ...
Read More
Seamless Paxos coordinators

The Paxos algorithm requires a single correct coordinator process to operate. After a failure, the replacement of the coordinator may lead to a temporary unavailability of the application implemented atop Paxos. So far, this unavailability has been ...
Read More

Comments

Information & Contributors

Information

Published In

cover image Distributed Computing

Distributed Computing Volume 19, Issue 2

October 2006

83 pages

ISSN:0178-2770

Issue’s Table of Contents

Copyright © Copyright © 2006 Springer-Verlag.

Publisher

Springer-Verlag

Berlin, Heidelberg

Publication History

Published: 01 October 2006

Author Tags

Qualifiers

Article

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

123
Total Citations
View Citations
0
Total Downloads

Downloads (Last 12 months)0
Downloads (Last 6 weeks)0

Other Metrics

View Author Metrics

Citations

Cited By

Wu CAmiri MQin HMehta BMarcus RLoo B(2024)Towards Full Stack Adaptivity in Permissioned BlockchainsProceedings of the VLDB Endowment10.14778/3641204.364121617:5(1073-1080)Online publication date: 1-Jan-2024
https://dl.acm.org/doi/10.14778/3641204.3641216
Honoré WQiu LKim YShin JKim JShao Z(2024)AdoB: Bridging Benign and Byzantine Consensus with Atomic Distributed ObjectsProceedings of the ACM on Programming Languages10.1145/36498268:OOPSLA1(419-448)Online publication date: 29-Apr-2024
https://dl.acm.org/doi/10.1145/3649826
Hildred JAbebe MDaudjee K(2023)Caerus: Low-Latency Distributed Transactions for Geo-Replicated SystemsProceedings of the VLDB Endowment10.14778/3632093.363210917:3(469-482)Online publication date: 1-Nov-2023
https://dl.acm.org/doi/10.14778/3632093.3632109
Kurnia FVenkataramani A(2023)Oblivious PaxosProceedings of the 2023 ACM Symposium on Cloud Computing10.1145/3620678.3624647(65-80)Online publication date: 30-Oct-2023
https://dl.acm.org/doi/10.1145/3620678.3624647
Neamtu NNi HVan Renesse RGonzalez Boix ESutra P(2023)Trees and Turtles: Modular Abstractions for State Machine Replication ProtocolsProceedings of the 10th Workshop on Principles and Practice of Consistency for Distributed Data10.1145/3578358.3592148(9-15)Online publication date: 8-May-2023
https://dl.acm.org/doi/10.1145/3578358.3592148
Tonkikh APonomarev PKuznetsov PPignolet YMeng WJensen CCremers CKirda E(2023)CryptoConcurrency: (Almost) Consensusless Asset Transfer with Shared AccountsProceedings of the 2023 ACM SIGSAC Conference on Computer and Communications Security10.1145/3576915.3616587(1556-1570)Online publication date: 15-Nov-2023
https://dl.acm.org/doi/10.1145/3576915.3616587
Galletta LLaneve CMercanti IVeschetti A(2023)Resilience of Hybrid Casper Under Varying Values of ParametersDistributed Ledger Technologies: Research and Practice10.1145/35715872:1(1-25)Online publication date: 14-Mar-2023
https://dl.acm.org/doi/10.1145/3571587
Tseng LZhou NDumas CBantikyan TPalmieri RAgrawal KShun J(2023)Distributed Multi-writer Multi-reader Atomic Register with Optimistically Fast Read and WriteProceedings of the 35th ACM Symposium on Parallelism in Algorithms and Architectures10.1145/3558481.3591086(479-488)Online publication date: 17-Jun-2023
https://dl.acm.org/doi/10.1145/3558481.3591086
Mattos DCarrara GAlbuquerque CMossé D(2023)Exploring Overlay Topology Cost-Termination Tradeoff in Blockchain Vicinity-Based ConsensusIEEE Transactions on Network and Service Management10.1109/TNSM.2022.317736320:2(1733-1744)Online publication date: 1-Jun-2023
https://dl.acm.org/doi/10.1109/TNSM.2022.3177363
Wang YWang ZChai YWang X(2023)Rethink the Linearizability Constraints of Raft for Distributed SystemsIEEE Transactions on Knowledge and Data Engineering10.1109/TKDE.2023.323539935:11(11815-11829)Online publication date: 1-Nov-2023
https://dl.acm.org/doi/10.1109/TKDE.2023.3235399
Show More Cited By

View Options

View options

Get Access

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

Full Access

Get this Publication

Media

Figures

Other

Tables

View Issue’s Table of Contents