Premium
Interprocedural optimization: Experimental results
Author(s) -
Richardson Stephen,
Ganapathi Mahadevan
Publication year - 1989
Publication title -
software: practice and experience
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.437
H-Index - 70
eISSN - 1097-024X
pISSN - 0038-0644
DOI - 10.1002/spe.4380190205
Subject(s) - computer science , pascal (unit) , compiler , interprocedural optimization , optimizing compiler , programming language , data flow analysis , parallel computing , source code , code (set theory) , algorithm , theoretical computer science , loop optimization , data flow diagram , database , set (abstract data type)
The problem of tracking data flow across procedure boundaries has a long history of theoretical study by people who believed that such information would be useful for code optimization. Building upon previous work, an algorithm for interprocedural data flow analysis has been implemented. The algorithm produces three flow‐insensitive summary sets: MOD, USE and ALIASES. The utility of the resulting information was investigated using an optimizing Pascal compiler. Over a sampling of 27 bench‐marks, new optimizations performed as a result of interprocedural summary information contributed almost nothing to program execution speed. Finally, related optimization techniques of possibly greater potential are discussed.