The Community for Technology Leaders
RSS Icon
Subscribe
Issue No.01 - January (1990 vol.1)
pp: 26-34
ABSTRACT
<p>A novel algorithm, called the lambda test, is presented for an efficient and accurate data dependence analysis of multidimensional array references. It extends the numerical methods to allow all dimensions of array references to be tested simultaneously. Hence, it combines the efficiency and the accuracy of both approaches. This algorithm has been implemented in Parafrase, a Fortran program parallelization restructurer developed at the University of Illinois at Urbana-Champaign. Some experimental results are presented to show its effectiveness.</p>
INDEX TERMS
Index Termsprogram restructuring; array subscripts; convex set; hyperplanes; loop bounds; linear inequalities; data dependence analysis; parallelizing compilers; lambda test; multidimensional array references; numerical methods; Parafrase; Fortran program parallelization restructurer; FORTRAN; parallel programming; program compilers
CITATION
Z. Li, P.C. Yew, C.Q. Zhu, "An Efficient Data Dependence Analysis for Parallelizing Compilers", IEEE Transactions on Parallel & Distributed Systems, vol.1, no. 1, pp. 26-34, January 1990, doi:10.1109/71.80122
19 ms
(Ver 2.0)

Marketing Automation Platform Marketing Automation Tool