BEGIN:VCALENDAR
VERSION:2.0
PRODID:-//Talks.cam//talks.cam.ac.uk//
X-WR-CALNAME:Talks.cam
BEGIN:VEVENT
SUMMARY:Practical Statically-checked Deterministic Parallelism  - Ryan New
 ton\, Indiana University
DTSTART:20160630T130000Z
DTEND:20160630T140000Z
UID:TALK66708@talks.cam.ac.uk
CONTACT:44515
DESCRIPTION:Reproducibility is important in computing\, whether reproducin
 g bug reports or scientific results. After obvious sources of irreproducib
 ility are addressed by containerization and hermetic build systems\, the f
 undamental remaining challenge is preventing unintended nondeterminism due
  to parallelism and concurrency.\n\nIn this talk I present languages and l
 ibraries that provide strict deterministic parallelism by construction. St
 arting with a foundation that disallows writable shared memory between par
 allel computations\, we add support for structured communication patterns 
 that preserve the determinism guarantee\, irrespective of the underlying a
 rchitecture\, thread count\, and nondeterministic scheduling. Building an 
 application with these patterns also clarifies its structure and supports 
 formal reasoning about effect composition.\n\nWhile the constraint of dete
 rminism may seem harsh\, in this talk I argue that the future is bright: w
 e 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. \n
LOCATION:Small Lecture Theatre\, Microsoft Research Ltd\, 21 Station Road\
 , Cambridge\, CB1 2FB
END:VEVENT
END:VCALENDAR