PATUS: A Code Generation and Autotuning Framework for Parallel Iterative Stencil Computations on Modern Microarchitectures
Citations Over TimeTop 1% of 2011 papers
Abstract
Stencil calculations comprise an important class of kernels in many scientific computing applications ranging from simple PDE solvers to constituent kernels in multigrid methods as well as image processing applications. In such types of solvers, stencil kernels are often the dominant part of the computation, and an efficient parallel implementation of the kernel is therefore crucial in order to reduce the time to solution. However, in the current complex hardware micro architectures, meticulous architecture-specific tuning is required to elicit the machine's full compute power. We present a code generation and auto-tuning framework \textsc{Patus} for stencil computations targeted at multi- and many core processors, such as multicore CPUs and graphics processing units, which makes it possible to generate compute kernels from a specification of the stencil operation and a parallelization and optimization strategy, and leverages the auto tuning methodology to optimize strategy-dependent parameters for the given hardware architecture.
Related Papers
- Model-Driven Auto-Tuning of Stencil Computations on GPUs(2015)
- → Speeding Up Stencil Computations with Kernel Convolution(2016)2 cited
- Study on Automatic Alignment of Non-Standard Stencil Printing(2014)
- → An Efficient Finite-Difference Stencil with High-Order Temporal Accuracy for Scalar Wave Modeling(2023)