Liberating distributed consensus

Add to your list(s) Download to your calendar using vCal

• Heidi Howard (Computer Lab)
• Thursday 09 May 2019, 15:00-16:00
• FW26, Computer Laboratory, William Gates Building.

If you have a question about this talk, please contact Marco Caballero.

This talk has been canceled/deleted

Abstract: The ability to reach consensus between hosts, whether for addressing, primary election, locking, or coordination, is a fundamental necessity of modern distributed systems. The Paxos algorithm is at the heart of how we achieve distributed consensus today and as such has been the subject of extensive research to extend and optimise the algorithm for practical distributed systems. In the talk, we revisit the underlying theory behind Paxos, weakening its original requirements and generalising the algorithm. We demonstrate that Paxos is, in fact, a single point on a broad spectrum of approaches to consensus and conclude by arguing that other points on this spectrum offer a much-improved foundation for constructing scalable, resilient and high performance distributed systems.

This is a 30 mins practice talk for ScaleConf Colombia 2019.

This talk is part of the Computer Laboratory Systems Research Group Seminar series.

This talk is included in these lists:

This talk is not included in any other list

Note that ex-directory lists are not shown.