363 search results - page 39 / 73 » Optimizing Memory Accesses For Spatial Computation |
164
Voted
ASPLOS
1994
ACM
15 years 7 months ago
1994
ACM
In the past decade, processor speed has become significantly faster than memory speed. Small, fast cache memories are designed to overcome this discrepancy, but they are only effe...
116
Voted
IPPS
2008
IEEE
15 years 9 months ago
2008
IEEE
We present an auto-tuning approach to optimize application performance on emerging multicore architectures. The methodology extends the idea of searchbased performance optimizatio...
242
Voted
CGF
2011
14 years 9 months ago
2011
This paper presents a parallel framework for simulating fluids with the Smoothed Particle Hydrodynamics (SPH) method. For low computational costs per simulation step, efficient ...
153
Voted
ICPP
2009
IEEE
15 years 9 months ago
2009
IEEE
—Sparse Matrix-Vector multiplication (SpMV) is a very challenging computational kernel, since its performance depends greatly on both the input matrix and the underlying architec...
116
Voted
ICS
2000
Tsinghua U.
15 years 6 months ago
2000
Tsinghua U.
Loop fusion is important to optimizing compilers because it is an important tool in managing the memory hierarchy. By fusing loops that use the same data elements, we can reduce t...