Sciweavers

Share
PLDI
2003
ACM

Compile-time composition of run-time data and iteration reorderings

9 years 2 months ago
Compile-time composition of run-time data and iteration reorderings
Many important applications, such as those using sparse data structures, have memory reference patterns that are unknown at compile-time. Prior work has developed runtime reorderings of data and computation that enhance locality in such applications. This paper presents a compile-time framework that allows the explicit composition of run-time data and iterationreordering transformations. Our framework builds on the iteration-reordering framework of Kelly and Pugh to represent the effects of a given composition. To motivate our extension, we show that new compositions of run-time reordering transformations can result in better performance on three benchmarks. We show how to express a number of run-time data and iteration-reordering transformations that focus on improving data locality. We also describe the space of possible run-time reordering transformations and how existing transformations fit within it. Since sparse tiling techniques are included in our framework, they become more...
Michelle Mills Strout, Larry Carter, Jeanne Ferran
Added 05 Jul 2010
Updated 05 Jul 2010
Type Conference
Year 2003
Where PLDI
Authors Michelle Mills Strout, Larry Carter, Jeanne Ferrante
Comments (0)
books