Provably and Practically Efficient Granularity Control - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Conference Papers Year : 2019

Provably and Practically Efficient Granularity Control


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.
Fichier principal
Vignette du fichier
long_version.pdf (958.14 Ko) Télécharger le fichier
Origin : Files produced by the author(s)

Dates and versions

hal-01973285 , version 1 (08-01-2019)
hal-01973285 , version 2 (04-02-2019)



Umut A Acar, Vitaly Aksenov, Arthur Charguéraud, Mike Rainey. Provably and Practically Efficient Granularity Control. PPoPP 2019 - Principles and Practice of Parallel Programming, Feb 2019, Washington DC, United States. ⟨10.1145/3293883.3295725⟩. ⟨hal-01973285v2⟩
193 View
577 Download



Gmail Facebook X LinkedIn More