8 search results - page 2 / 2 » lcpc 1998 |
LCPC
1998
Springer
13 years 11 months ago
1998
Springer
There is a class of sparse matrix computations, such as direct solvers of systems of linear equations, that change the fill-in (nonzero entries) of the coefficient matrix, and invo...
LCPC
1998
Springer
1998
Springer
A Loop Transformation Algorithm Based on Explicit Data Layout Representation for Optimizing Locality
13 years 11 months ago
We present a cache locality optimization technique that can optimize a loop nest even if the arrays referenced have different layouts in memory. Such a capability is required for a...
LCPC
1998
Springer
13 years 11 months ago
1998
Springer
Techniques for aggressive optimization and parallelization of applications can have the side-effect of introducing copy instructions, register-to-register move instructions, into t...