The range test: a dependence test for symbolic, non-linear expressions

Most current data dependence tests cannot handle loop bounds or array subscripts that are symbolic, nonlinear expressions e.g. Ani+j, where 0 j n. In this paper, we describe a dependence test, called the range test, that can handle such expressions. Brie y, the range test proves independence by determining whether certain symbolic inequalities hold for a permutation of the loop nest. Powerful symbolic analysesand constraintpropagationtechniques were developed to prove such inequalities. The range test has been implemented in Polaris, a parallelizing compiler being developed at the University of Illinois.

• Type: Conference
• Year: 1994
• Where: SC
• Authors: William Blume, Rudolf Eigenmann
• Keywords: Applied Computing, Dependence Test, Handle Loop Bounds, Range Test, SC 1994