University of Cambridge > Talks.cam > Microsoft Research Cambridge, public talks > Practical Statically-checked Deterministic Parallelism

Practical Statically-checked Deterministic Parallelism

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

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

Please note, this event may be recorded. Microsoft will own the copyright of any recording and reserves the right to distribute it as required.

Reproducibility is important in computing, whether reproducing bug reports or scientific results. After obvious sources of irreproducibility are addressed by containerization and hermetic build systems, the fundamental remaining challenge is preventing unintended nondeterminism due to parallelism and concurrency.

In this talk I present languages and libraries that provide strict deterministic parallelism by construction. Starting with a foundation that disallows writable shared memory between parallel computations, we add support for structured communication patterns that preserve the determinism guarantee, irrespective of the underlying architecture, thread count, and nondeterministic scheduling. Building an application with these patterns also clarifies its structure and supports formal reasoning about effect composition.

While the constraint of determinism may seem harsh, in this talk I argue that the future is bright: we can already build programs mixing lock-free concurrent data structures, blocking data-flow, callbacks, and GPU -based data-parallelism, without ever compromising determinism or referential transparency.

This talk is part of the Microsoft Research Cambridge, public 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