University of Cambridge > > Logic & Semantics for Dummies > Asynchronous Fixed Points

Asynchronous Fixed Points

Add to your list(s) Download to your calendar using vCal

If you have a question about this talk, please contact Ian Orton.

With the increasing prevalence of multi-core computers, asynchronous computation offers one of our best hopes for significant performance gains. Unfortunately the behaviour of asynchronous algorithms are much harder than that of their synchronous counterparts for humans to reason about. However several theorems exist allow proofs of properties of asynchronous computations to be derived from proofs of the corresponding synchronous behaviour. This talk will describe a mathematical formalisation for such asynchronous problems, as well as several theorems guaranteeing their convergence to a unique solution even in the presence of latency, message loss, reordering and duplication.

This talk is part of the Logic & Semantics for Dummies series.

Tell a friend about this talk:

This talk is included in these lists:

Note that ex-directory lists are not shown.


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