Gated SSA-based demand-driven symbolic analysis for parallelizing compilers

Peng Tu, David Padua

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Abstract

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.

Original languageEnglish (US)
Title of host publicationProceedings of the 9th International Conference on Supercomputing, ICS 1995
PublisherAssociation for Computing Machinery
Pages414-423
Number of pages10
ISBN (Electronic)0897917286
DOIs
StatePublished - Jul 3 1995
Event9th International Conference on Supercomputing, ICS 1995 - Barcelona, Spain
Duration: Jul 3 1995Jul 7 1995

Publication series

NameProceedings of the International Conference on Supercomputing
VolumePart F129361

Other

Other9th International Conference on Supercomputing, ICS 1995
CountrySpain
CityBarcelona
Period7/3/957/7/95

ASJC Scopus subject areas

  • Computer Science(all)

Fingerprint Dive into the research topics of 'Gated SSA-based demand-driven symbolic analysis for parallelizing compilers'. Together they form a unique fingerprint.

Cite this