21 search results - page 1 / 5 » On optimal temporal locality of stencil codes |
SAC
2002
ACM
13 years 4 months ago
2002
ACM
Iterative solvers such as the Jacobi and Gauss-Seidel relaxation methods are important, but time-consuming building blocks of many scientific and engineering applications. The per...
ICS
2005
Tsinghua U.
13 years 10 months ago
2005
Tsinghua U.
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-dimension...
ICS
2010
Tsinghua U.
13 years 9 months ago
2010
Tsinghua U.
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 enormou...
ICS
2009
Tsinghua U.
13 years 11 months ago
2009
Tsinghua U.
Iterative stencil loops (ISLs) are used in many applications and tiling is a well-known technique to localize their computation. When ISLs are tiled across a parallel architecture...
SC
2000
ACM
13 years 8 months ago
2000
ACM
Compiler transformations can significantly improve data locality for many scientific programs. In this paper, we show iterative solvers for partial differential equations (PDEs) i...