BEGIN:VCALENDAR
VERSION:2.0
PRODID:-//Talks.cam//talks.cam.ac.uk//
X-WR-CALNAME:Talks.cam
BEGIN:VEVENT
SUMMARY:Asynchronous Fixed Points - Matthew Daggitt (University of Cambrid
 ge)
DTSTART:20171020T100000Z
DTEND:20171020T110000Z
UID:TALK94261@talks.cam.ac.uk
CONTACT:Ian Orton
DESCRIPTION:With the increasing prevalence of multi-core computers\, async
 hronous computation offers one of our best hopes for significant performan
 ce gains. Unfortunately the behaviour of asynchronous algorithms are much 
 harder than that of their synchronous counterparts for humans to reason ab
 out. However several theorems exist allow proofs of properties of asynchro
 nous computations to be derived from proofs of the corresponding synchrono
 us behaviour. This talk will describe a mathematical formalisation for suc
 h asynchronous problems\, as well as several theorems guaranteeing their c
 onvergence to a unique solution even in the presence of latency\, message 
 loss\, reordering and duplication. 
LOCATION:Rainbow Room (FS07)\, Computer Laboratory
END:VEVENT
END:VCALENDAR