Experience with efficient array data flow analysis for array privatization

Junjie Gu, Zhiyuan Li, Gyungho Lee

Research output: Contribution to conferencePaper

22 Citations (Scopus)

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

Original languageEnglish
Pages157-167
Number of pages11
DOIs
Publication statusPublished - 1997
EventProceedings of the 1997 6th ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming - Las Vegas, NV, USA
Duration: 1997 Jun 181997 Jun 21

Other

OtherProceedings of the 1997 6th ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming
CityLas Vegas, NV, USA
Period97/6/1897/6/21

ASJC Scopus subject areas

  • Computer Science(all)

Fingerprint Dive into the research topics of 'Experience with efficient array data flow analysis for array privatization'. Together they form a unique fingerprint.

  • Cite this

    Gu, J., Li, Z., & Lee, G. (1997). Experience with efficient array data flow analysis for array privatization. 157-167. Paper presented at Proceedings of the 1997 6th ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming, Las Vegas, NV, USA, . https://doi.org/10.1145/263764.263785