BEGIN:VCALENDAR
VERSION:2.0
PRODID:-//Talks.cam//talks.cam.ac.uk//
X-WR-CALNAME:Talks.cam
BEGIN:VEVENT
SUMMARY:Flexible Paxos: Reaching agreement without majorities - Heidi Howa
 rd (Computer Laboratory)
DTSTART:20161110T150000Z
DTEND:20161110T160000Z
UID:TALK68505@talks.cam.ac.uk
CONTACT:Liang Wang
DESCRIPTION:The Paxos algorithm is a widely adopted approach to achieving 
 distributed consensus. Over three decades it has been extensively research
 ed\, optimized and deployed in popular systems such as Raft\, Zookeeper an
 d Chubby. At its foundation\, Paxos uses two phases\, each requiring agree
 ment from a majority of participants (known as quorums) to reliably reach 
 consensus.\n\nIn this seminar\, I will share the simple yet powerful resul
 t that each of the phases of Paxos may use non-intersecting quorums. This 
 means that majorities are no longer necessary and that Paxos is in fact a 
 single point on a broad spectrum of possibilities for safely reaching cons
 ensus. This result therefore opens the door for a new breed of scalable an
 d resilient consensus algorithms for performant production system. \n\nMor
 e information about this result can be found at fpaxos.github.io and the f
 ollowing blog post summarises the theory paper for the systems community h
 ttp://hh360.user.srcf.net/blog/2016/08/majority-agreement-is-not-necessary
 /
LOCATION:FW26\, Computer Laboratory\, William Gates Building
END:VEVENT
END:VCALENDAR