Distributed Consensus: Making the Impossible Possible
5 likes1,424 views
The document outlines the evolution of distributed consensus in computer systems, highlighting key algorithms such as Paxos, Raft, and Fast Paxos, and addressing the challenges of achieving consensus in asynchronous, unreliable environments. It discusses historical results on consensus impossibility, various replication techniques, and future directions for algorithm development. The aim is to encourage system designers to find suitable consensus algorithms for their specific applications despite theoretical difficulties.
Distributed Consensus: Making the Impossible Possible
- 1. Distributed Consensus: Making Impossible Possible QCon London Tuesday 29/3/2016 Heidi Howard PhD Student @ University of Cambridge heidi.howard@cl.cam.ac.uk @heidiann360
- 2. InfoQ.com: News & Community Site • 750,000 unique visitors/month • Published in 4 languages (English, Chinese, Japanese and Brazilian Portuguese) • Post content from our QCon conferences • News 15-20 / week • Articles 3-4 / week • Presentations (videos) 12-15 / week • Interviews 2-3 / week • Books 1 / month Watch the video with slide synchronization on InfoQ.com! https://www.infoq.com/presentations/ distributed-consensus
- 3. Purpose of QCon - to empower software development by facilitating the spread of knowledge and innovation Strategy - practitioner-driven conference designed for YOU: influencers of change and innovation in your teams - speakers and topics driving the evolution and innovation - connecting and catalyzing the influencers and innovators Highlights - attended by more than 12,000 delegates since 2007 - held in 9 cities worldwide Presented at QCon London www.qconlondon.com
- 5. What is Consensus? “The process by which we reach agreement over system state between unreliable machines connected by asynchronous networks”
- 6. Why? • Distributed locking • Banking • Safety critical systems • Distributed scheduling and coordination Anything which requires guaranteed agreement
- 7. A walk through history We are going to take a journey through the developments in distributed consensus, spanning 3 decades. We are going to search for answers to questions like: • how do we reach consensus? • what is the best method for reaching consensus? • can we even reach consensus? • what’s next in the field?
- 8. FLP Result off to a slippery start Impossibility of distributed consensus with one faulty process Michael Fischer, Nancy Lynch and Michael Paterson ACM SIGACT-SIGMOD Symposium on Principles of Database Systems 1983
- 9. FLP We cannot guarantee agreement in an asynchronous system where even one host might fail. Why? We cannot reliably detect failures. We cannot know for sure the difference between a slow host/network and a failed host NB: We can still guarantee safety, the issue limited to guaranteeing liveness.
- 10. Solution to FLP In practice: We accept that sometimes the system will not be available. We mitigate this using timers and backoffs. In theory: We make weaker assumptions about the synchrony of the system e.g. messages arrive within a year.
- 11. Paxos Lamport’s original consensus algorithm The Part-Time Parliament Leslie Lamport ACM Transactions on Computer Systems May 1998
- 12. Paxos The original consensus algorithm for reaching agreement on a single value. • two phase process: prepare and commit • majority agreement • monotonically increasing numbers
- 13. Paxos Example - Failure Free
- 15. 1 2 3 P: C: P: C: P: C: B Incoming request from Bob
- 16. 1 2 3 P: C: P: 13 C: P: C: B Promise (13) ? Phase 1
- 17. 1 2 3 P: 13 C: OKOK P: 13 C: P: 13 C: Phase 1
- 18. 1 2 3 P: 13 C: 13, B P: 13 C: P: 13 C: Phase 2 Commit (13, ) ?B
- 19. 1 2 3 P: 13 C: 13, B P: 13 C: 13, P: 13 C: 13, Phase 2 B B OKOK
- 20. 1 2 3 P: 13 C: 13, B P: 13 C: 13, P: 13 C: 13, B B OK Bob is granted the lock
- 21. Paxos Example - Node Failure
- 23. 1 2 3 P: C: P: 13 C: P: C: Promise (13) ? Phase 1 B Incoming request from Bob
- 24. 1 2 3 P: 13 C: P: 13 C: P: 13 C: Phase 1 B OK OK
- 25. 1 2 3 P: 13 C: P: 13 C: 13, P: 13 C: Phase 2 Commit (13, ) ?B B
- 26. 1 2 3 P: 13 C: P: 13 C: 13, P: 13 C: 13, Phase 2 B B
- 27. 1 2 3 P: 13 C: P: 13 C: 13, P: 13 C: 13, Alice would also like the lock B B A
- 28. 1 2 3 P: 13 C: P: 13 C: 13, P: 13 C: 13, Alice would also like the lock B B A
- 29. 1 2 3 P: 22 C: P: 13 C: 13, P: 13 C: 13, Phase 1 B B A Promise (22) ?
- 30. 1 2 3 P: 22 C: P: 13 C: 13, P: 22 C: 13, Phase 1 B B A OK(13, )B
- 31. 1 2 3 P: 22 C: 22, P: 13 C: 13, P: 22 C: 13, Phase 2 B B A Commit (22, ) ?B B
- 32. 1 2 3 P: 22 C: 22, P: 13 C: 13, P: 22 C: 22, Phase 2 B B OK B NO
- 34. 1 2 3 P: 13 C: P: 13 C: P: 13 C: B Phase 1 - Bob
- 35. 1 2 3 P: 21 C: P: 21 C: P: 21 C: B Phase 1 - Alice A
- 36. 1 2 3 P: 33 C: P: 33 C: P: 33 C: B Phase 1 - Bob A
- 37. 1 2 3 P: 41 C: P: 41 C: P: 41 C: B Phase 1 - Alice A
- 38. Paxos Summary Clients much wait two round trips (2 RTT) to the majority of nodes. Sometimes longer. The system will continue as long as a majority of nodes are up
- 39. Multi-Paxos Lamport’s leader-driven consensus algorithm Paxos Made Moderately Complex Robbert van Renesse and Deniz Altinbuken ACM Computing Surveys April 2015 Not the original, but highly recommended
- 40. Multi-Paxos Lamport’s insight: Phase 1 is not specific to the request so can be done before the request arrives and can be reused. Implication: Bob now only has to wait one RTT
- 41. State Machine Replication fault-tolerant services using consensus Implementing Fault-Tolerant Services Using the State Machine Approach: A Tutorial Fred Schneider ACM Computing Surveys 1990
- 42. State Machine Replication A general technique for making a service, such as a database, fault-tolerant. Application Client Client
- 46. CAP Theorem You cannot have your cake and eat it CAP Theorem Eric Brewer Presented at Symposium on Principles of Distributed Computing, 2000
- 47. Consistency, Availability & Partition Tolerance - Pick Two 1 2 3 4 B C
- 48. Paxos Made Live How google uses Paxos Paxos Made Live - An Engineering Perspective Tushar Chandra, Robert Griesemer and Joshua Redstone ACM Symposium on Principles of Distributed Computing 2007
- 49. Paxos Made Live Paxos made live documents the challenges in constructing Chubby, a distributed coordination service, built using Multi-Paxos and SMR.
- 50. Isn’t this a solved problem? “There are significant gaps between the description of the Paxos algorithm and the needs of a real-world system. In order to build a real-world system, an expert needs to use numerous ideas scattered in the literature and make several relatively small protocol extensions. The cumulative effort will be substantial and the final system will be based on an unproven protocol.”
- 51. Challenges • Handling disk failure and corruption • Dealing with limited storage capacity • Effectively handling read-only requests • Dynamic membership & reconfiguration • Supporting transactions • Verifying safety of the implementation
- 52. Fast Paxos Like Multi-Paxos, but faster Fast Paxos Leslie Lamport Microsoft Research Tech Report MSR-TR-2005-112
- 53. Fast Paxos Paxos: Any node can commit a value in 2 RTTs Multi-Paxos: The leader node can commit a value in 1 RTT But, what about any node committing a value in 1 RTT?
- 54. Fast Paxos We can bypass the leader node for many operations, so any node can commit a value in 1 RTT. However, we must either: • reduce the number of failures we guarantee to tolerance, or • increase the size of the quorum, or • a combination of both
- 55. Egalitarian Paxos Don’t restrict yourself unnecessarily There Is More Consensus in Egalitarian Parliaments Iulian Moraru, David G. Andersen, Michael Kaminsky SOSP 2013 also see Generalized Consensus and Paxos
- 56. Egalitarian Paxos The basis of SMR is that every replica of an application receives the same commands in the same order. However, sometimes the ordering can be relaxed…
- 57. C=1 B? C=C+1 C? B=0 B=C C=1 B? C=C+1 C? B=0 B=C Partial Ordering Total Ordering
- 58. C=1 B? C=C+1 C? B=0 B=C Many possible orderings B? C=C+1 C?B=0 B=CC=1 B?C=C+1 C? B=0 B=CC=1 B? C=C+1 C? B=0 B=CC=1
- 59. Egalitarian Paxos Allow requests to be out-of-order if they are commutative. Conflict becomes much less common. Works well in combination with Fast Paxos.
- 60. Viewstamped Replication Revisited the forgotten algorithm Viewstamped Replication Revisited Barbara Liskov and James Cowling MIT Tech Report MIT-CSAIL-TR-2012-021
- 61. Viewstamped Replication Revisited (VRR) Interesting and well explained variant of SMR + Multi- Paxos. Key features: • Round robin leader election • Dynamic Membership
- 62. Raft Consensus Paxos made understandable In Search of an Understandable Consensus Algorithm Diego Ongaro and John Ousterhout USENIX Annual Technical Conference 2014
- 63. Raft Raft has taken the wider community by storm. Due to its understandable description It’s another variant of SMR with Multi-Paxos. Key features: • Really strong leadership - all other nodes are passive • Dynamic membership and log compaction
- 64. Follower Candidate Leader Startup/ Restart Timeout Win Timeout Step down Step down
- 65. Ios Why do things yourself, when you can delegate it? to appear
- 66. Ios The issue with leader-driven algorithms like Multi- Paxos, Raft and VRR is that throughput is limited to one node. Ios allows a leader to safely and dynamically delegate their responsibilities to other nodes in the system.
- 67. Hydra consensus for geo-replication to appear
- 68. Hydra Distributed consensus for systems which span multiple datacenters. We use Ios for replication within the datacenter and a Egalitarian Paxos like protocol for across datacenters. The system has a clear leader but most requests simply bypass the leader.
- 69. 1 2 3 4 5 6 7 8 9 Tokyo West Coast East Coast B
- 70. 1 2 3 4 5 6 7 8 9 Tokyo West Coast East Coast B
- 71. 1 2 3 4 5 6 7 8 9 Tokyo West Coast East Coast B
- 72. The road we travelled • 2 impossibility results: CAP & FLP • 1 replication method: State machine Replication • 6 consensus algorithms: Paxos, Multi-Paxos, Fast Paxos, Egalitarian Paxos, Viewstamped Replication Revisited & Raft • 2 future algorithms: Ios & Hydra
- 73. How strong is the leadership? Strong Leadership Leaderless Paxos Egalitarian Paxos Raft VRR Ios Hydra Multi-Paxos Fast Paxos Leader with Delegation Leader only when needed Leader driven
- 74. Who is the winner? Depends on the award: • Best for minimum latency: VRR • Easier to understand: Raft • Best for WANs (conflicts rare): Egalitarian Paxos • Best for WANs (conflicts common): Fast Paxos
- 75. Future 1. More algorithms offering a compromise between strong leadership and leaderless 2. More understandable consensus algorithms 3. Achieving consensus is getting cheaper, even in challenging settings 4. Deployment with micro-services and unikernels 5. Self-scaling replication - adapting resources to maintain resilience level.
- 76. Stops we drove passed We have seen one path through history, but many more exist. • Alternative replication techniques e.g. chain replication and primary backup replication • Alternative failure models e.g. nodes acting maliciously • Alternative domains e.g. sensor networks, mobile networks, between cores
- 77. Summary Do not be discouraged by impossibility results and dense abstract academic papers. Consensus is useful and achievable. Find the right algorithm for your specific domain.
- 78. Watch the video with slide synchronization on InfoQ.com! https://www.infoq.com/presentations/ distributed-consensus