Premium
Optimizing the computation of a parallel 3D finite difference algorithm for graphics processing units
Author(s) -
PorterSobieraj J.,
Cygert S.,
Kikoła D.,
Sikorski J.,
Słodkowski M.
Publication year - 2014
Publication title -
concurrency and computation: practice and experience
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.309
H-Index - 67
eISSN - 1532-0634
pISSN - 1532-0626
DOI - 10.1002/cpe.3351
Subject(s) - stencil , computation , cuda , parallel computing , graphics processing unit , computer science , graphics , locality , computational science , series (stratigraphy) , algorithm , shared memory , computer graphics (images) , biology , paleontology , linguistics , philosophy
Summary This paper explores the possibilities of using a graphics processing unit for complex 3D finite difference computation via MUSTA‐FORCE and WENO algorithms. We propose a novel algorithm based on the new properties of CUDA surface memory optimized for 2D spatial locality and compare it with 3D stencil computations carried out via shared memory, which is currently considered to be the best approach. A case study was performed for the extensive generation of a time series of 3D grids of arbitrary size used in the computation of collisions between heavy nuclei in terms of relativistic hydrodynamics. It proved that implementation based on surface memory is as much as 23% faster than an equivalent implementation using shared memory. Copyright © 2014 John Wiley & Sons, Ltd.