6 search results - page 1 / 2 » Cache oblivious parallelograms in iterative stencil computat... |
ICS
2010
Tsinghua U.
14 years 3 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
2005
Tsinghua U.
14 years 4 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...
ACMMSP
2006
ACM
14 years 4 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
14 years 4 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...
ACMMSP
2005
ACM
14 years 4 months ago
2005
ACM
In this work we investigate the impact of evolving memory system features, such as large on-chip caches, automatic prefetch, and the growing distance to main memory on 3D stencil ...