P. Saman, M. S. Amarasinghe, and . Lam, Communication Optimization and Code Generation for Distributed Memory Machines, ACM SIGPLAN International Conference o n P r ogramming Language Design and Implementation, 1993.

C. Ancourt, G en eration automatique de codes de transfert pour multipro- cesseurs a m emoires locales, 1991.

C. Ancourt and . Frann-cois-irigoin, Scanning Polyhedra with DO Loops, Symposium on Principles and Practice o f P a r allel Programming, 1991.
DOI : 10.1145/109625.109631
URL : https://hal.archives-ouvertes.fr/hal-00752774

C. Ancourt and . Frann-cois-irigoin, Automatic code distribution, Third Workshop on Compilers for Parallel Computers, 1992.

O. Frann-coise-andr-e, J. Ch-eron, and . Pazat, Compiling sequential programs for distributed memory parallel computers with Pandore II, 1992.

M. L. Frann-coise-andr-e, Y. Fur, J. Mah, and . Pazat, Parallelization of a Wave Propagation Application using a Data Parallel Compiler, Publication interne, vol.868, 1994.

J. Frann-coise-andr-e, H. Pazat, and . Thomas, Pandore: A system to manage data distribution, Publication Interne, vol.519, 1990.

B. Eatrice-apvrille-creusillet, R egions exactes et privatisation de tableaux (exact array region analysis and array privatization) Master's thesis Available via http, 1994.

B. Eatrice-apvrille-creusillet, Calcul de r egions de tableaux exactes. TSI, Num ero sp ecial RenPar'6, 1995.

F. Balasa, F. H. Fransen, V. M. Francky, H. J. Catthoor, and . De-man, Transformation on nested loops with modulo indexing to aane recurrences . Parallel Processing Letters

V. Balasundaram and K. Kennedy, A technique for summarizing data access and its use in parallelism enhancing transformations, ACM SIGPLAN International Conference o n P r ogramming Language Design and Implementation, 1989.

P. Banerjee, J. A. Chandy, M. Gupta, E. W. Hodges, I. et al., An Overview of the PARADIGME Ccompiler for Distributed-Memory Multicomputers, IEEE Computer, issue.10, p.28, 1995.

S. Benkner, Handling Block-Cyclic Distributed Arrays in Vienna Fortran, 1994.

S. Benkner, P. Brezany, and H. Zima, Processing array statements and procedure interfaces in the PREPARE high performance fortran compiler, 5th International Conference on Compiler Construction, pp.324-338, 1994.
DOI : 10.1007/3-540-57877-3_22

J. A. Bircsak, M. R. Bolduc, J. A. Diewald, I. Gale, J. Harris et al., Compiling High Performance Fortran for Distributed-Memory Systems, Report, Digital Equipment Corp, 1995.

T. Brandes, EEcient Data-Parallel Programming without Explicit Message Passing for Distributed Memory Multiprocessors, 1992.

T. Brandes, Adaptor: A Compilation System for Data Parallel Fortran Programs, 1993.
DOI : 10.1007/978-3-322-87865-6_5

T. Brandes, Evaluation of high performance fortran on some real applications, High-Performance Computing and Networking, pp.417-422, 1994.
DOI : 10.1007/3-540-57981-8_153

D. Callahan and K. Kennedy, Analysis of interprocedural side effects in a parallel programming environment, Journal of Parallel and Distributed Computing, vol.5, issue.5, pp.517-550, 1988.
DOI : 10.1016/0743-7315(88)90011-1

D. Callahan and K. Kennedy, Compiling programs for distributed-memory multiprocessors, The Journal of Supercomputing, vol.29, issue.12, pp.151-169, 1988.
DOI : 10.1007/BF00128175

Z. Chamski, Fast and eecient generation of loop bounds, Research Report, vol.2095, 1993.

Z. Chamski, Nested loop sequences: towards efficient loop structures in automatic parallelization, Proceedings of the Twenty-Seventh Hawaii International Conference on System Sciences HICSS-94, pp.14-22, 1993.
DOI : 10.1109/HICSS.1994.323283
URL : https://hal.archives-ouvertes.fr/inria-00074578

S. Chatterjee, J. R. Gilbert, F. J. Long, R. Schreiber, and S. Teng, Generating Local Addresses and Communication Sets for Data-Parallel Programs, Also appeared in PPoPP'93, pp.72-84, 1995.
DOI : 10.1006/jpdc.1995.1049
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.7.3812

F. Coelho, Experiments with HPF compilation for a network of workstations, High-Performance Computing and Networking, pp.423-428, 1994.
DOI : 10.1007/3-540-57981-8_154

F. Coelho, Compilation of I/O communications for HPF, Proceedings Frontiers '95. The Fifth Symposium on the Frontiers of Massively Parallel Computation, pp.102-109, 1995.
DOI : 10.1109/FMPC.1995.380458

F. Coelho and C. Ancourt, Optimal Compilation of HPF Remappings, Journal of Parallel and Distributed Computing, vol.38, issue.2, 1995.
DOI : 10.1006/jpdc.1996.0143
URL : https://hal.archives-ouvertes.fr/hal-00752603

P. Jean-frann-cois-collard, T. Feautrier, and . Risset, Construction of DO loops from Systems of AAne Constraints, LIP RR93, vol.15, 1993.

B. and C. Frann-cois-irigoin, Interprocedural Array Region Analyses, Language and Compilers for Parallel Computing, 1995.

L. Dagum, L. Meadows, and D. Miles, Data Parallel Direct Simulation Monte Carlo in High Performance Fortran, Scientiic Programming, xx(xx):xx, 1995.

P. Feautrier, Parametric integer programming. RAIRO R echerche Op erationnelle, pp.243-268, 1988.
DOI : 10.1051/ro/1988220302431
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.30.9957

F. High-performance and . Forum, High Performance F ortran Language Speciication, Rice University, 1994.

F. Gasperoni, S. Uwe, and . Heiegelshohn, Scheduling loops on parallel processors: A simple algorithm with close to optimum performance, 1992.
DOI : 10.1007/3-540-55895-0_463

H. Michael and G. , Automatic Parallelization for Distributed-Memory Multiprocessing Systems, 1989.

H. Michael, G. , and H. P. Zima, Optimizing Communication in Superb, CONPAR90, pp.300-311, 1990.

P. Granger, Analyses S emantiques de Congruence, 1991.

G. Torbjj-orn and P. L. Montgomery, Division by i n variant i n tegers using multiplication, ACM SIGPLAN International Conference o n P r ogramming Language Design and Implementation, pp.61-72, 1994.

M. Gupta, S. Midkii, E. Schonberg, V. Seshadri, D. Shields et al., An HPF compiler for the IBM SP2, Proceedings of the 1995 ACM/IEEE conference on Supercomputing (CDROM) , Supercomputing '95, pp.22-39, 1995.
DOI : 10.1145/224170.224422

S. K. Gupta, S. D. Kaushik, S. Mufti, S. Sharma, C. Huang et al., On compiling array expressions for eecient execution on distributed-memory machines, International Conference o n P a r allel Processing, pp.301-305, 1993.

S. K. Gupta, S. D. Kaushik, C. Huang, and P. , S a d a yappan. On compiling array expressions for eecient execution on distributed-memory machines, pp.9-9

P. Havlak and K. Kennedy, An implementation of interprocedural bounded regular section analysis, IEEE Transactions on Parallel and Distributed Systems, vol.2, issue.3, pp.350-360, 1991.
DOI : 10.1109/71.86110

S. Hiranandani, K. Kennedy, J. Mellor-crummey, and A. Sethi, Compilation techniques for block-cyclic distributions, ACM International Conference o n S u p ercomputing, 1994.
DOI : 10.1145/2591635.2667169
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.55.5398

S. Hiranandani, K. Kennedy, and C. Tseng, Compiling Fortran D for MIMD distributed-memory machines, Communications of the ACM, vol.35, issue.8, pp.66-80, 1992.
DOI : 10.1145/135226.135230

S. Hirannandani, K. Kennedy, J. Mellor-crummey, and A. Sethi, Advanced Compilation Techniques for Fortran D. CRPC-TR 93338, 1993.

. Frann-cois-irigoin, Code generation for the hyperplane method and for loop interchange . ENSMP-CAI-88 E102, 1988.

. Frann-cois-irigoin, Interprocedural analyses for programming environment, Environments and Tools for Parallel Scientiic Computing, 1992.

P. Frann-cois-irigoin, R. Jouvelot, and . Triolet, Semantical interprocedural parallelization: An overview of the PIPS project, ACM International Conference o n S u p ercomputing, 1991.

S. D. Kaushik, C. Huang, and P. Yappan, Compiling Array Statements for Ecient Execution on Distributed-Memory Machines: Two-level Mappings, Language and Compilers for Parallel Computing, pp.14-15, 1995.

W. Kelly and W. Pugh, A framework for unifying reordering transformations . UMIACS-TR-93 134, 1993.

W. Kelly, W. Pugh, and E. Rosser, Code generation for multiple mappings, Proceedings Frontiers '95. The Fifth Symposium on the Frontiers of Massively Parallel Computation, pp.332-341, 1995.
DOI : 10.1109/FMPC.1995.380437
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.23.8696

K. Kennedy, N. Nedeljkovi-c, and A. Sethi, A Linear Time Algorithm for Computing the Memory Access Sequence in Data-Parallel Programs, Symposium on Principles and Practice o f P a r allel Programming, pp.30102-111, 1995.

K. Kennedy, N. Nedeljkovi-c, and A. Sethi, EEcient address generation for block-cyclic distributions, ACM International Conference o n S u p ercomputing, pp.180-184, 1995.
DOI : 10.1145/224538.224558
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.53.6149

C. Koelbel and P. Mehrotra, Compiling global name-space parallel loops for distributed execution, IEEE Transactions on Parallel and Distributed Systems, vol.2, issue.4, pp.440-451, 1991.
DOI : 10.1109/71.97901

C. Koelbel, P. Mehrotra, and J. Van-rosendale, Supporting shared data structures on distributed memory architectures, 1990.
DOI : 10.1145/99163.99183
URL : http://docs.lib.purdue.edu/cgi/viewcontent.cgi?article=1779&context=cstech

M. Le and F. , Scanning Parametrized Polyhedron using Fourier-Motzkin Elimination, Publication interne, vol.858, 1994.

M. Le and F. , Jean-Louis Pazat, and Frann coise Andr e. Commutative loop nests distribution, Workshop on Compilers for Parallel Computers, pp.345-350, 1993.

M. Le and F. , Jean-Louis Pazat, and Frann coise Andr e. An Array Partitioning Analysis for Parallel Loop Distribution, Euro-Par'95, pp.351-364, 1995.

L. Herv-e, V. Vincent, V. An-dongen, and D. K. Wilde, Loop nest synthesis using the polyhedral library, Publication Interne, vol.830, 1994.

O. Lempel, S. S. Pinter, and E. Turiel, Parallelizing a C Dialect for distributed memory MIMD machines, Language and Compilers for Parallel Computing, 1992.
DOI : 10.1007/3-540-57502-2_59

J. M. Levesque, FORGE 90 and High Performance F ortran, 1992.
DOI : 10.1007/978-3-642-58049-9_8

J. M. Levesque, Applied Parallel Research's xHPF system. IEEE Parallel and Distributed T echnologies, p.71, 1994.
DOI : 10.1109/m-pdt.1994.329805

J. Li and M. Chen, Compiling communication-efficient programs for massively parallel machines, IEEE Transactions on Parallel and Distributed Systems, vol.2, issue.3, pp.361-376, 1991.
DOI : 10.1109/71.86111

M. Frann, Array Indices Relational Semantic Analysis using Rational Cosets and Trapezoids, 1993.

L. F. Meadows, D. Miles, C. Walinsky, and R. Touzeau, The Intel Paragon HPF Compiler, 1995.

J. Merlin, Techniques for the automatic parallelisation of`Distributedof`Distributed Fortran 90, SNARC 92 02, 1992.

R. Mirchandaney, J. S. Saltz, R. M. Smith, D. M. Nicol, and K. Crowley, Principles of runtime support for parallel processors, Proceedings of the 2nd international conference on Supercomputing , ICS '88, pp.140-152, 1988.
DOI : 10.1145/55364.55378

C. D. Ooner, Digital's HPF Compiler: Meeting the Challenge of Generating EEcient Code on a Workstation Farm, NASA Ames Workshop

M. Edwin, H. J. Paalvast, A. J. Sips, and . Van-gemund, Automatic parallel program generation and optimization from data decompositions, 1991 International Conference o n P a r allel Processing | Volume II : Software, pp.124-131, 1991.

W. Pugh, A practical algorithm for exact array dependence analysis, Communications of the ACM, vol.35, issue.8, pp.102-114, 1992.
DOI : 10.1145/135226.135233

A. Rogers and K. Pingali, Process decomposition through locality o f r e f erence, ACM SIGPLAN International Conference o n P r ogramming Language Design and Implementation, 1989.

A. Rogers and K. Pingali, Compiling for distributed memory architectures, IEEE Transactions on Parallel and Distributed Systems, vol.5, issue.3, 1992.
DOI : 10.1109/71.277789
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.30.447

A. Schrijver, Theory of linear and integer programming. W i l e, 1986.

J. Stichnoth, D. O-'hallaron, and T. Gross, Generating Communication for Array Statements: Design, Implementation, and Evaluation, Jounal of Parallel and Distributed Computing, pp.150-159, 1994.
DOI : 10.1006/jpdc.1994.1048

J. M. Stichnoth, EEcient compilation of array statements for private memory multicomputers. CMU-CS-93 109, 1993.

A. Thirumalai and J. Ramanujam, Fast address sequence generation for data-parallel programs using integer lattices, Language and Compilers for Parallel Computing, pp.13-14, 1995.
DOI : 10.1007/BFb0014200

R. Emi-triolet, P. Feautrier, and F. Cois-irigoin, Direct parallelization of call statements, Proceedings of the ACM Symposium on Compiler Construction, 1986.

C. Tseng, An Optimising Fortran D Compiler for MIMD Distributed Memory Machines, 1993.

V. Vincent and . Dongen, Compiling distributed loops onto SPMD code. Parallel Processing Letters, pp.301-312, 1994.

C. Van-reuuwijk, H. J. Sips, W. Denissen, and E. M. Paalvast, Implementing HPF distributed arrays on a message-passing parallel computer system, Computational Physics Report Series, 1994.

J. Wang and C. Eisenbeis, Decomposed software pipelining: A new approach to exploit instruction level parallelism for loop programs, Working Conference o n A rchitectures and Compilation Techniques for Fine and Medium Grain Parallelism, 1993.

K. Doran and S. Wilde, Allocating memory arrays for polyhedra, 1993.

J. Xue, Constructing do loops for non-convex iteration spaces in compiling for parallel machines, International Parallel Processing Symposium, 1995.

H. Zima and B. Chapman, Supercompilers for Parallel and Vector Computers, 1990.

H. Zima and B. Chapman, Compiling for distributed-memory systems, Proceedings of the IEEE, vol.81, issue.2, 1993.
DOI : 10.1109/5.214550

H. Peter-zima, H. J. Bast, and H. M. Gerndt, SUPERB: A tool for semi-automatic MIMD/SIMD parallelization, Parallel Computing, vol.6, issue.1, pp.1-18, 1988.
DOI : 10.1016/0167-8191(88)90002-6