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

Paxos: How can we all agree?

Add to your list(s) 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.

Tell a friend about this talk:

This talk is included in these lists:

Note that ex-directory lists are not shown.

 

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