Parallel programming must be deterministic by default

Research output: Contribution to conferencePaperpeer-review

Abstract

In today's widely used parallel programming models, subtle programming errors can lead to unintended nondeterministic behavior and hard to catch bugs. In contrast, we argue for a parallel programming model that is deterministic by default: deterministic behavior is guaranteed unless the programmer explicitly uses nondeterministic constructs. This goal is particularly challenging for modern object-oriented languages with expressive use of reference aliasing and updates to shared mutable state. We propose a broad research agenda in support of this goal, and we describe some of our own work to further that agenda.

Original languageEnglish (US)
StatePublished - 2009
Event1st USENIX Workshop on Hot Topics in Parallelism, HotPar 2009 - Berkeley, United States
Duration: Mar 30 2009Mar 31 2009

Conference

Conference1st USENIX Workshop on Hot Topics in Parallelism, HotPar 2009
CountryUnited States
CityBerkeley
Period3/30/093/31/09

ASJC Scopus subject areas

  • Software
  • Theoretical Computer Science
  • Computational Theory and Mathematics

Fingerprint Dive into the research topics of 'Parallel programming must be deterministic by default'. Together they form a unique fingerprint.

Cite this