Experience compiling Fortran to program dependence graphs
- 1 January 1992
- journal article
- Published by Wiley in Software: Practice and Experience
- Vol. 22 (1) , 41-62
- https://doi.org/10.1002/spe.4380220103
Abstract
The program dependence graph (PDG) is being used in research projects for compilation to parallel architectures, program version integration and program semantics. This paper describes the methods used in a prototype Fortran‐to‐PDG translator called the PDG Testbed. Implementation decisions and details of the PDG Testbed project are described as a complement to the formal papers detailing the abstract PDG. In addition, experimental results are given that show the storage consumption for a PDG relative to a conventional internal representation as well as execution times for several analysis and optimization steps.Keywords
This publication has 22 references indexed in Scilit:
- Abstracts of the 1990 Intemational Conference on Computer Languages ProceedingsACM SIGPLAN Notices, 1990
- The program dependence web: a representation supporting control-, data-, and demand-driven interpretation of imperative languagesACM SIGPLAN Notices, 1990
- Region scheduling: an approach for detecting and redistributing parallelismIEEE Transactions on Software Engineering, 1990
- A simplified framework for reduction in strengthIEEE Transactions on Software Engineering, 1989
- Automatic translation of FORTRAN programs to vector formACM Transactions on Programming Languages and Systems, 1987
- The program dependence graph and its use in optimizationACM Transactions on Programming Languages and Systems, 1987
- Interprocedural dependence analysis and parallelizationACM SIGPLAN Notices, 1986
- Abstracts in software engineeringACM SIGSOFT Software Engineering Notes, 1984
- The program dependence graph in a software development environmentACM SIGSOFT Software Engineering Notes, 1984
- A fast algorithm for finding dominators in a flowgraphACM Transactions on Programming Languages and Systems, 1979