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, p.4911542, 1987.

C. Ancourt and F. Irigoin, Scanning polyhedra with DO loops, Proc. of the 3rd A CM SIGPLAN Symposium on Principles and Practice o f P a r allel Programming, p.39950, 1991.
URL : https://hal.archives-ouvertes.fr/hal-00752774

D. F. Bacon, S. L. Graham, and O. J. Sharp, Compiler transformations for high-performance computing, ACM Computing Surveys, vol.26, issue.4, 1994.

A. J. Bernstein, Analysis of programs for parallel processing, IEEE Transactions on Electronic Computers, vol.15, p.7577762, 1966.

P. Boulet and M. Dion, Code generation in Bouclettes, Proceedings of the Fifth Euromicro Workshop on Parallel and Distributed P r ocessing, p.2733280, 1997.
URL : https://hal.archives-ouvertes.fr/inria-00565001

T. Brandes, ADAPTOR Programmer's Guide -Version 4.0. German National Research Institute for Computer Science, 1996.

D. Callahan, A G l o b al Approach to Detec t i o n o f P a r allelism, vol.8, p.7

Z. Chamski, Environnement logiciel de programmation d'un accllrateur de calcul paralllle, 1993.

J. Collard, Code generation in automatic parallelizers, Proc. Int. Conf. on Application in Parallel and Distributed Computing, vol.10, p.1855194, 1994.

J. Collard, P. Feautrier, and T. Risset, Construction of DO loops from systems of aane constraints, Parallel Processing Letters, vol.5, issue.3, p.4211436, 1995.

A. Darte, L. Khachiyan, and Y. Robert, Linear scheduling is nearly optimal, Parallel Processing Letters, vol.1, issue.2, p.73381, 1991.
URL : https://hal.archives-ouvertes.fr/hal-00857050

A. Darte, G. Silber, and F. Vivien, Combining retiming and scheduling techniques for loop parallelization and loop tiling. Parallel Processing Letters, 1997.
URL : https://hal.archives-ouvertes.fr/hal-02102115

A. Darte and F. Vivien, Optimal ne and medium grain parallelism detection in polyhedral reduced dependence graphs, Proceedings of PACT'96, 1996.

A. Darte and F. Vivien, A comparison of nested loops parallelization algorithms. Parallel Processing Letters, 1997.
URL : https://hal.archives-ouvertes.fr/hal-02102085

A. Darte and F. Vivien, On the optimality of Allen and Kennedy's algorithm for parallelism extraction in nested loops, Journal of Parallel Algorithms and Applications, 96. Special issue on Optimizing Compilers for Parallel Languages

P. Feautrier, Parametric integer programming, RAIRO R echerche Oprationnelle, vol.22, p.2433268, 1988.

P. Feautrier, Dataaow analysis of array and scalar references, Int. J. Parallel Programming, vol.20, issue.1, p.23351, 1991.

P. Feautrier, Some eecient solutions to the aane scheduling problem, part I: onedimensional time, Int. J. Parallel Programming, vol.21, issue.5, p.3133348, 1992.

P. Feautrier, Some eecient solutions to the aane scheduling problem, part II: multidimensional time, Int. J. Parallel Programming, vol.21, issue.6, p.3899420, 1992.

, High Performance Fortran Forum. High Performance Fortran Language Speciication, 1997.

J. Marc-le-fur, F. Pazat, and . Andrr, Commutative loop nest distribution, Proc. of the Fourth Int. Workshop on Compilers for Parallel Computers, p.3455350, 1993.

A. Gerasoulis and T. Yang, On the granularity and clustering of directed acyclic task graphs, IEEE Trans. Parallel and Distributed Systems, vol.4, issue.6, p.6866701, 1993.

, The loopo project. World Wide Web document

F. Irigoin, P. Jouvelot, and . Riolet, Semantical interprocedural parallelization: an overview of the PIPS project, Proceedings of the 1991 ACM International Conference o n S u p ercomputing, 1991.
URL : https://hal.archives-ouvertes.fr/hal-00984684

F. Irigoin, T. Rrmy, and . Riolet, Computing dependence direction vectors and dependence cones with linear systems, 1987.

W. Kelly, W. Pugh, and E. Rosser, Code generation for multiple mappings, The 5th Symposium on Frontiers of Massively Parallel Computation, p.3322341, 1995.

L. Lamport, The parallel execution of DO loops, Communications of the ACM, vol.17, issue.2, p.83393, 1974.

W. Li and K. Pingali, A singular loop transformation framework based on nonsingular matrices, 5th Workshop on Languages and Compilers for Parallel Computing, p.2499260, 1992.

A. W. Lim and M. S. Lam, Maximizing parallelism and minimizing synchronization with ane transforms, Proceedings of the 24th Annual ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, 1997.

K. S. Mckinley and K. Kennedy, Maximizing loop parallelism and improving data locality via loop fusion and distribution, The Sixth Annual Languages and Compiler for Parallelism Workshop, n umber 768 in Lecture Notes in Computer Science, p.3011320, 1993.

C. Picouleau, Two new NP-complete scheduling problems with communication delays and unlimited number of processors, IBP, 1991.

W. Pugh, A practical algorithm for exact array dependence analysis, Communications of the ACM, vol.8, p.27747, 1992.

W. Pugh, O. The, and . Team, World Wide Web document

A. Schrijver, Theory of Linear and Integer Programming, 1986.

M. E. Wolf and M. S. Lam, A loop transformation theory and an algorithm to maximize parallelism, IEEE Trans. Parallel Distributed Systems, vol.2, issue.4, p.4522471, 1991.

M. Wolfe, Optimizing Supercompilers for Supercomputers, 1989.

M. Wolfe, High Performance Compilers For Parallel Computing, 1996.

J. Xue, Automatic non-unimodular transformations of loop nests, Parallel Computing, vol.20, issue.5, p.7111728, 1994.

Y. Yang, C. Ancourt, and F. Irigoin, Minimal data dependence abstractions for loop transformations, International Journal of Parallel Programming, vol.23, issue.4, p.3599388, 1995.