Abstract
OpenMP tasking supports parallelization of irregular algorithms. Recent OpenMP specifications extended tasking to increase functionality and to support optimizations, for instance with the taskloop construct. However, task scheduling remains opaque, which leads to inconsistent performance on NUMA architectures. We assess design issues for task affinity and explore several approaches to enable it. We evaluate these proposals with implementations in the Nanos++ and LLVM OpenMP runtimes that improve performance up to 40% and significantly reduce execution time variation.
Cite
CITATION STYLE
Terboven, C., Hahnfeld, J., Teruel, X., Mateo, S., Duran, A., Klemm, M., … de Supinski, B. R. (2016). Approaches for task affinity in OpenMP. Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 9903 LNCS, 102–115. https://doi.org/10.1007/978-3-319-45550-1_8
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
