Practical dependence testing
Gina Goff, Ken Kennedy, Chau‐Wen Tseng · Proceedings of the ACM SIGPLAN Conference on Programming Language Design and Implementation · 1991
Precise and efficient dependence tests are essential to theeffectivermss ofaparallelizing compiler. This paper proposes a dependence testing scheme based on classi-fyingpairs ofsubscripted variable references. Exact yet fast dependence tests are presented for certain classes ofarray references, as well as empirical results showing that these references dominate scientific Fortran codes. These dependence tests are being implemented at Rice University in both PFC, aparallelizing compiler, and ParaScope, a parallel programming environment, 1
Cited by 227 works. doi:10.1145/113445.113448
Authors
References
- The complexity of theorem-proving procedures
- Linear Programming and Extensions
- A new polynomial-time algorithm for linear programming
- Theory of Linear and Integer Programming
- The Structure of Computers and Computations
- Dependence graphs and compiler optimizations
- Optimizing supercompilers for supercomputers
- Automatic translation of FORTRAN programs to vector form
- Parallelism exposure and exploitation in programs
- On the Number of Operations Simultaneously Executable in Fortran-Like Programs and Their Resulting Speedup