Experience with efficient array data flow analysis for array privatization

  • Authors:

  • Junjie Gu;Zhiyuan Li;Gyungho Lee

  • Affiliations:

  • Department of Computer Science, University of Minnesota, 200 Union Street S.E., Minneapolis, MN;Department of Computer Science, University of Minnesota, 200 Union Street S.E., Minneapolis, MN;Electrical Engineering, Division of Engineering, University of Texas - San Antonio, 6900 North Loop 1604 West, San Antonio, Texas

  • Venue:
  • PPOPP '97 Proceedings of the sixth ACM SIGPLAN symposium on Principles and practice of parallel programming
  • Year:
  • 1997

Quantified Score

Hi-index 0.00

Visualization

Abstract

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 thk 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.