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-1MaRDI QIDQ601006zbMATH OpenOpenAlexFDO

Authors Paul Kapinos, Dieter an Mey

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

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

Mathematics Subject Classification ID

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

Recommendations

• Nested parallelization with openMP
• scientific article; zbMATH DE number 1940306
• Performance characteristics for OpenMP constructs on different parallel computer architectures
• scientific article; zbMATH DE number 1863552
• OpenMP implementation of SPICE3 circuit simulator

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}

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q601006)