HackerTube

Paxos lecture (Raft user study)

Diego Ongaro6 HN recommenders · recommended in 6 months, 2013–2024
YouTube
lecture · intermediate · evergreen · 2013–2024 on HN

John Ousterhout's slides-and-voiceover lecture on Paxos, made for the Raft user study comparing how students learn Raft and Paxos. It is a full introduction to the Paxos consensus algorithm.

Recommended as a clear, lucid way to learn Paxos and Multi-Paxos, ideally alongside the companion Raft video.

7 comments from Hacker News

@cljacoby2024-02 · in “The leadership myth in replicated databases (2023)”

I recently took a Distributed Systems course, and I also thought it was very interesting and unexpected how in the most basic form of Paxos, there is no concept of node roles or hierarchy like leader/follower, master/replica, etc. The base case is that all nodes have the same replicated log, and are "writers" capable of initiating changes to the log. This youtube video was particularly helpful in learning about consensus algorithms, specifically Paxos/MultiPaxos: ▶ this video John Ousterhout (author of Raft) walks through Paxos/MultiPaxos as outlined by Leslie Lamport, and then talks about a series of optimizations to improve performance. One key optimization is transitioning from performing consensus on a single log-slot proposal, to the entire log-slot altogether, which mitigates failed consensus rounds, and is where concepts like leader nodes emerge. If your familiar with Raft and Paxos, while listening to these optimization applied to MultiPaxos, you can kind of notice it to begin to resemble Raft. The course I took was through Georgia Tech, but was largely based around a framework developed at the University of Washington called dslabs: link link It was super informative for my learning about the foundations of distributed systems, namely consensus algorithms. I'd highly recommend it for anyone interested in learning more. Although fair warning, the programming assignments were quite difficult and time consuming.

Strongly recommends View on HN
@krat0sprakhar2014-10 · in “The Raft Consensus Algorithm”

One of the most lucid explanations of the Raft Consensus Algorithm that I've ever seen is the one in John Ousterhout and Diego Ongaro's Raft User Study[0]. The 2 videos do an excellent job of explaining both the Paxos and Raft algorithms and the key differences between them. John's narration is extremely clear and the slides are very informative. Definitely recommended! Raft is a consensus algorithm designed to be easier to understand than Paxos. To measure Raft's understandability, we conducted an experimental study using CS students at two universities. We recorded a video lecture of Raft and another of Paxos, and created corresponding quizzes. This page makes our materials available for anyone interested. We think these are valuable resources for anyone learning consensus (whether Raft or Paxos or both). [0] - link Raft Video - link Paxos Video - ▶ this video

Strongly recommends View on HN
@ignoramous2021-07 · in “Paxos vs. Raft: Have we reached consensus on distributed consensus?”

Raft is very similar to Multi-Paxos. These Raft and Paxos user studies comparing the "understandability" of the two protocols might be helpful: ▶ this video (Paxos), link (Raft). See also, comparison of various "Paxos" implementations: link

Recommends View on HN
@ahelwer2020-04 · in “Debugging Distributed Systems”

IMO if you develop a good understanding of Paxos then learn TLA+ you'll know everything you need to work on production distributed systems. Learn about CRDTs too, just to see what eventually-consistent systems look like. The real core of distributed systems is less knowing specific algorithms and more knowing what makes the field so hard, what solutions are possible, and the limitations of those solutions. For learning Paxos I like this video: ▶ this video Implement it yourself in your language of choice. For TLA+ there's the Practical TLA+ textbook or Leslie Lamport's video lecture series: link

Recommends View on HN
@brutus12132017-03 · in “Paxos in 25 Lines”

The first is a proof published in a paper that you can read. I recall the proof is for single decree paxos. In reality, you need multiple rounds. There are many subtle variations and I am not aware of a proof for that. Is an implementation correct? Frankly, that is a PhD thesis that is still to have been written. If you want to do a PhD and this topic burns inside you, go for it. Regarding consensus algorithm overview, no .. not that I know of. Here is a good video on Paxos: ▶ this video Enjoy my friend.

Recommends View on HN