This article relies largely or entirely on a single source. Relevant discussion may be found on the talk page. Please help improve this article by introducing citations to additional sources. Find sources: "Array-access analysis" – news · newspapers · books · scholar · JSTOR(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.[1]
The major data type manipulated in scientific programs is the array. The define/use analysis on a whole array is insufficient for aggressive compiler optimizations 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).
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-region analysis.
Referencesedit
^Paek, Yunheung; Hoeflinger, Jay; Padua, David (January 2002). "Efficient and precise array access analysis". ACM Transactions on Programming Languages and Systems. 24 (1): 65–109. doi:10.1145/509705.509708.
array, access, analysis, this, article, relies, largely, entirely, single, source, relevant, discussion, found, talk, page, please, help, improve, this, article, introducing, citations, additional, sources, find, sources, news, newspapers, books, scholar, jsto. This article relies largely or entirely on a single source Relevant discussion may be found on the talk page Please help improve this article by introducing citations to additional sources Find sources Array access analysis news newspapers books scholar JSTOR 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 1 The major data type manipulated in scientific programs is the array The define use analysis on a whole array is insufficient for aggressive compiler optimizations 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 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 region analysis References edit Paek Yunheung Hoeflinger Jay Padua David January 2002 Efficient and precise array access analysis ACM Transactions on Programming Languages and Systems 24 1 65 109 doi 10 1145 509705 509708 nbsp This programming language related article is a stub You can help Wikipedia by expanding it vte Retrieved from https en wikipedia org w index php title Array access analysis amp oldid 1218977859, wikipedia, wiki, book, books, library,
