Gated SSA-based Demand-Driven Symbolic Analysis for Parallelizing Compilers

In this paper, we present a GSA-based technique that performs more e cient and more precise symbolic analysis of predicated assignments, recurrences and index arrays. The e ciency is improved by using a backward substitution scheme that performs resolution of assertions on-demand and uses heuristics to limit the number of substitution. The precision is increased by utilizing the gating predicate information embedded in the GSA and the control dependence information in the program ow graph. Examples from array privatization are used to illustrate how the technique aids loop parallelization.

• Type: Conference
• Year: 1995
• Where: ICS
• Authors: Peng Tu, David A. Padua
• Keywords: Backward Substitution Scheme, Distributed And Parallel Computing, Gating Predicate Information, ICS 1995, Precise Symbolic Analysis