A general algorithm for data dependence analysis

With the development of ever more sophisticated data flow analysis algorithms, traditional data dependence tests based on elementary loop information will not be sufficient in the future. In this paper, quite general algorithms are presented for solving integer linear programming problems. While the properly so called problem solution is performed by a standard algorithm (the dual all integer algorithm), preliminary problem reduction techniques not only serve as a powerful tool for preparing this latter step, but also are often sufficient for solving exactly the data dependence problem.

[1]  David R. Wallace,et al.  Dependence of multi-dimensional array references , 1988, ICS '88.

[2]  Utpal Banerjee,et al.  Dependence analysis for supercomputing , 1988, The Kluwer international series in engineering and computer science.

[3]  George B. Dantzig,et al.  Linear programming and extensions , 1965 .

[4]  J. Sogno.  Analysis of standard and new algorithms for the integer ans linear constraint satisfaction problem , 1991 .

[5]  Ken Kennedy,et al.  Practical dependence testing , 1991, PLDI '91.

[6]  Nicolas Halbwachs,et al.  Automatic discovery of linear restraints among variables of a program , 1978, POPL.

[7]  Kleanthis Psarris,et al.  The I Test: An Improved Dependence Test for Automatic Parallelization and Vectorization , 1991, IEEE Trans. Parallel Distributed Syst..

[8]  Utpal Banerjee,et al.  Speedup of ordinary programs , 1979 .

[9]  Hendrik W. Lenstra,et al.  Integer Programming with a Fixed Number of Variables , 1983, Math. Oper. Res..

[10]  Laurence A. Wolsey,et al.  Integer and Combinatorial Optimization , 1988 .

[11]  Alain Lichnewsky,et al.  Introducing symbolic problem solving techniques in the dependence testing phases of a vectorizer , 1988, ICS '88.

[12]  Kleanthis Psarris,et al.  On the perfect accuracy of an approximate subscript analysis test , 1990, ICS '90.

[13]  Monica S. Lam,et al.  Efficient and exact data dependence analysis , 1991, PLDI '91.

[14]  Donald E. Knuth,et al.  The art of computer programming. Vol.2: Seminumerical algorithms , 1981 .

[15]  Donald Ervin Knuth,et al.  The Art of Computer Programming , 1968 .

[16]  Geoffrey C. Fox,et al.  The Perfect Club Benchmarks: Effective Performance Evaluation of Supercomputers , 1989, Int. J. High Perform. Comput. Appl..

[17]  Patrick Cousot,et al.  Abstract interpretation: a unified lattice model for static analysis of programs by construction or approximation of fixpoints , 1977, POPL.