Array-access analysis: Difference between revisions

Revision as of 22:30, 25 May 2022

Latest revision as of 00:55, 15 April 2024

(One intermediate revision by one other user not shown)

Line 1:

{{one source |date=April 2024}}

In [[computer science]], '''array-access analysis''' is a [[compiler analysis]] approach used to decide the read and write access patterns to elements or portions of arrays.<ref name="Paek2002">{{cite journal |last1=Paek |first1=Yunheung |last2=Hoeflinger |first2=Jay |last3=Padua |first3=David |title=Efficient and precise array access analysis |journal=ACM Transactions on Programming Languages and Systems |date=January 2002 |volume=24 |issue=1 |pages=65–109 |doi=10.1145/509705.509708|doi-access=free }}</ref>

The major data type manipulated in scientific programs is the array. The define/use analysis on a whole array is insufficient for aggressive [[compiler optimization]]s such as [[Automatic parallelization|auto parallelization]] and array [[Privatization (computer programming)|privatization]]. Array access analysis aims to obtain the knowledge of which portions or even which elements of the array are accessed by a given code segment ([[basic block]], [[Control flow#Loops|loop]], or even at the [[Subroutine|procedure]] level).

Line 11 ⟶ 12:

{{Compiler optimizations}}

{{prog-lang-stub}}

[[Category:Compiler construction]]

[[Category:Static program analysis]]

{{prog-lang-stub}}