Array data flow analysis is known to be crucial to the success of array privatization, one of the most important techniques for program parallelization. It is clear that array data flow analysis should be performed interprocedurally and symbolically, and that it often needs to handle the predicates represented by IF conditions. Unfortunately, such a powerful program analysis can be extremely time-consuming if not carefully designed. How to enhance the efficiency of this analysis to a practical level remains an issue largely untouched to date. This paper documents our experience with building a highly efficient array data flow analyzer which is based on guarded array regions and which runs faster, by one or two orders of magnitude, than other similarly powerful tools.
|Number of pages||11|
|Journal||SIGPLAN Notices (ACM Special Interest Group on Programming Languages)|
|Publication status||Published - 1997 Jul 1|
ASJC Scopus subject areas
- Computer Graphics and Computer-Aided Design