D. Mickael and . Adams, « The JPEG-2000 still image compression standard, 2001.

R. Allen and K. Kennedy, Optimizing Compilers for Modern Architectures: A Dependence-based Approach, 2001.

A. Amar, P. Boulet, and J. Dekeyser, ASSEMBLING DYNAMIC COMPONENTS FOR METACOMPUTING USING CORBA, Parallel Computing, 2001.
DOI : 10.1142/9781860949630_0048
URL : https://hal.archives-ouvertes.fr/inria-00565181

M. Baker, Cluster computing white paper ». Rapport Technique, IEEE Task Force on Cluster Computing, 2000.

S. «. Benker, Optimizing irregular HPF applications using Halos, Parallel and Distributed Processing, Proceedings of IPPS/SPDP Workshops, volume 1586 de Lecture Notes in Computer Science, pp.1015-1024, 1999.

P. Boulet, A. Darte, G. Silber, and . Et-frédéric-vivien, Loop parallelization algorithms: From parallelism extraction to code generation, Parallel Computing, vol.24, issue.3-4, pp.3-4421, 1998.
DOI : 10.1016/S0167-8191(98)00020-9
URL : https://hal.archives-ouvertes.fr/inria-00565000

P. Boulet, J. Dekeyser, F. Devin, and P. Marquet, « A visual development environment for meta-computing applications, 9th Int'l Conf. on Human-Computer Interaction, pp.983-987, 2001.

P. Boulet, J. Dekeyser, J. Levaire, and P. Marquet, Julien Soula, et Alain Demeure. « Visual data-parallel programming for signal processing applications, 9th Euromicro Workshop on Parallel and Distributed Processing, pp.105-112, 2001.

P. Boulet and M. Dion, « Code generation in Bouclettes, Proceedings of the Fifth Euromicro Workshop on Parallel and Distributed Processing, pp.273-280, 1997.

P. Boulet, J. J. Dongarra, Y. Robert, and F. Vivien, Static tiling for heterogeneous computing platforms, Static tiling for heterogeneous computing platforms, pp.547-568, 1999.
DOI : 10.1016/S0167-8191(99)00012-5
URL : https://hal.archives-ouvertes.fr/inria-00565004

P. Boulet and P. Feautrier, Scanning polyhedra without Do-loops, Proceedings. 1998 International Conference on Parallel Architectures and Compilation Techniques (Cat. No.98EX192), pp.4-11, 1998.
DOI : 10.1109/PACT.1998.727127
URL : https://hal.archives-ouvertes.fr/inria-00564990

P. Boulet and X. Redon, Communication pre-evaluation in HPF, EUROPAR'98, pp.263-272, 1998.
DOI : 10.1007/BFb0057861
URL : https://hal.archives-ouvertes.fr/inria-00565190

P. Boulet and X. Redon, « SPPoC : manipulation automatique de polyèdres pour la compilation, Technique et Science Informatiques, pp.1019-1048, 2001.

E. «. Cagniot, Algorithmes Dataparalì eles Irréguliers AppliquésAppliqués`Appliquésà la SimulationÉléctromagnétique Simulation´SimulationÉléctromagnétique Tridimensionelle, Thèse de doctorat, 2000.

E. Cagniot, T. Brandes, J. Dekeyser, and F. Piriou, « Parallelization of a 3-D magnetostatic code using high performance fortran and the Schur complement method, Conference on the Computation of Electromagnetic Fields, 2001.

E. Cagniot, T. Brandes, J. Dekeyser, and F. Piriou, « Une approche génie logiciel des codes de simulation irréguliers : Application au cas de l'electromagnétisme, Rencontres Francophones du Parallélisme des Architectures et des Systèmes, pp.115-120, 2001.

E. Cagniot, T. Brandes, J. Dekeyser, F. Piriou, P. Boulet et al., High Level Parallelization of a 3D Electromagnetic Simulation Code with Irregular Communication Patterns, 4th International Meeting on Vector and Parallel Processing, pp.519-528, 2000.
DOI : 10.1007/3-540-44942-6_42
URL : https://hal.archives-ouvertes.fr/inria-00565184

E. Cagniot, T. Brandes, J. Dekeyser, F. Piriou, P. Boulet et al., « Parallelization of a Fortran 90 program for electromagnetic problems, 3rd Annual HPF User Group Meeting, HUG'99, 1999.

E. Cagniot, T. Brandes, J. Dekeyser, F. Piriou, P. Boulet et al., Parallelization of a 3D magnetostatic code using High Performance Fortran, Proceedings International Conference on Parallel Computing in Electrical Engineering. PARELEC 2000, pp.181-185, 2000.
DOI : 10.1109/PCEE.2000.873625

P. Calland, J. Dongarra, Y. Robert, L. Thiele, J. Fortes et al., Tiling with limited resources, Proceedings IEEE International Conference on Application-Specific Systems, Architectures and Processors, pp.229-238, 1997.
DOI : 10.1109/ASAP.1997.606829
URL : https://hal.archives-ouvertes.fr/inria-00073506

R. Chandra, R. Menon, L. Dagum, D. Kohr, D. Maydan et al., Parallel Programming in OpenMP, 2000.

P. «. Clauss, Counting solutions to linear and nonlinear constraints through Ehrhart polynomials: Applications to analyze and transform scientific programs, ACM Int. Conf. on Supercomputing, 1996.
URL : https://hal.archives-ouvertes.fr/hal-01100306

P. Clauss and V. Loechner, Parametric analysis of polyhedral iteration spaces, Proceedings of International Conference on Application Specific Systems, Architectures and Processors: ASAP '96, 1996.
DOI : 10.1109/ASAP.1996.542833
URL : https://hal.archives-ouvertes.fr/inria-00534840

P. Clauss, V. Loechner, K. Et-doran, and . Wilde, « Deriving formulae to count solutions to parameterized linear systems using ehrhart polynomials: Applications to the analysis of nested-loop programs, 1997.

J. Collard, P. Feautrier, and T. Risset, « Construction of DO loops from systems of affine constraints ». Parallel Processing Letters, pp.421-436, 1995.

A. Darte, C. Diderich, M. Gengler, and . Et-frédéric-vivien, Scheduling the Computations of a Loop Nest with Respect to a Given Mapping, Lecture Notes in Computer Science, 1900.
DOI : 10.1007/3-540-44520-X_52
URL : https://hal.archives-ouvertes.fr/hal-00856647

A. Darte and Y. Robert, Constructive methods for scheduling uniform loop nests, IEEE Transactions on Parallel and Distributed Systems, vol.5, issue.8, pp.814-822, 1994.
DOI : 10.1109/71.298207
URL : https://hal.archives-ouvertes.fr/hal-00857083

A. Darte and Y. Robert, Affine-by-Statement Scheduling of Uniform and Affine Loop Nests over Parametric Domains, Journal of Parallel and Distributed Computing, vol.29, issue.1, pp.43-59, 1995.
DOI : 10.1006/jpdc.1995.1105
URL : https://hal.archives-ouvertes.fr/hal-00857091

A. Darte, Y. Robert, and F. Vivien, Scheduling and Automatic Parallelization, Birkhauser Boston, 2000.
DOI : 10.1007/978-1-4612-1362-8
URL : https://hal.archives-ouvertes.fr/hal-00856645

E. A. De-kock, G. Essink, W. J. Smits, P. Van-der-wolf, J. Brunel et al., YAPI, Proceedings of the 37th conference on Design automation , DAC '00, 2000.
DOI : 10.1145/337292.337511

M. Dion and Y. Robert, Mapping affine loop nests, High-Performance Computing and Networking, International Conference and Exhibition, volume LCNS 919, pp.184-189
DOI : 10.1016/S0167-8191(96)00049-X
URL : https://hal.archives-ouvertes.fr/hal-00856912

L. Springer-verlag and . Lyon, Extended version available as Technical, 1995.

E. «. Technologies, Esterel suite for system-on-a-chip top level validation

T. «. Fahringer, Compile-Time Estimation of Communication Costs for Data Parallel Programs, Journal of Parallel and Distributed Computing, vol.39, issue.1, pp.46-65, 1996.
DOI : 10.1006/jpdc.1996.0153

P. Feautrier, Dataflow analysis of array and scalar references, International Journal of Parallel Programming, vol.24, issue.4, pp.23-51, 1991.
DOI : 10.1007/BF01407931

P. «. Feautrier, Some efficient solutions to the affine scheduling problem. I. One-dimensional time, International Journal of Parallel Programming, vol.40, issue.6, pp.313-348, 1992.
DOI : 10.1007/BF01407835

P. «. Feautrier, Some efficient solutions to the affine scheduling problem. Part II. Multidimensional time, International Journal of Parallel Programming, vol.2, issue.4, pp.389-420, 1992.
DOI : 10.1007/BF01379404

P. Feautrier and N. Tawbi, Résolution de systèmes d'inéquations linéaires; mode d'emploi du logiciel PIP, 1990.

I. Foster, C. Kesselman, and ´. , The Grid: Blueprint for a New Computing Infrastructure, pp.1-55860, 1998.

A. Geist, A. Beguelin, J. Dongarra, W. Jiang, R. Manchek et al., PVM-Parallel Virtual Machine: AUsers' Guide and Tutorial for Networked Parallel Computing, Computers in Physics, vol.9, issue.6, 1994.
DOI : 10.1063/1.4823450

T. Grandpierre, C. Lavarenne, and Y. Sorel, Optimized rapid prototyping for real-time embedded heterogeneous multiprocessors, Proceedings of the seventh international workshop on Hardware/software codesign , CODES '99, pp.74-78, 1999.
DOI : 10.1145/301177.301489

M. Gupta and P. Banerjee, Compile-time estimation of communication costs of programs », Journal of Programming Languages, vol.2, issue.3, pp.191-225, 1994.

M. Gupta, S. Mukhopadhyay, . Et-navin, and . Sinha, Automatic parallelization of recursive procedures, 1999 International Conference on Parallel Architectures and Compilation Techniques (Cat. No.PR00425), pp.537-562, 2000.
DOI : 10.1109/PACT.1999.807504

K. Högstedt, L. Carter, and E. J. Ferrante, « Determining the idle time of a tiling Extended version available as, Principles of Programming Languages, pp.160-173, 1997.

G. Kahn, The semantics of a simple language for parallel programming, Proceedings of the IFIP Congress, pp.471-475, 1974.

B. Dans and . Gilchrist, Information Processing 77, Proc.IFIP Congress, pp.993-998, 1977.

K. «. Keahey and . Pardis, PARDIS: Programmer-level abstractions for metacomputing, Future Generation Computer Systems, vol.15, issue.5-6, pp.637-647, 1999.
DOI : 10.1016/S0167-739X(99)00015-1

W. Kelly, V. Maslov, W. Pugh, E. Rosser, T. Shpeisman et al., « The Omega Library Interface Guide, 1996.

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

K. Kennedy and U. Kremer, Automatic data layout for high performance Fortran, Proceedings of the 1995 ACM/IEEE conference on Supercomputing (CDROM) , Supercomputing '95, 1995.
DOI : 10.1145/224170.224495

C. Lefebvre, J. «. Dekeyser, and . Hpf-builder, A visual environment to transform Fortran 90 codes to HPF ». The Int, Journal of Supercomputer Applications, vol.11, issue.2, pp.95-102, 19971997.

V. Lefebvre and P. Feautrier, Optimizing storage size for static control programs in automatic parallelizers, European Conference on Parallel Processing, pp.356-363, 1997.
DOI : 10.1007/BFb0002757

A. Lim, « Improving Parallelism and Data Locality with Affine Partitioning, 2001.

E. Lusk, « MPI-2: Extensions to the message-passing interface ». Rapport Technique, Message Passing Interface Forum, 1997.

D. Maufroid, P. S. Paolucci, P. Kajfasz, and A. Bertini, « mAgic FPU: VLIW floating point engines for " System-on-Chip " applications, EMM- SEC'99, 1999.

E. Dror, S. P. Maydan, M. S. Amarasinghe, and . Lam, « Array-data flow analysis and its use in array privatization, Conference record of the Twentieth Annual ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages: papers presented at the symposium, pp.2-15, 1993.

B. Meyer and M. Stubbe, « EUROSTAG ? a single tool for power system simulation, 1992.

M. «. Mottl, Automating functional program transformation ». Master's thesis, 2000.

. Object-management-group and . Inc, Common Object Request Broker Architecture (CORBA), Version 2.6, 2001.

. Object-management-group and . Inc, Unified Modeling Language (UML), Version 1.4, 2001.

P. S. Paolucci, P. Kajfasz, P. Bonnot, B. Candaele, D. Maufroid et al., mAgic-FPU and MADE: A customizable VLIW core and the modular VLIW processor architecture description environment, SIMAI 2000 Conference, 2000.
DOI : 10.1016/S0010-4655(01)00235-1

C. Pareja, R. Peña, F. Rubio, and C. Segura, « Optimizing Eden by program transformation, 2nd Scottish Functional Programming Workshop, 2000.

T. Priol and C. René, Cobra: A CORBA-compliant programming environment for high-performance computing, Euro-Par'98, numéro 1470 dans Lecture Notes in Computer Science, pp.1114-1122, 1998.
DOI : 10.1007/BFb0057973

W. Pugh, The Omega test: a fast and practical integer programming algorithm for dependence analysis, Proceedings of the 1991 ACM/IEEE conference on Supercomputing , Supercomputing '91, pp.4-13, 1991.
DOI : 10.1145/125826.125848

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

M. Serrano and P. Weis, Bigloo: a portable and optimizing compiler for strict functional languages, Static Analysis Symposium, pp.366-381, 1995.
DOI : 10.1007/3-540-60360-3_50

Y. «. Sorel, Massively parallel computing systems with real time constraints: the "Algorithm Architecture Adequation" methodology, Proceedings of the First International Conference on Massively Parallel Computing Systems (MPCS) The Challenges of General-Purpose and Special-Purpose Computing, pp.44-54, 1994.
DOI : 10.1109/MPCS.1994.367018

Y. Sorel and C. Lavarenne, « Modèle unifié pour la conception conjointe logiciel-matériel ». Traitement du Signal (numéro spécial Adéquation Algorithme Architecture, pp.569-578, 1997.

J. «. Soula, Principe de Compilation d'un Langage de Traitement de Signal, Thèse de doctorat, 2001.

W. Thies, F. Vivien, J. Sheldon, P. Et-saman, and . Amarasinghe, « A unified framework for schedule and storage optimization, SIGPLAN Conference on Programming Language Design and Implementation, pp.232-242, 2001.

P. Tu and D. Padua, « Chapter 8. automatic array privatization, Lecture Notes in Computer Science, 1808.

J. Aad, J. J. Van-der-steen, and . Dongarra, « Overview of recent supercomputers, Top500 Supercomputers Sites, 2002.

D. Webb, A. Wendelborn, and K. Maciunas, Process networks as a high-level notation for metacomputing, Java for Parallel and Distributed Computing (IPPS), 1999.
DOI : 10.1007/BFb0097967

D. Webb, A. Wendelborn, and . Et-julienvayssì-ere, « A study of computational reconfiguration in a process network, 2000.

]. A. Agarwal, D. A. Kranz, and V. Natarajan, Automatic partitioning of parallel loops and data arrays for distributed shared-memory multiprocessors, IEEE Transactions on Parallel and Distributed Systems, vol.6, issue.9, pp.943-962, 1995.
DOI : 10.1109/71.466632

R. Andonov, H. Bourzoufi, and S. Rajopadhye, Two-dimensional orthogonal tiling: from theory to practice, Proceedings of 3rd International Conference on High Performance Computing (HiPC), pp.225-231, 1996.
DOI : 10.1109/HIPC.1996.565827

R. Andonov and S. Rajopadhye, Optimal tiling of two-dimensional uniform recurrences, Journal of Parallel and Distributed Computing

P. Boulet, A. Darte, T. Risset, and Y. Robert, (pen)-ultimate tiling? Integration , the VLSI Journal, pp.33-51, 1994.

A. J. Brentjes, Multi-dimensional continued fraction algorithms, Mathematisch Centrum, 1981.

P. Calland and T. Risset, Precise tiling for uniform loop nests, Proceedings The International Conference on Application Specific Array Processors, pp.330-337, 1995.
DOI : 10.1109/ASAP.1995.522937

P. Y. Calland, J. Dongarra, Y. Robert, L. Thiele, J. Fortes et al., Tiling with limited resources, Proceedings IEEE International Conference on Application-Specific Systems, Architectures and Processors, pp.229-238, 1997.
DOI : 10.1109/ASAP.1997.606829
URL : https://hal.archives-ouvertes.fr/inria-00073506

Y. Chen, S. Wang, and C. Wang, Tiling Nested Loops into Maximal Rectangular Blocks, Journal of Parallel and Distributed Computing, vol.35, issue.2, pp.108-120, 1996.
DOI : 10.1006/jpdc.1996.0075

J. Choi, J. Demmel, I. Dhillon, J. Dongarra, S. Ostrouchov et al., ScaLAPACK: a portable linear algebra library for distributed memory computers ??? design issues and performance, Computer Physics Communications, vol.97, issue.1-2, pp.1-15, 1996.
DOI : 10.1016/0010-4655(96)00017-3

. Ph and . Chretienne, Task scheduling over distributed memory machines, Parallel and Distributed Algorithms, pp.165-176, 1989.

A. Darte, G. Silber, and F. Vivien, Combining retiming and scheduling techniques for loop parallelization and loop tiling. Parallel Processing Letters, 1997. Special issue, to appear. Also available as Tech, pp.96-130
URL : https://hal.archives-ouvertes.fr/hal-00856890

J. J. Dongarra and D. W. Walker, Software Libraries for Linear Algebra Computations on High Performance Computers, SIAM Review, vol.37, issue.2, pp.151-180, 1995.
DOI : 10.1137/1037042

K. Högstedt, L. Carter, and J. Ferrante, Determining the idle time of a tiling Extended version available as, Principles of Programming Languages, pp.160-173, 1997.

F. Irigoin and R. Triolet, Supernode partitioning, Proceedings of the 15th ACM SIGPLAN-SIGACT symposium on Principles of programming languages , POPL '88, pp.319-329, 1988.
DOI : 10.1145/73560.73588

A. W. Lim and M. S. Lam, Maximizing parallelism and minimizing synchronization with affine transforms, Proceedings of the 24th ACM SIGPLAN-SIGACT symposium on Principles of programming languages , POPL '97, 1997.
DOI : 10.1145/263699.263719

N. Manjikian and T. S. Abdelrahman, Scheduling of wavefront parallelism on scalable shared-memory multiprocessors, Proceedings of the 1996 ICPP Workshop on Challenges for Parallel Processing, 1996.
DOI : 10.1109/ICPP.1996.538567

H. Ohta, Y. Saito, M. Kainaga, and H. Ono, Optimal tile size adjustment in compiling general DOACROSS loop nests, Proceedings of the 9th international conference on Supercomputing , ICS '95, pp.270-279
DOI : 10.1145/224538.224571

P. Pacheco, Parallel programming with MPI, 1997.

J. Ramanujam and P. Sadayappan, Tiling multidimensional iteration spaces for multicomputers, Journal of Parallel and Distributed Computing, vol.16, issue.2, pp.108-120, 1992.
DOI : 10.1016/0743-7315(92)90027-K

R. Schreiber and J. J. Dongarra, Automatic blocking of nested loops, 1990.

S. Sharma, C. Huang, and P. Sadayappan, On data dependence analysis for compiling programs on distributed-memory machines, ACM Sigplan Notices, vol.28, issue.1, 1993.

M. E. Wolf and M. S. Lam, A data locality optimizing algorithm, SIGPLAN Conference on Programming Language Design and Implementation, pp.30-44, 1991.

E. Michael, M. S. Wolf, J. Lam, and . Dekeyser, A loop transformation theory and an algorithm to maximize parallelism Assembling dynamic components for metacomputing using CORBA, Parallel Computing, pp.452-471, 1991.

R. Armstrong, D. Gannon, A. Geist, K. Keahey, S. Kohn et al., Toward a common component architecture for high-performance scientific computing, Proceedings. The Eighth International Symposium on High Performance Distributed Computing (Cat. No.99TH8469), 1999.
DOI : 10.1109/HPDC.1999.805289

J. T. Buck, Scheduling dynamic dataflow graphs with bounded memory using the token flow model, IEEE International Conference on Acoustics Speech and Signal Processing, 1993.
DOI : 10.1109/ICASSP.1993.319147

E. A. De-kock, G. Essink, W. J. Smits, P. Van-der-wolf, J. Brunel et al., YAPI, Proceedings of the 37th conference on Design automation , DAC '00, 2000.
DOI : 10.1145/337292.337511

G. Kahn, The semantics of a simple language for parallel programming, Information Processing 74: Proceedings of the IFIP Congress, pp.471-475, 1974.

G. Kahn and D. B. Macqueen, Coroutines and networks of parallel processes, Information Processing 77 Proc.IFIP Congress, pp.993-998, 1977.
URL : https://hal.archives-ouvertes.fr/inria-00306565

K. Keahey, P. Fasel, and S. Mniszewski, PAWS: collective interactions and data transfers, Proceedings 10th IEEE International Symposium on High Performance Distributed Computing, 2001.
DOI : 10.1109/HPDC.2001.945175

E. A. Lee, Overview of the Ptolemy Project, 2001.

R. Marvie, P. Merle, and J. Geib, Towards a Dynamic CORBA Component Platform, Proceedings of the 2nd International Symposium on Distributed Object Applications (DOA'2000), 2000.

T. M. Parks, Bounded Scheduling of Process Networks, 1995.

D. Webb, A. Wendelborn, and K. Maciunas, Process networks as a high-level notation for metacomputing, Workshop on Java for Parallel and Distributed Computing (IPPS), 1999.
DOI : 10.1007/BFb0097967

D. Webb, A. Wendelborn, and J. Ere, A study of computational reconfiguration in a process network, IDEA7, 2000.

P. Boulet, J. Dekeyser, A. Demeure, F. Devin, and P. Marquet, Une approchè a la SQL du traitement de données intensif dans Gaspard, RenPar'11, Rencontres Francophones du Parallélisme des Architectures et des Systèmes, 1999.

J. Dekeyser, A. Demeure, P. Marquet, and J. Soula, Array-OL compilation by code transformation, 1999.

J. Dekeyser, P. Marquet, and J. Soula, Video kills the radio stars In Su- percomputing'99 (poster session), 1999.

A. Demeure and Y. D. Gallo, An array approach for signal processing design, Sophia- Antipolis conference on Micro-Electronics (SAME 98), 1998.

A. Demeure, A. Lafage, E. Boutillon, D. Rozzonelli, J. Dufourd et al., Array-OL : Proposition d'un formalisme tableau pour le traitement de signal multi-dimensionnel, Gretsi, 1995.

M. Erwig and B. Meyer, Heterogeneous visual languages-integrating visual and textual programming, Proceedings of Symposium on Visual Languages, pp.318-325, 1995.
DOI : 10.1109/VL.1995.520825

R. Pandey and M. Burnett, Is it easier to write matrix manipulation programs visually or textually? An empirical study, Proceedings 1993 IEEE Symposium on Visual Languages, pp.344-351, 1993.
DOI : 10.1109/VL.1993.269621

. Ptolemy, An overview of the Ptolemy project, 1994.