Tsinghua U.

Cache oblivious stencil computations

9 years 3 months ago
Cache oblivious stencil computations
We present a cache oblivious algorithm for stencil computations, which arise for example in finite-difference methods. Our algorithm applies to arbitrary stencils in n-dimensional spaces. On an “ideal cache” of size Z, our algorithm saves a factor of Θ(Z1/n ) cache misses compared to a naive algorithm, and it exploits temporal locality optimally throughout the entire memory hierarchy.
Matteo Frigo, Volker Strumpen
Added 27 Jun 2010
Updated 27 Jun 2010
Type Conference
Year 2005
Where ICS
Authors Matteo Frigo, Volker Strumpen
Comments (0)