TY - GEN
T1 - Gated SSA-based demand-driven symbolic analysis for parallelizing compilers
AU - Tu, Peng
AU - Padua, David
N1 - Publisher Copyright:
© 1995 ACM.
PY - 1995/7/3
Y1 - 1995/7/3
N2 - In this paper, we present a GSA-based technique that performs more efficient and more precise symbolic analysis of predicated assignments, recurrences and index arrays. The efficiency 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 flow graph. Examples from array privatization are used to illustrate how the technique aids loop parallelization.
AB - In this paper, we present a GSA-based technique that performs more efficient and more precise symbolic analysis of predicated assignments, recurrences and index arrays. The efficiency 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 flow graph. Examples from array privatization are used to illustrate how the technique aids loop parallelization.
UR - http://www.scopus.com/inward/record.url?scp=0029190370&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=0029190370&partnerID=8YFLogxK
U2 - 10.1145/224538.224648
DO - 10.1145/224538.224648
M3 - Conference contribution
AN - SCOPUS:0029190370
T3 - Proceedings of the International Conference on Supercomputing
SP - 414
EP - 423
BT - Proceedings of the 9th International Conference on Supercomputing, ICS 1995
PB - Association for Computing Machinery
T2 - 9th International Conference on Supercomputing, ICS 1995
Y2 - 3 July 1995 through 7 July 1995
ER -