Efficient 3D Stencil Computations Using CUDA

We present an efficient implementation of 7–point and 27–point stencils on high-end Nvidia GPUs. A new method of reading the data from the global memory to the shared memory of thread blocks is developed. The method avoids conditional statements and requires only two coalesced instructions to load the tile data with the halo. Additional optimizations include storing only one XY tile of data at a time in the shared memory to lower shared memory requirements, Common Subexpression Elimination to reduce the number of instructions, and software prefetching to overlap arithmetic and mem-ory instructions, and enhance latency hiding. The efficiency of our implementation is analyzed using a simple stencil memory footprint model that takes into account the actual halo overhead due to the minimum memory transaction size on the GPUs. We use the model to demonstrate that in our implementation the memory overhead due to the halos is largely eliminated by good reuse of the halo data in the memory caches, and that our method of reading the data is close to optimal in terms of memory band-width usage. Detailed performance analysis for single precision stencil computations, and performance results for single and double precision arithmetic on two Tesla cards are presented. Our stencil implementations are more efficient than any other imple-mentation described in the literature to date. On Tesla C2050 with single and double precision arithmetic our 7–point stencil achieves an average throughput of 12.3 and 6.5 Gpts/s, respectively (98 GFLOP/s and 52 GFLOP/s, respectively). The symmetric 27–point stencil sustains a throughput of 10.9 and 5.8 Gpts/s, respectively