%0 Conference Paper %1 wienke2014patternbased %A Wienke, Sandra %A Terboven, Christian %A Beyer, James C. %A Müller, Matthias S. %B Euro-Par 2014 Parallel Processing %C Cham %D 2014 %E Silva, Fernando %E Dutra, Inês %E Santos Costa, Vítor %I Springer International Publishing %K designPattern from:hermann software %P 812--823 %T A Pattern-Based Comparison of OpenACC and OpenMP for Accelerator Computing %X Nowadays, HPC systems frequently emerge as clusters of commodity processors with attached accelerators. Moving from tedious low-level accelerator programming to increased development productivity, the directive-based programming models OpenACC and OpenMP are promising candidates. While OpenACC was completed about two years ago, OpenMP just recently added support for accelerator programming. To assist developers in their decision-making which approach to take, we compare both models with respect to their programmability. Besides investigating their expressiveness by putting their constructs side by side, we focus on the evaluation of their power based on structured parallel programming patterns (aka algorithmic skeletons). These patterns describe the basic entities of parallel algorithms of which we cover the patterns map, stencil, reduction, fork-join, superscalar sequence, nesting and geometric decomposition. Architectural targets of this work are NVIDIA-type accelerators (GPUs) and specialties of Intel-type accelerators (Xeon Phis). Additionally, we assess the prospects of OpenACC and OpenMP concerning future development in soft- and hardware design. %@ 978-3-319-09873-9

@inproceedings{wienke2014patternbased, abstract = {Nowadays, HPC systems frequently emerge as clusters of commodity processors with attached accelerators. Moving from tedious low-level accelerator programming to increased development productivity, the directive-based programming models OpenACC and OpenMP are promising candidates. While OpenACC was completed about two years ago, OpenMP just recently added support for accelerator programming. To assist developers in their decision-making which approach to take, we compare both models with respect to their programmability. Besides investigating their expressiveness by putting their constructs side by side, we focus on the evaluation of their power based on structured parallel programming patterns (aka algorithmic skeletons). These patterns describe the basic entities of parallel algorithms of which we cover the patterns map, stencil, reduction, fork-join, superscalar sequence, nesting and geometric decomposition. Architectural targets of this work are NVIDIA-type accelerators (GPUs) and specialties of Intel-type accelerators (Xeon Phis). Additionally, we assess the prospects of OpenACC and OpenMP concerning future development in soft- and hardware design.}, added-at = {2020-12-03T11:36:23.000+0100}, address = {Cham}, author = {Wienke, Sandra and Terboven, Christian and Beyer, James C. and M{\"u}ller, Matthias S.}, biburl = {https://puma.ub.uni-stuttgart.de/bibtex/20c6b5f2bdcb0893ebd11f11f8c12b79e/dlrt}, booktitle = {Euro-Par 2014 Parallel Processing}, editor = {Silva, Fernando and Dutra, In{\^e}s and Santos Costa, V{\'i}tor}, interhash = {9ee44e2ae9a7b05ce09a3e5aa1ed31a0}, intrahash = {0c6b5f2bdcb0893ebd11f11f8c12b79e}, isbn = {978-3-319-09873-9}, keywords = {designPattern from:hermann software}, pages = {812--823}, publisher = {Springer International Publishing}, timestamp = {2020-12-03T10:36:38.000+0100}, title = {A Pattern-Based Comparison of OpenACC and OpenMP for Accelerator Computing}, year = 2014 }