Sciweavers

9 search results - page 1 / 2
» Towards Optimal Multi-level Tiling for Stencil Computations
Sort
View
IPPS
2007
IEEE
13 years 11 months ago
Towards Optimal Multi-level Tiling for Stencil Computations
Stencil computations form the performance-critical core of many applications. Tiling and parallelization are two important optimizations to speed up stencil computations. Many til...
Lakshminarayanan Renganarayanan, Manjukumar Harthi...
SAC
2002
ACM
13 years 4 months ago
On optimal temporal locality of stencil codes
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...
Claudia Leopold
ICS
2010
Tsinghua U.
13 years 9 months ago
Cache oblivious parallelograms in iterative stencil computations
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...
Robert Strzodka, Mohammed Shaheen, Dawid Pajak, Ha...
SC
2000
ACM
13 years 8 months ago
Tiling Optimizations for 3D Scientific Computations
Compiler transformations can significantly improve data locality for many scientific programs. In this paper, we show iterative solvers for partial differential equations (PDEs) i...
Gabriel Rivera, Chau-Wen Tseng
ICS
2009
Tsinghua U.
13 years 11 months ago
Performance modeling and automatic ghost zone optimization for iterative stencil loops on GPUs
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...
Jiayuan Meng, Kevin Skadron