Content deleted Content added
Mboverload (talk | contribs) RegExTypoFix Typos: insufficent → insufficient, using AWB |
tag as one source |
||
(32 intermediate revisions by 23 users 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 [[
Array
Typical exact array
==References==
{{reflist}}
{{Compiler optimizations}}
[[Category:Compiler construction]]
[[Category:Static program analysis]]
{{prog-lang-stub}}
|