Static Graphs for Coding Productivity in OpenACC

Publication date

2021-12-01



Abstract

The main contribution of this work is to increase the coding productivity for GPU programming by using the concept of Static Graphs. To do so, we have combined the new CUDA Graph API with the OpenACC programming model. We use as test cases a well-known and widely used problems in HPC and AI: the Particle Swarm Optimization. We complement the OpenACC functionality with the use of CUDA Graph, achieving accelerations of more than one order of magnitude, and a performance very close to a reference and optimized CUDA code. Finally, we propose a new specification to incorporate the concept of Static Graphs into the OpenACC specification.

Document Type

Article


Accepted version

Language

English

Pages

6 p.

Publisher

IEEE

Published in

2021 IEEE 28th International Conference on High Performance Computing, Data, and Analytics (HiPC)

Recommended citation

This citation was generated automatically.

Documents

HiPC_2021.pdf

366.0Kb

 

Rights

© 2021 IEEE. Personal use of this material is permitted. Permission from IEEE must be obtained for all other uses, in any current or future media, including reprinting/republishing this material for advertising or promotional purposes, creating new collective works, for resale or redistribution to servers or lists, or reuse of any copyrighted component of this work in other works.

This item appears in the following Collection(s)