EUVIMEDEUVIMED entdecken
Crossref

Efficient and precise array access analysis

Yunheung Paek, Jay Hoeflinger, David Padua

ACM Transactions on Programming Languages and Systems · 2002-01 · 24 (1) · 65-109

DOI: 10.1145/509705.509708 ↗

Kurz gefasst

Fachartikel in der Zeitschrift ACM Transactions on Programming Languages and Systems, 2002-01. Verfasst von Yunheung Paek und 2 weiteren Autor:innen. Die Arbeit wurde bisher 63-mal zitiert (Crossref) und nennt 31 Literaturangaben.

AbstractBibliografische AngabenZitierenVerwandte Studien

Abstract (Originalsprache)

A number of existing compiler techniques hinge on the analysis of array accesses in a program. The most important task in array access analysis is to collect the information about array accesses of interest and summarize it in some standard form. Traditional forms used in array access analysis are sensitive to the complexity of array subscripts; that is, they are usually quite accurate and efficient for simple array subscripting expressions, but lose accuracy or require potentially expensive algorithms for complex subscripts. Our study has revealed that in many programs, particularly numerical applications, many access patterns are simple in nature even when the subscripting expressions are complex. Based on this analysis, we have developed a new, general array region representational form, called the linear memory access descriptor (LMAD). The key idea of the LMAD is to relate all memory accesses to the linear machine memory rather than to the shape of the logical data structures of a programming language. This form helps us expose the simplicity of the actual patterns of array accesses in memory, which may be hidden by complex array subscript expressions. Our recent experimental studies show that our new representation simplifies array access analysis and, thus, enables efficient and accurate compiler analysis.

Zitieren

APA

Paek, Y., Hoeflinger, J., & Padua, D. (2002). Efficient and precise array access analysis. ACM Transactions on Programming Languages and Systems, 24(1), 65-109. https://doi.org/10.1145/509705.509708

Vancouver

Paek Y, Hoeflinger J, Padua D. Efficient and precise array access analysis. ACM Transactions on Programming Languages and Systems. 2002;24(1):65-109. doi:10.1145/509705.509708

BibTeX
@article{Paek2002,
  author = {Paek, Yunheung and Hoeflinger, Jay and Padua, David},
  title = {Efficient and precise array access analysis},
  journal = {ACM Transactions on Programming Languages and Systems},
  year = {2002},
  volume = {24},
  number = {1},
  pages = {65--109},
  doi = {10.1145/509705.509708}
}
Kostenlos starten →