Umfassende Service-Einschränkungen im Bereich Ausleihe ab 17. März!

Treffer: Optimizing Aggregate Array Computations in Loops.

Title:
Optimizing Aggregate Array Computations in Loops.
Authors:
Liu, Yanhong A.1 liu@cs.sunysb.edu, Stoller, Scott D.1 stoller@cs.sunysb.edu, Ning Li2 ningli@us.ibm.com, Rothamel, Tom1 tom@rothamel.org
Source:
ACM Transactions on Programming Languages & Systems. Jan2005, Vol. 27 Issue 1, p91-125. 35p.
Database:
Business Source Premier

Weitere Informationen

An aggregate array computation is a loop that computes accumulated quantities over array elements. Such computations are common in programs that use arrays, and the array elements involved in such computations often overlap, especially across iterations of loops, resulting in significant redundancy in the overall computations. This article presents a method and algorithms that eliminate such overlapping aggregate array redundancies and shows analytical and experimental performance improvements. The method is based on incrementalization, that is, updating the values of aggregate array computations from iteration to iteration rather than computing them from scratch in each iteration. This involves maintaining additional values not maintained in the original program. We reduce various analysis problems to solving inequality constraints on loop variables and array subscripts, and we apply results from work on array data dependence analysis. For aggregate array computations that have significant redundancy, incrementalization produces drastic speedup compared to previous optimizations; when there is little redundancy, the benefit might be offset by cache effects and other factors. Previous methods for loop optimizations of arrays do not perform incrementalization, and previous techniques for loop incrementalization do not handle arrays. [ABSTRACT FROM AUTHOR]

Copyright of ACM Transactions on Programming Languages & Systems is the property of Association for Computing Machinery and its content may not be copied or emailed to multiple sites without the copyright holder's express written permission. Additionally, content may not be used with any artificial intelligence tools or machine learning technologies. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.)