Extracting SIMD Parallelism from Recursive Task-Parallel Programs
ACM Transactions on Parallel Computing · 31.12.2019 · 6 (4) · 1-37
DOI: 10.1145/3365663 ↗Kurz gefasst
Fachartikel in der Zeitschrift ACM Transactions on Parallel Computing, online erschienen am 26.12.2019. Verfasst von Bin Ren und 5 weiteren Autor:innen. Die Arbeit wurde bisher 4-mal zitiert (Crossref) und nennt 66 Literaturangaben. Gefördert von: NSF, Battelle for DOE, U.S. Department of Energy's (DOE) Office of Science, Office of Advanced Scientific Computing Research, under DOE Early Career.
Abstract (Originalsprache)
The pursuit of computational efficiency has led to the proliferation of throughput-oriented hardware, from GPUs to increasingly wide vector units on commodity processors and accelerators. This hardware is designed to execute data-parallel computations in a vectorized manner efficiently. However, many algorithms are more naturally expressed as divide-and-conquer, recursive, task-parallel computations. In the absence of data parallelism, it seems that such algorithms are not well suited to throughput-oriented architectures. This article presents a set of novel code transformations that expose the data parallelism latent in recursive, task-parallel programs. These transformations facilitate straightforward vectorization of task-parallel programs on commodity hardware. We also present scheduling policies that maintain high utilization of vector resources while limiting space usage. Across several task-parallel benchmarks, we demonstrate both efficient vector resource utilization and substantial speedup on chips using Intel’s SSE4.2 vector units, as well as accelerators using Intel’s AVX512 units. We then show through rigorous sampling that, in practice, our vectorization techniques are effective for a much larger class of programs.
Förderung
- NSF
- Battelle for DOE
- U.S. Department of Energy's (DOE) Office of Science, Office of Advanced Scientific Computing Research, under DOE Early Career
Zitieren
APA
Ren, B., Balakrishna, S., Jo, Y., Krishnamoorthy, S., Agrawal, K., & Kulkarni, M. (2019). Extracting SIMD Parallelism from Recursive Task-Parallel Programs. ACM Transactions on Parallel Computing, 6(4), 1-37. https://doi.org/10.1145/3365663
Vancouver
Ren B, Balakrishna S, Jo Y, Krishnamoorthy S, Agrawal K, Kulkarni M. Extracting SIMD Parallelism from Recursive Task-Parallel Programs. ACM Transactions on Parallel Computing. 2019;6(4):1-37. doi:10.1145/3365663
BibTeX
@article{Ren2019,
author = {Ren, Bin and Balakrishna, Shruthi and Jo, Youngjoon and Krishnamoorthy, Sriram and Agrawal, Kunal and Kulkarni, Milind},
title = {Extracting SIMD Parallelism from Recursive Task-Parallel Programs},
journal = {ACM Transactions on Parallel Computing},
year = {2019},
volume = {6},
number = {4},
pages = {1--37},
doi = {10.1145/3365663}
}
EUVIMED