Content deleted Content added
m Robot - Moving category Compiler theory to Compiler construction per CFD at Wikipedia:Categories for discussion/Log/2011 January 31. |
m Fix links to disambiguation page Procedure |
||
Line 1:
{{
{{Expert-subject|Computer science|date=February 2009}}
In [[computer science]], '''array access analysis''' is a [[compiler analysis]] used to decide the read and write access patterns to elements or portions of arrays.
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 [[auto parallelization]] and [[array 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).
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.
| |||