Array-access analysis: Difference between revisions

Revision as of 00:10, 5 September 2006

Revision as of 03:22, 2 May 2007

Line 1:

{{expert}}

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.

In [[computer science]], '''Arrayarray 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]], [[loop]], or even at the [[procedure]] level).

Line 7 ⟶ 9:

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 region analysis]].

[[Category:compilersCompiler theory]]