Autotuning Stencil-Based Computations on GPUs

Citations Over TimeTop 10% of 2012 papers

Abstract

Finite-difference, stencil-based discretization approaches are widely used in the solution of partial differential equations describing physical phenomena. Newton-Krylov iterative methods commonly used in stencil-based solutions generate matrices that exhibit diagonal sparsity patterns. To exploit these structures on modern GPUs, we extend the standard diagonal sparse matrix representation and define new matrix and vector data types in the PETSc parallel numerical toolkit. We create tunable CUDA implementations of the operations associated with these types after identifying a number of GPU-specific optimizations and tuning parameters for these operations. We discuss our implementation of GPU auto tuning capabilities in the Orio framework and present performance results for several kernels, comparing them with vendor-tuned library implementations.

Related Papers

• → An Efficient Vectorization Scheme for Stencil Computation(2022)4 cited
• → Temporal vectorization for stencils(2021)10 cited
• → Temporal Vectorization for Stencils(2020)
• → Spectral Analysis and Preconditioned Iterative Solvers for Large Structured Linear Systems(2022)
• → An Efficient Vectorization Scheme for Stencil Computation(2021)