Liberating Distributed Consensus - Heidi Howard
Channel:Reactive Summit · Length:34:51 · Published:2018-12-08 · Views:6930
Summary
Heidi Howard's Reactive Summit 2018 talk on generalizing Paxos by weakening its original requirements. She shows Paxos is one point on a broad spectrum of consensus approaches.
Why HN recommends it
HN recommends it as an illuminating, approachable explanation of distributed consensus.
Heidi Howard is incredible and her work on distributed consensus is illuminating. — HN, 2020
Subtitles (excerpt)
thank you so much for deciding to stay in this room I hope that you chose because of the content of the talk and not because of the the comfy seats in here and you have decided to kind of dive the depths brave distributed consensus with me today instead of braving the cold winds out there in Montreal so my name is Heidi Howard I'm a researcher at the University of Cambridge and for the last four years I've been studying distributed consensus I'm absolutely fascinated by the problem of distributed consensus it's one of the most kind of fundamental and powerful primitives in distributed systems it's really widely used but it's really subtle poorly understood and in my mind often poorly implemented and today what we're going to do is we're going to take a step back we're going to revise the theory that's been around for three decades and we're going to prove that some of the most famous algorithms namely Paxos are actually conservative in the way they approach distributed consensus so we're all here today because we subscribe to this distributed dream we believe that these systems if done correctly can be performance scalable low latency reliable dependable consistent but we're not naive we
On Hacker News
Heidi Howard is incredible and her work on distributed consensus is illuminating. I think she has actually successfully cracked the cookie of "making consensus easy". [VIDEO] — jganetsk, 2020-04
>A more recent development is Heidi Howard's work Glad someone has mentioned her here. This talk helped me greatly [VIDEO] . — poooogles, 2020-10
Tbh I think you got it backwards. CALM is actually very much about eventual consistency. The gist is basically, that distributed systems are only eventually consistent iff they are logically monotonic. Coordination as used in this article basically means "needs to be decided by an authority". But because of CALM we know that in order to elect an authority/leader, you need a consensus algorithm th… — j-pb, 2020-08
Check out Heidi Howard's work for some nice generalisations and variations of Paxos. Her approach using immutable state makes things more tractable. [LINK] [VIDEO] — richdougherty, 2019-09
Related videos
- Bret Victor The Future of Programming · Joey Reid · 32:55
- Maybe Not - Rich Hickey · ClojureTV · 1:03:28
- Alan Kay - Normal Considered Harmful · powerfuloutlet · 1:07:26
- "Performance Matters" by Emery Berger · Strange Loop Conference · 42:15
- The Soul of Erlang and Elixir • Sasa Juric • GOTO 2019 · GOTO Conferences · 42:02
- "Testing Distributed Systems w/ Deterministic Simulation" by Will Wilson · Strange Loop Conference · 40:20
- Erlang Factory 2014 - That's 'Billion' with a 'B': Scaling to the Next Level at WhatsApp · Erlang Solutions · 49:15
- "Turning the database inside out with Apache Samza" by Martin Kleppmann · Strange Loop Conference · 47:42
- The Language of the System - Rich Hickey · ClojureTV · 1:02:49
- Google I/O 2012 - Go Concurrency Patterns · Google for Developers · 51:27
- Conflict Resolution for Eventual Consistency • Martin Kleppmann • GOTO 2016 · GOTO Conferences · 51:35
- "Unison: a new distributed programming language" by Paul Chiusano · Strange Loop Conference · 41:05
- Paxos lecture (Raft user study) · Diego Ongaro · 1:06:33
- Hewitt, Meijer and Szyperski: The Actor Model (everything you wanted to know...) · jasonofthel33t · 42:34
- Advanced Topics in Programming Languages: A Lock-Free Hash Table · GoogleTalksArchive · 58:35
- "I See What You Mean" by Peter Alvaro · Strange Loop Conference · 52:29