Abstract—One-dimensional arrays with subscripts formed by induction variables in real programs appear quite frequently. For most famous data dependence testing methods, checking if integer-valued solutions exist for one-dimensional arrays with references created by induction variable is very difficult. The I test, which is a refined combination of the GCD and Banerjee tests, is an efficient and precise data dependence testing technique to compute if integer-valued solutions exist for one-dimensional arrays with constant bounds and single increments. In this paper, the non-continuous I test, which is an extension of the I test, is proposed to figure out whether there are integer-valued solutions for one-dimensional arrays with constant bound...
Standard array data dependence testing algorithms give information about the alias-ing of array refe...
Data dependence testing is the basic step in detecting loop level parallelism in numerical programs....
Most current data dependence tests cannot handle loop bounds or array subscripts that are symbolic, ...
A simple run-time data dependence test is presented which is based on a new formulation of the depen...
Many dependence tests have been proposed for loop parallelization in the case of arrays with linear ...
We present a new approach to dependence testing in the presence of induction variables. Instead of l...
International audienceWe present a new approach to dependence testing in the presence of induction v...
International audienceTraditional induction variable (IV) analyses focus on computing the closed for...
The Omega test is an integer programming algorithm that can determine whether a dependence exists be...
Data Dependence Analysis is the foundation of any parallelizing compiler. The GCD test and the Baner...
International audienceWe present a new approach to dependence testing inthe presence of induction va...
Code restructuring compilers rely heavily on program analysis tech-niques to automatically detect da...
A parallelizing compiler relies on data dependence analysis to detect independent operations in a us...
Exact side effects of array references in subroutines are essential for exact interprocedural depend...
Abstract- Wepresent a dependence testing algorithm that considers the short width of modern SIMD reg...
Standard array data dependence testing algorithms give information about the alias-ing of array refe...
Data dependence testing is the basic step in detecting loop level parallelism in numerical programs....
Most current data dependence tests cannot handle loop bounds or array subscripts that are symbolic, ...
A simple run-time data dependence test is presented which is based on a new formulation of the depen...
Many dependence tests have been proposed for loop parallelization in the case of arrays with linear ...
We present a new approach to dependence testing in the presence of induction variables. Instead of l...
International audienceWe present a new approach to dependence testing in the presence of induction v...
International audienceTraditional induction variable (IV) analyses focus on computing the closed for...
The Omega test is an integer programming algorithm that can determine whether a dependence exists be...
Data Dependence Analysis is the foundation of any parallelizing compiler. The GCD test and the Baner...
International audienceWe present a new approach to dependence testing inthe presence of induction va...
Code restructuring compilers rely heavily on program analysis tech-niques to automatically detect da...
A parallelizing compiler relies on data dependence analysis to detect independent operations in a us...
Exact side effects of array references in subroutines are essential for exact interprocedural depend...
Abstract- Wepresent a dependence testing algorithm that considers the short width of modern SIMD reg...
Standard array data dependence testing algorithms give information about the alias-ing of array refe...
Data dependence testing is the basic step in detecting loop level parallelism in numerical programs....
Most current data dependence tests cannot handle loop bounds or array subscripts that are symbolic, ...