Detection and GPU accelerationof 3D FDTD algorithms based on memory access patterns
Ran Shao, David Linton, Ivor Spence, Peter Milligan, Ning Zheng
Abstract
Ran Shao, David Linton, Ivor Spence, Peter Milligan, Ning Zheng
Abstract
A semi-automatic tool is reported that first analyzes the sequential FDTD program to obtain memory access patterns and related features, and then optimizes the FDTD program with combined use of several types of CUDA memory on both Fermi and Kepler architecture GPUs. The experiments show a 13% and 18% speedup using Fermi and Kepler GPUs respectively compared to the GPU version program without optimization. Up to 142 times speedup is achieved compared to the sequential FDTD C program at a FDTD 3D mesh size of 250* 250* 250 (15.625 million mesh cells) with 10 layers CPML boundary conditions in 4096 time steps.
A significance statement is not available in the OpenAlex record.
A contribution statement is not available in the OpenAlex record.
Method details are not available in the OpenAlex metadata.
Findings are not separately available in the OpenAlex metadata.
Limitations are not available in the OpenAlex metadata.
Application details are not available in the OpenAlex metadata.
A semi-automatic tool is reported that first analyzes the sequential FDTD program to obtain memory access patterns and related features, and then optimizes the FDTD program with combined use of several types of CUDA memory on both Fermi and Kepler architecture GPUs. The experiments show a 13% and 18% speedup using Fermi and Kepler GPUs respectively compared to the GPU version program without optimization. Up to 142 times speedup is achieved compared to the sequential FDTD C program at a FDTD 3D mesh size of 250* 250* 250 (15.625 million mesh cells) with 10 layers CPML boundary conditions in 4096 time steps.
Key concepts: Speedup, CUDA, Finite-difference time-domain method, Parallel computing, Computer science, Computational science, Kepler, Algorithm