Simplification of array access patterns for compiler optimizations

Yunheung Paek, Jay Hoeflinger, David Padua

Research output: Contribution to conferencePaper

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

Fingerprint

Experiments

ASJC Scopus subject areas

  • Software

Cite this

Paek, Y., Hoeflinger, J., & Padua, D. (1998). Simplification of array access patterns for compiler optimizations. 60-71. Paper presented at Proceedings of the 1998 Annual ACM SIGPLAN Conference on Programming Language Design and Implementation, PLDI, Montreal, Can, .

Simplification of array access patterns for compiler optimizations. / Paek, Yunheung; Hoeflinger, Jay; Padua, David.

1998. 60-71 Paper presented at Proceedings of the 1998 Annual ACM SIGPLAN Conference on Programming Language Design and Implementation, PLDI, Montreal, Can, .

Research output: Contribution to conferencePaper

Paek, Y, Hoeflinger, J & Padua, D 1998, 'Simplification of array access patterns for compiler optimizations', Paper presented at Proceedings of the 1998 Annual ACM SIGPLAN Conference on Programming Language Design and Implementation, PLDI, Montreal, Can, 6/17/98 - 6/19/98 pp. 60-71.
Paek Y, Hoeflinger J, Padua D. Simplification of array access patterns for compiler optimizations. 1998. Paper presented at Proceedings of the 1998 Annual ACM SIGPLAN Conference on Programming Language Design and Implementation, PLDI, Montreal, Can, .
Paek, Yunheung ; Hoeflinger, Jay ; Padua, David. / Simplification of array access patterns for compiler optimizations. Paper presented at Proceedings of the 1998 Annual ACM SIGPLAN Conference on Programming Language Design and Implementation, PLDI, Montreal, Can, .12 p.
@conference{df581819ce1e43728f0f39e50dedd1a1,
title = "Simplification of array access patterns for compiler optimizations",
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.",
author = "Yunheung Paek and Jay Hoeflinger and David Padua",
year = "1998",
month = "1",
day = "1",
language = "English (US)",
pages = "60--71",
note = "Proceedings of the 1998 Annual ACM SIGPLAN Conference on Programming Language Design and Implementation, PLDI ; Conference date: 17-06-1998 Through 19-06-1998",

}

TY - CONF

T1 - Simplification of array access patterns for compiler optimizations

AU - Paek, Yunheung

AU - Hoeflinger, Jay

AU - Padua, David

PY - 1998/1/1

Y1 - 1998/1/1

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

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

UR - http://www.scopus.com/inward/record.url?scp=0031638346&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=0031638346&partnerID=8YFLogxK

M3 - Paper

AN - SCOPUS:0031638346

SP - 60

EP - 71

ER -