Abstract
The wide adoption of parallel processing hardware in mainstream computing as well as the raising interest for efficient parallel programming in the developer community increase the demand for parallel programming model support for common algorithmic patterns. In this work we present an extension to the OpenMP task construct to add support for reductions in while-loops and general-recursive algorithms. Further we discuss implications on the OpenMP standard and present a prototype implementation in OmpSs. Benchmark results confirm applicability of this approach and scalability on current SMP systems.
Cite
CITATION STYLE
Ciesko, J., Mateo, S., Teruel, X., Beltran, V., Martorell, X., Badia, R. M., … Labarta, J. (2014). Task-parallel reductions in openMP and OmpSs. Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 8766. https://doi.org/10.1007/978-3-319-11454-5_1
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
