J. R. Allen and K. K. , , 1982.

J. R. Allen and K. Kennedy, Automatic translation of Fortran programs to vector form, ACM Transactions on Programming Languages and Systems, vol.9, issue.4, pp.491-542, 1987.

E. Ayguad-e, J. Garcia, M. Giron-es, M. L. Grande, and J. Labarta, DDT: A research tool for automatic data distribution in HPF, Scientiic Programming, vol.6, issue.1, pp.73-94, 1997.

E. Ayguad-e, J. Garcia, M. Giron-esa, J. Labarta, J. Torres et al., Detecting and using aanity in an automatic data distribution tool, Languages and Compilers for Parallel Computing, pp.61-75, 1995.

E. Ayguad-e, J. Garcia, and U. Kremer, Tools and techniques for automatic data layout: a case study, Parallel Computing, vol.24, pp.557-578, 1998.

R. Michael, D. S. Garey, and . Johnson, Computers and Intractability, a Guide to the Theory of NP-Completeness, 1991.

M. Gupta and P. Banerjee, Demonstration of automatic data partitioning techniques for parallelizing compilers on multicomputers, IEEE Transactions on Parallel and Distributed Systems, vol.3, issue.2, pp.179-193, 1992.

M. R. Haghighat, Symbolic Analysis for Parallelizing Compilers, 1995.

W. Kelly and W. Pugh, Minimizing communication while preserving parallelism, Proceedings of the 10th ACM International Conference on Supercomputing, 1996.

H. Charles, D. B. Koelbel, R. S. Loveman, G. L. Schreiber, M. E. Steele et al., The High Performance F ortran Handbook, 1994.

P. Lee, EEcient algorithms for data distribution on distributed memory parallel computers, IEEE Transactions on Parallel and Distributed Systems, vol.8, issue.8, pp.825-839

J. Li and M. Chen, Compiling communication-eecient programs for massively parallel machines, IEEE Transactions on Parallel and Distributed Systems, vol.2, issue.3, pp.361-375, 1991.

J. Li and M. Chen, Index domain alignment: Minimizing cost of cross-referencing between distributed arrays, Frontiers 90: The 3rd Symposium on the Frontiers of Massively Parallel Computation, pp.424-433, 1990.

J. Li and M. Chen, The data alignment phase in compiling programs for distributedmemory machines, Journal of Parallel and Distributed Computing, vol.13, pp.213-221, 1991.

K. S. Mckinley, Automatic and Interactive Parallelization, pp.1-9

W. Pugh, Counting solutions to Pressburger formulas: how and why. I n ACM SIGPLANConference o n P r ogramming Language, Design and Implementation, 1994.

S. Tandri and T. S. Abdelrahman, Automatic data and computation partitioning on scalable shared memory multiprocessors, 3rd Workshop on Automatic Data Layout and Performance Prediction, 1997.

M. Wolfe, The Tiny loop restructuring research tool, International Conference on Parallel Processing, vol.II, pp.46-53, 1991.

M. Wolfe, High Performance Compilers For Parallel Computing, pp.1-9