Parallel Programming Must Be Deterministic by Default
Robert L. Bocchino, Vikram Adve, Sarita V. Adve et al. · Illinois Digital Environment for Access to Learning and Scholarship (University of Illinois at Urbana-Champaign) · 2018
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.
Cited by 170 works. doi:10.1184/r1/6625115 Open-access PDF
Authors
References
- Intel threading building blocks : outfitting C++ for multi-core processor parallelism
- Programming parallel algorithms
- Optimizing Compilers for Modern Architectures: A Dependence-based Approach
- The Problem with Threads
- Polymorphic effect systems
- The potential for using thread-level data speculation to facilitate automatic parallelization
- Advances in dataflow programming languages
- Polymorphic type, region and effect inference
- Optimistic parallelism requires abstractions
- Kendo