University of Cambridge > Talks.cam > Churchill CompSci Talks > Paxos: How can we all agree?

  Browse A-Z

Log in

University Account External (via Google)

🔐 Log In

Information on

Subscribing to talksdetails Finding a talkdetails Adding a talkdetails Disseminating talksdetails Help and Documentationdetails

ℹ️ Information

Paxos: How can we all agree?

Download to your calendar using vCal

If you have a question about this talk, please contact Matthew Ireland .

Paxos algorithm has been dubbed one of the most difficult algorithms to understand in distributed systems, yet it represents the first breakthrough in solving the problem of distributed consensus. That is, how can a set of servers in an unreliable environment like the Internet agree on the same valid value? Answering this question is key for designating a leader for a distributed task, committing changes to a replicated database and is a basis of many distributed lock systems like the Google Chubby. In this talk I will start from intuitive principles and examples and derive the complete algorithm.

This talk is part of the Churchill CompSci Talks series.

This talk is included in these lists:

Note that ex-directory lists are not shown.

Other lists

Room 316 Alison Richard Building, Cambridge MR19, Centre for Mathematical Sciences, Wilberforce Road, Cambridge Queen's Lecture Theatre, Emmanuel College

Other talks

Atmospheric Methane - rise, surge, and ongoing post-surge growth. Can we mitigate the rise, and can anything be done to reduce emissions? What’s my reproduction number? Life history strategies: an interdisciplinary perspective Title to be confirmed Reachability Types, Traces, and Full Abstraction Online Causal Inference Seminar Title to be confirmed: CMS
 

© 2006-2025 Talks.cam, University of Cambridge. Contact Us | Help and Documentation | Privacy and Publicity