Productivity and performance portability of the OpenMP 3.0 tasking concept when applied to an engineering code written in \texttt{Fortran 95}

DOI10.1007/S10766-010-0138-1zbMath1211.68051OpenAlexW1991734507MaRDI QIDQ601006

Dieter an Mey, Paul Kapinos

Publication date: 3 November 2010

Published in: International Journal of Parallel Programming (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10766-010-0138-1

zbMATH Keywords

productivityparallelizationnesting\texttt{Fortran 90/95}OpenMP 3.0recursive subroutinestasking

Mathematics Subject Classification ID

Theory of programming languages (68N15) Data structures (68P05)

This page was built for publication: Productivity and performance portability of the OpenMP 3.0 tasking concept when applied to an engineering code written in \texttt{Fortran 95}