A comparison of GPU strategies for unstructured mesh physics
Article first published online: 3 JUL 2012
Copyright © 2012 John Wiley & Sons, Ltd.
Concurrency and Computation: Practice and Experience
Volume 25, Issue 11, pages 1547–1558, 10 August 2013
How to Cite
Ferenbaugh, C. R. (2013), A comparison of GPU strategies for unstructured mesh physics. Concurrency Computat.: Pract. Exper., 25: 1547–1558. doi: 10.1002/cpe.2894
- Issue published online: 12 JUL 2013
- Article first published online: 3 JUL 2012
- Manuscript Accepted: 19 MAY 2012
- Manuscript Revised: 23 APR 2012
- Manuscript Received: 11 JAN 2012
- advanced architectures;
- unstructured mesh
There have been few efforts to date to write physics algorithms for general unstructured meshes (meshes composed of arbitrary polygons/polyhedra) on graphics processing units (GPUs). Typical strategies for GPU memory management, such as double-buffering and coalescing memory accesses, are difficult to apply to the irregular memory storage patterns of unstructured meshes. This paper presents results from an initial GPU version of a typical unstructured mesh kernel. Three different memory management strategies are described and implemented. Timing results for all three strategies are presented, in some cases showing speedups of over 20 times compared with the original CPU code.Copyright © 2012 John Wiley & Sons, Ltd.