Issue No. 05 - September (1992 vol. 3)
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/71.159042
A data dependence decision algorithm called the power test is introduced. The powertest is a combination of the extended GCD algorithm and the Fourier-Motzkin method to eliminate variables in a system of inequalities. This is the first test that can generate the information needed for some advanced transformations, and that can handle complex simultaneous loop limits. Previous work in data dependence decision algorithms is reviewed. Some examples which motivated the development of this test are examined, including those which demonstrate the additional power of the power test. Although it may be too expensive for use as a general-purpose dependence test in a compiler, the power test has proved useful in an interactive program restructuring environment.
Index Termsvariable elimination; power test; data dependence decision algorithm; extended GCDalgorithm; Fourier-Motzkin method; inequalities; simultaneous loop limits; compiler;interactive program restructuring environment; parallel algorithms; parallel programming; program compilers; programming theory
M. Wolfe and C. Tseng, "The Power Test for Data Dependence," in IEEE Transactions on Parallel & Distributed Systems, vol. 3, no. , pp. 591-601, 1992.