25 search results - page 1 / 5 » Cache oblivious stencil computations |
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...
ACMMSP
2006
ACM
13 years 10 months ago
2006
ACM
Stencil-based kernels constitute the core of many scientific applications on block-structured grids. Unfortunately, these codes achieve a low fraction of peak performance, due pr...
SPAA
2006
ACM
13 years 10 months ago
2006
ACM
We present a technique for analyzing the number of cache misses incurred by multithreaded cache oblivious algorithms on an idealized parallel machine in which each processor has a...
EUROPAR
2009
Springer
13 years 11 months ago
2009
Springer
Stencil based computation on structured grids is a common kernel to broad scientific applications. The order of stencils increases with the required precision, and it is a challeng...