BEGIN:VCALENDAR
VERSION:2.0
PRODID:-//Talks.cam//talks.cam.ac.uk//
X-WR-CALNAME:Talks.cam
BEGIN:VEVENT
SUMMARY:Paxos: How can we all agree? - Akvile Valentukonyte\, St Catharine
 's College
DTSTART:20191106T190000Z
DTEND:20191106T193000Z
UID:TALK134476@talks.cam.ac.uk
CONTACT:Matthew Ireland
DESCRIPTION:Paxos algorithm has been dubbed one of the most difficult algo
 rithms to understand in distributed systems\, yet it represents the first 
 breakthrough in solving the problem of distributed consensus. That is\, ho
 w can a set of servers in an unreliable environment like the Internet agre
 e on the same valid value? Answering this question is key for designating 
 a leader for a distributed task\, committing changes to a replicated datab
 ase 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 der
 ive the complete algorithm.
LOCATION:Wolfson Hall\, Churchill College
END:VEVENT
END:VCALENDAR