Simplification of array access patterns for compiler optimizations

Yunheung Paek, Jay Hoeflinger, David Padua

Research output: Contribution to conferencePaperpeer-review

Abstract

Existing array region representation techniques are sensitive to the complexity of array subscripts. In general, these techniques are very accurate and efficient for simple subscript expressions, but lose accuracy or require potentially expensive algorithms for complex subscripts. We found that in scientific applications, many access patterns are simple even when the subscript expressions are complex. In this work, we present a new, general array access representation and define operations for it. This allows us to aggregate and simplify the representation enough that precise region operations may be applied to enable compiler optimizations. Our experiments show that these techniques hold promise for speeding up applications.

Original languageEnglish (US)
Pages60-71
Number of pages12
StatePublished - Jan 1 1998
Externally publishedYes
EventProceedings of the 1998 Annual ACM SIGPLAN Conference on Programming Language Design and Implementation, PLDI - Montreal, Can
Duration: Jun 17 1998Jun 19 1998

Other

OtherProceedings of the 1998 Annual ACM SIGPLAN Conference on Programming Language Design and Implementation, PLDI
CityMontreal, Can
Period6/17/986/19/98

ASJC Scopus subject areas

  • Software

Fingerprint

Dive into the research topics of 'Simplification of array access patterns for compiler optimizations'. Together they form a unique fingerprint.

Cite this