Array-access analysis: Difference between revisions

Revision as of 03:15, 18 February 2006

Revision as of 21:25, 26 February 2006

Line 1:

In [[computer science]], array'''Array access analysis''' is one of [[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 obviously array. The define/use analysis on a whole array is insufficent to aggressive [[compiler optimization]]s like [[auto parallelization]] and [[array privatization]]. Array access analyis aims to get the knowledge of which portion or even elements of the array is accessed by a certain code segment([[basic block]],[[loop]]s, or even [[procedure]] level).

Line 5:

Array access analysis can be largely categoried into exact (or reference-list-based) and summary methods for the different tradeoff 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 done fast and economically.

Typical exact array access analyis are: linearization and [[atom images]]. Summary methods can be futherfurther divided into [[array sections]], bounded regular sections using [[triplet notation]], linear-constraint methods such as data access descriptors and [[array region analysis]].

[[categoryCategory:compiler]]