Stencil computations are an integral component of applications in a number of scientific
computing domains. Short-vector SIMD instruction sets are ubiquitous on modern …

Stencil computations are at the core of applications in many domains such as computational
electromagnetics, image processing, and partial differential equation solvers used in a …

High-level program optimizations, such as loop transformations, are critical for high
performance on multi-core targets. However, complex sequences of loop transformations …

The importance of stencil-based algorithms in computational science has focused attention
on optimized parallel implementations for multilevel cache-based processors. Temporal …

Most stencil computations allow tile-wise concurrent start, ie, there always exists a face of
the iteration space and a set of tiling directions such that all tiles along that face can be …

Loop tiling is a well-known compiler transformation for both sequential and parallel
programs optimization. It focuses on the efficient execution of loop nests in order to generate …

We present a time skewing algorithm that breaks the memory wall for certain iterative stencil
computations. A stencil computation, even with constant weights, is a completely memory …

We present a new cache oblivious scheme for iterative stencil computations that performs
beyond system bandwidth limitations as though gigabytes of data could reside in an …

Optimizing the performance of stencil algorithms has been the subject of intense research
over the last two decades. Since many stencil schemes have low arithmetic intensity, most …

Stencil computations are at the core of various Computational Fluid Dynamics (CFD)
applications and have been well-studied for several decades. Typically they're highly …