Maximizing Loop Parallelism and Improving Data Locality via Loop Fusion and Distribution (1994)

by Ken Kennedy , Kathryn S. McKinley
Venue:IN LANGUAGES AND COMPILERS FOR PARALLEL COMPUTING
Citations:127 - 11 self

Active Bibliography

38 Automatic and Interactive Parallelization – K S McKinley - 1992
69 Improving effective bandwidth through compiler enhancement of global cache reuse – Chen Ding - 2001
96 Optimizing for Parallelism and Data Locality – Ken Kennedy, Kathryn S. M Kinley - 1992
300 Improving Data Locality with Loop Transformations – Kathryn S. McKinley, Steve Carr, Chau-Wen Tseng - 1996
719 What energy functions can be minimized via graph cuts – Vladimir Kolmogorov, Ramin Zabih - 2004
518 The Cache Performance and Optimizations of Blocked Algorithms – Monica S. Lam, Edward E. Rothberg, Michael E. Wolf - 1991
834 The program dependence graph and its use in optimization – Jeanne Ferrante, Karl J. Ottenstein, Joe D. Warren - 1987
1429 Fast approximate energy minimization via graph cuts – Yuri Boykov, Olga Veksler, Ramin Zabih - 2001
832 An Experimental Comparison of Min-Cut/Max-Flow Algorithms for Energy Minimization in Vision – Yuri Boykov, Vladimir Kolmogorov - 2001