The Omega Test: a fast and practical integer programming algorithm for dependence analysis (1992)

by William Pugh
Venue:Communications of the ACM
Citations:450 - 15 self

Documents Related by Co-Citation

708 A data locality optimizing algorithm – Michael E. Wolf, Monica S. Lam - 1991
294 Automatic Translation of FORTRAN Programs to Vector Form – Randy Allen, Ken Kennedy - 1987
442 Optimizing Supercompilers for Supercomputers – Michael Wolfe
26 Going beyond Integer Programming with the Omega Test to Eliminate False Data Dependences – William Pugh, David Wonnacott - 1992
183 More Iteration Space Tiling – M Wolfe - 1989
20 Static Analysis of Upper and Lower Bounds on Dependences and Parallelism – William Pugh, David Wonnacott - 1994
48 Loop Transformations for Restructuring Compilers – Utpal Banerjee - 1993
83 Counting Solutions to Presburger Formulas: How and Why – William Pugh - 1994
195 Scanning Polyhedra with DO Loops – Corinne Ancourt, Fran├žois Irigoin - 1991
164 Parametric Integer Programming – Paul Feautrier - 1988
241 Supernode partitioning – F Irigoin, R Triolet - 1988
120 Efficient and exact data dependence analysis – D E Maydan, J L Hennessy, M S Lam - 1991
96 Compiler Blockability of Numerical Algorithms – Steve Carr, Ken Kennedy - 1992
96 Counting Solutions to Linear and Nonlinear Constraints through Ehrhart Polynomials: Applications to Analyze and Transform Scientific Programs – Philippe Clauss - 1996
201 Tile Size Selection Using Cache Organization and Data Layout – Stephanie Coleman, Kathryn S. M Kinley - 1995
12 On estimating and enhancing cache effectiveness (extended abstract – Jeanne Ferrante, Vivek Sarkar, Wendy Thrash - 1991
79 Cache Interference Phenomena – O. Temam, C. Fricker, W. Jalby - 1994
46 The cache performance of blocked algorithms – M Lam, E Rothberg, M Wolf - 1991
144 Cache Profiling and the SPEC Benchmarks: A Case Study – Alvin R. Lebeck, David A. Wood - 1994