MetaCart Sign in to MyCiteSeerX

Include Citations | Advanced Search | Help

Disambiguated Search | Include Citations | Advanced Search | Help

Compile-time Composition of Run-time Data and Iteration Reorderings (2003) [22 citations — 2 self]

by Michelle Mills Strout ,  Larry Carter ,  Jeanne Ferrante
In Proceedings of ACM SIGPLAN Conference on Programming Language Design and Implementation
Add To MetaCart

Abstract:

Many important applications, such as those with indirect memory references or sparse data structures, have memory reference patterns which are unknown at compiletime.

Citations

173 Compiler Optimizations for Improving Data Locality – Carr, McKinley, et al. - 1994
138 Reducing the bandwidth of sparse symmetric matrices – Cuthill, McKee - 1969
110 A singular loop transformation framework based on non-singular matrices – Li, Pingali - 1994
104 Combining loop transformations considering caches and scheduling – Wolf, Maydan, et al. - 1996
75 Improving memory hierarchy performance for irregular applications – Mellor-Crummey, Whalley, et al. - 1999
72 Improving cache performance in dynamic applications through data and computation reorganization at run time – Ding, Kennedy - 1999
53 Constraint-based array dependence analysis – Pugh, Wonnacott - 1995
46 Improving locality using loop and data transformations in an integrated framework – Kandemir, Choudhary, et al. - 1998
46 Load balancing and data locality in adaptive hierarchical n-body methods: Barnes-hut, fast multipole, and radiosity – Singh, Holt, et al.
44 Cache optimization for structured and unstructured grid multigrid – DOUGLAS, HU, et al. - 2000
43 Localizing non-affine array references – Mitchell, Carter, et al. - 1999
39 A General Framework for iteration-Reordering Loop Transformations (Technical Summary – Sarkar, Thekkath - 1992
38 Synthesizing transformations for locality enhancement of imperfectly-nested loop nests – Ahmed, Mateev, et al. - 2000
33 Memory hierarchy management for iterative graph structures – Al-Furaih, Ranka - 1998
28 A comparison of locality transformations for irregular codes – Han, Tseng - 2000
27 Compilation techniques for sparse matrix computations – Bik, Wijshoff - 1993
20 Aspect-oriented programming of sparse matrix code – Irwin, Loingtier, et al. - 1997
19 A unifying framework for iteration reordering transformations – Kelly, Pugh - 1995
19 A unified framework for systematic loop transformations – Lu - 1991
19 Iteration space slicing for locality – Pugh, Rosser - 1999
16 Next-generation generic programming and its application to sparse matrix computations – Mateev, Pingali, et al. - 2000
10 Hybrid analysis: static & dynamic memory reference analysis – Rus, Rauchwerger, et al. - 2002
10 Combining performance aspects of irregular gauss-seidel via sparse tiling – Strout, Carter, et al. - 2002
9 A modal model of memory – Mitchell, Carter, et al. - 2000
8 Saman Amarasinghe. A unified framework for schedule and storage optimization – Thies, Vivien, et al. - 2001
7 Rescheduling for locality in sparse matrix computations – Strout, Carter, et al.
3 Sipr: A new framework for generating efficient code for sparse matrix computations – Pugh, Shpeisman - 1998
3 Parallel reductions: An application of adaptive algorithm selection – Yu, Dang, et al. - 2002
2 Automatic parallelization of irregular applications – Gutiérrez, Asenjo, et al. - 2000
View or Download | Add to My Collection | Correct Errors