Beyond induction variables
Michael P. Gerlek, Eric Stoltz, Michael Wolfe · ACM Transactions on Programming Languages and Systems · 1995
Linear induction variable detection is usually associated with the strength reduction optimization. For restructuring compilers, effective data dependence analysis requires that the compiler detect and accurately describe linear and nonlinear induction variables as well as more general sequences. In this article we present a practical technique for detecting a broader class of linear induction variables than is usually recognized, as well as several other sequence forms, including periodic, polynomial, geometric, monotonic, and wrap-around variables. Our method is based on Factored Use-Def (FUD) chains, a demand-driven representation of the popular Static Single Assignment (SSA) form. In this form, strongly connected components of the associated SSA graph correspond to sequences in the source program: we describe a simple yet efficient algorithm for detecting and classifying these sequences. We have implemented this algorithm in Nascent, our restructuring Fortran 90+ compiler, and we present some results showing the effectiveness of our approach.
Cited by 147 works. doi:10.1145/200994.201003 Open-access PDF
Authors
References
- Compilers: Principles, Techniques, and Tools
- Depth-First Search and Linear Graph Algorithms
- Efficiently computing static single assignment form and the control dependence graph
- Advanced compiler optimizations for supercomputers
- An efficient method of computing static single assignment form
- Depth-first search and linear graph algorithms
- An overview of the PTRAN analysis system for multiprocessing
- An overview of the PTRAN analysis system for multiprocessing
- Supercomputer performance evaluation and the Perfect Benchmarks
- The program dependence web: a representation supporting control-, data-, and demand-driven interpretation of imperative languages