This Article 
 Bibliographic References 
 Add to: 
The Direction Vector I Test
November 1993 (vol. 4 no. 11)
pp. 1280-1290

The GCD and Banerjee tests are the standard data dependence tests used to determinewhether a loop may be parallelized/vectorized. In an earlier work, (1991) the authorspresented a new data dependence test, the I test, which extends the accuracy of theGCD and the Banerjee tests. In the original presentation, only the case of generaldependence was considered, i.e., the case of dependence with a direction vector of theform (*,*,...,*). In the present work, the authors generalize the I test to check for datadependence subject to an arbitrary direction vector.

[1] F. E. Allen, M. Burke, P. Charles, R. Cytron, and J. Ferrante, "An overview of the PTRAN analysis system for multiprocessing," inProc. First Int. Conf. Supercomput., June 1987, pp. 194-211.
[2] J. R. Allen, "Dependence analysis for subscripted variables and its application to program transformations," Ph.D. dissertation, Dept. Math. Sci., Rice Univ., May 1983.
[3] R. Allen and K. Kennedy, "Automatic translation of FORTRAN to vector form,"ACM Trans. Programming Languages Syst., vol. 9, no. 4, pp. 491-524, 1987.
[4] U. Banerjee, "Data dependence in ordinary programs," M.S. thesis, Univ. Illinois, Urbana-Champaign, Nov. 1976.
[5] U. Banerjee, "Speedup of ordinary programs," Ph.D dissertation, Dep. Comput. Sci. Univ. Illinois, Urbana-Champaign, Rep. No. UIUCDCS-R-79-989, 1979.
[6] U. Banerjee,Dependence Analysis for Supercomputing, Kluwer Academic Publishers, Norwell, Mass., 1988.
[7] M. Burke and R. Cytron, "Interprocedural dependence analysis and parallelization," inProc. SIG-PLAN '86 Symp. Comp. Construct., Palo Alto, CA, June 1986, pp. 162-175.
[8] L. Lamport, "The parallel execution of DO loops,"Commun. ACM, vol. 17, no. 2, pp. 83-93, Feb. 1974.
[9] Z. Shen, Z. Li, and P. Yew, "An empirical study on array subscripts and data dependences," inProc. 1989 Int. Conf. Parallel Processing, Aug. 1989.
[10] R. A. Towle, "Control and data dependence for program transformations," Ph.D. dissertation, Univ. of Illinois at Urbana-Champaign, 1976.
[11] M. J. Wolfe, "Optimizing supercompilers for supercomputers," Ph.D. thesis, Ctr. Supercomput. Res. and Development, Univ. Illinois, Urbana-Champaign, 1980.
[12] M. Wolfe,Optimizing Supercompilers for Supercomputers. Cambridge MA: MIT Press, 1989.
[13] M. Wolfe and U. Banerjee, "Data Dependence and Its Application to Parallel Processing,"Int'l J. Parallel Programming, Vol. 16, No. 2, Apr. 1987, pp. 137-178.
[14] X. Kong, D. Klappholz, and K. Psarris, "The I test: An improved dependence test for automatic parallelization and vectorization,"IEEE Trans. Parallel Distirbuted Computing, July 1991.
[15] K. Psarris, D. Klappholz, and X. Kong, "On the accuracy of the Banerjee test,"J. Parallel Distributed Computing, June 1991.

Index Terms:
Index Termsdirection vector I test; data dependence tests; Banerjee test; arbitrary direction vector;parallelization; GCD test; parallelism detection; algorithm theory; parallel programming
K. Psarris, X. Kong, D. Klappholz, "The Direction Vector I Test," IEEE Transactions on Parallel and Distributed Systems, vol. 4, no. 11, pp. 1280-1290, Nov. 1993, doi:10.1109/71.250105
Usage of this product signifies your acceptance of the Terms of Use.