Content deleted Content added
m Comp.arch moved page Array access analysis to Array-access analysis |
No edit summary |
||
Line 1:
In [[computer science]], '''array
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 5:
Array access analysis can be largely categorized into exact (or reference-list-based) and summary methods for different tradeoffs of accuracy and complexity. Exact methods are precise but very costly in terms of computation and space storage, while summary methods are approximate but can be computed quickly and economically.
Typical exact array access analysis include linearization and [[atom images]]. Summary methods can be further divided into [[array sections]], bounded regular sections using [[triplet notation]], linear-constraint methods such as data access descriptors and [[array
==References==
|