Provably and Practically Efficient Granularity Control

Abstract

Over the past decade, many programming languages and systems for parallel-computing have been developed, e.g., Fork/Join and Habanero Java, Parallel Haskell, Parallel ML, and X10. Although these systems raise the level of abstraction for writing parallel codes, performance continues to require labor-intensive optimizations for coarsening the granularity of parallel executions. In this paper, we present provably and practically efficient techniques for controlling granularity within the run-time system of the language. Our starting point is ``oracle-guided scheduling'', a result from the functional-programming community that shows that granularity can be controlled by an ``oracle'' that can predict the execution time of parallel codes. We give an algorithm for implementing such an oracle and prove that it has the desired theoretical properties under the nested-parallel programming model. We implement the oracle in C++ by extending Cilk and evaluate its practical performance. The results show that our techniques can essentially eliminate hand tuning while closely matching the performance of hand tuned codes.

Paper

Provably and Practically Efficient Granularity Control
Umut A. Acar, Vitaly Aksenov, Arthur Charguéraud, and Mike Rainey
PPOPP: Symposium on Principles and Practice of Parallel Programming, Febuary 2019