Array Data Dependence Testing with the Chains of Recurrences Algebra

Authors:
Robert A. van Engelen;Johnnie Birch;Kyle A. Gallivan
Affiliations:
Florida State University;Florida State University;Florida State University
Venue:
IWIA '04 Proceedings of the Innovative Architecture for Future Generation High-Performance Processors and Systems
Year:
2004

Citing 0
Cited 4

An empirical evaluation of chains of recurrences for array dependence testing

Proceedings of the 15th international conference on Parallel architectures and compilation techniques
Toward efficient flow-sensitive induction variable analysis and dependence testing for loop optimization

Proceedings of the 44th annual Southeast regional conference
ABC: algebraic bound computation for loops

LPAR'10 Proceedings of the 16th international conference on Logic for programming, artificial intelligence, and reasoning
Computer-Aided Recoding to Create Structured and Analyzable System Models

ACM Transactions on Embedded Computing Systems (TECS)

Quantified Score

Hi-index	0.00

Visualization

Abstract

This paper presents a new approach to dependence testing in the presence of nonlinear and non-closed array index expressions and pointer references. The chains of recurrences formalism and algebra is used to analyze the recurrence relations of induction variables, and for constructing recurrence forms of array index expressions and pointer references. We use these recurrence forms to determine if the array and pointer references are free of dependences in a loop nest. Our recurrence formulation enhances the accuracy of standard dependence algorithms such as the extreme value test and range test. Because the recurrence forms are easily converted to closed forms (when they exist), induction variable substitution and array recovery can be delayed until after the loop is analyzed.