A. Modèles-océaniques, 100 5.2.1 À propos des modèles océaniques

.. Implantation-parallèle, 103 5.3.1 Le graphe des tâches malléables

. Enfin, il faut noter que des légers raffinements permettent de minimiser des critères annexes, en particulier le degré de chaque partition. Pour cela on peut appliquer des algorithmes de propagation terminale, implantée dans CHACO [66], ou alors utiliser une approche complète de plongement du graphe initial dans un graphe représentant la machine

]. F. Bibliographie, E. Afrati, and L. Bampis, Finta, and I. Milis. 2 processors scheduling with large communication delays

A. Arakawa, Computational design for long-term numerical integration of the equations of fluid motion: Two-dimensional incompressible flow. Part I, Journal of Computational Physics, vol.1, issue.1, pp.119-143, 1966.
DOI : 10.1016/0021-9991(66)90015-5

B. Baker, E. Coffman-jr, and R. Rivest, Orthogonal Packings in Two Dimensions, SIAM Journal on Computing, vol.9, issue.4, pp.846-855, 1980.
DOI : 10.1137/0209064
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.309.8883

S. Balay, W. Gropp, L. Mcinnes, and B. Smith, Modern Software Tools in Scientific Computing, chapter Efficient Management of Parallelism in Object-Oriented Numerical Software Libraries, pp.163-202, 1997.

S. Barnard and H. Simon, A fast multilevel implementation of recursive spectral bissection, Proceeding of the 6th SIAM Conference on Parallel Processing for Scientific Computing. SIAM, 1993.

T. Stephen and . Barnard, Pmrsb: Parallel multilevel recursive spectral bissection, Supercomputing 95, 1995.

R. Barrett, M. Berry, T. Chan, J. Demmel, J. Donato et al., Templates for the Solution of Linear Systems: Building Blocks for Iterative Methods, SIAM, 1993.
DOI : 10.1137/1.9781611971538

M. Berger and J. Oliger, Adaptive mesh refinement for hyperbolic partial differential equations, Journal of Computational Physics, vol.53, issue.3, pp.484-512, 1984.
DOI : 10.1016/0021-9991(84)90073-1
URL : http://www.dtic.mil/get-tr-doc/pdf?AD=ADA121307

P. Bernard, Parallélisation et multiprogrammation pour une application irrégulière de dynamique moléculaire opérationnelle, Mathématiques appliquées, 1997.

P. Bernard, T. Gautier, and D. Trystram, Large scale simulation of parallel molecular dynamics, Proceedings 13th International Parallel Processing Symposium and 10th Symposium on Parallel and Distributed Processing. IPPS/SPDP 1999, 1999.
DOI : 10.1109/IPPS.1999.760544

E. Blayo, Développement d'un modèle quasi-géostrophique de circulation océanique. Application à l'océan Atlantique Nord, 1992.

E. Blayo and L. Debreu, Adaptive Mesh Refinement for Finite-Difference Ocean Models: First Experiments, Journal of Physical Oceanography, vol.29, issue.6, pp.1239-1250, 1998.
DOI : 10.1175/1520-0485(1999)029<1239:AMRFFD>2.0.CO;2
URL : https://hal.archives-ouvertes.fr/hal-01096127

J. Blazewicz, M. Drabowski, and J. Welgarz, Scheduling Multiprocessor Tasks to Minimize Schedule Length, IEEE Transactions on Computers, vol.35, issue.5, pp.35389-393, 1986.
DOI : 10.1109/TC.1986.1676781

R. Bleck, S. Dean, M. O. Keefe, and A. Sawdey, A comparison of data-parallel and message-passing versions of the Miami Isopycnic Coordinate Ocean Model (MICOM), Parallel Computing, vol.21, issue.10, pp.1695-1720, 1995.
DOI : 10.1016/0167-8191(95)00043-3

G. Blelloch, Programming parallel algorithms, Communications of the ACM, vol.39, issue.3, pp.85-97, 1996.
DOI : 10.1145/227234.227246

R. D. Blumofe, C. F. Joerg, B. C. Kuszmaul, C. E. Leiserson, K. H. Randall et al., Cilk, ACM SIGPLAN Notices, vol.30, issue.8, pp.207-216, 1995.
DOI : 10.1145/209937.209958

D. Butenhof, Programming with POSIX threads, 1997.

E. Caceres, F. Dehne, A. Ferreira, and P. Flocchini, Efficient parallel graph algorithms for coarse grained multicomputers and BSP, Lecture Notes in Computer Science, vol.1256, pp.390-400, 1997.
DOI : 10.1007/3-540-63165-8_195

F. Cao, J. R. Gilbert, and S. Teng, Partitionning meshes with lines and planes. Technical report csl9601.ps, Parc Xerox " janvier 1996

A. Carissimi, ath-0: exploitation de la multiprogrammation légère sur grappes de multiprocesseurs, 1999.

P. Chrétienne, E. G. Coffman, J. K. Lenstra, and Z. Liu, Scheduling Theory and its Applications, 1995.

P. Chrétienne, C. Picouleau, E. G. Coffman, and P. J. Denning, The basic scheduling with interprocessor communication delays Operating System Theory, 1972.

M. Cosnard and E. Jeannot, Automatic Coarse-Grained Parallelization Techniques, NATO workshop: Advances in High Performance Computing. Kluwer academic, 1997.
DOI : 10.1007/978-94-011-5514-4_15

D. E. Culler, R. M. Karp, D. Patterson, A. Sahay, E. E. Santos et al., LogP: a practical model of parallel computation, Communications of the ACM, vol.39, issue.11, pp.78-85, 1996.
DOI : 10.1145/240455.240477

L. Debreu and E. Blayo, On the Schwarz Alternating Method for Oceanic Models on Parallel Computers, Journal of Computational Physics, vol.141, issue.2, pp.93-111, 1998.
DOI : 10.1006/jcph.1998.5898

R. Diekmann, D. Meyer, and B. Monien, Parallel decomposition of unstructured fem-meshes, LNCS, vol.980, 1995.

J. Dongarra, H. Meuer, and E. Strohmaier, Top500 supercomputer sites, Supercomputing 99, 1999.

J. J. Dongarra, J. Du-croz, S. Hammarling, and I. Duff, Algorithm 679; a set of level 3 basic linear algebra subprograms: model implementation and test programs, ACM Transactions on Mathematical Software, vol.16, issue.1, pp.18-28, 1990.
DOI : 10.1145/77626.77627

M. Doreille, Athapascan-1 : vers un modèle de programmation parallèle pour le calcul scientifique, 1999.

M. Drozdowski, Scheduling multiprocessor tasks ??? An overview, European Journal of Operational Research, vol.94, issue.2, pp.215-230, 1996.
DOI : 10.1016/0377-2217(96)00123-3

J. Du and J. Leung, Complexity of Scheduling Parallel Task Systems, SIAM Journal on Discrete Mathematics, vol.2, issue.4, pp.473-487, 1989.
DOI : 10.1137/0402042

B. Dumitrescu, M. Doreille, J. Roch, and D. Trystram, Two-dimensional block partitionings for the parallel sparse Cholesky factorization, Numerical Algorithms, vol.16, issue.1, pp.17-38, 1997.
DOI : 10.1023/A:1019122726788
URL : https://hal.archives-ouvertes.fr/inria-00073533

G. Edjlali, G. Agrawal, A. Sussman, J. Humphries, and J. Saltz, Compiler and runtime support for programming in adaptive parallel environments, Scientific Programming, 1997.

A. Fagot, Réexécution déterministe pour un modèle procédural parallèle basé sur les processus légers, 1997.

C. Farhat and H. D. Simon, Top/domec-a software tool for mesh partitionning and parallel processing, 1993.

T. Feder and D. H. Greene, Optimal algorithms for approximate clustering, Proceedings of the twentieth annual ACM symposium on Theory of computing , STOC '88, 1988.
DOI : 10.1145/62212.62255

A. Feldmann, M. Kao, and J. Sgall, Optimal online scheduling of parallel jobs with dependencies, Proceedings of the twenty-fifth annual ACM symposium on Theory of computing , STOC '93, pp.642-651, 1993.
DOI : 10.1145/167088.167254

W. Fernandez-de, L. Vega, and V. Zissimopoulos, An approximation scheme for strip packing of rectangles with bounded dimensions, Discrete Applied Mathematics, vol.82, pp.93-101, 1998.

C. Fiduccia and R. Mattheyses, An effective heuristic procedure for partitionning graphs, General Electric Co., Corporate Research and Development Center, 1982.

M. Forum, Mpi: A message-passing interface standard, 1995.

M. Forum, Mpi-2: Extensions to the message-passing interface. electronic version, 1997.

I. Foster, C. Kesselman, and S. Tuecke, The Nexus Approach to Integrating Multithreading and Communication, Journal of Parallel and Distributed Computing, vol.37, issue.1, pp.70-82, 1996.
DOI : 10.1006/jpdc.1996.0108

C. Frahat, A simple and efficient automatic fem domain decomposer, Computers & Structures, vol.28, issue.5, pp.579-602, 1988.
DOI : 10.1016/0045-7949(88)90004-1

F. Galilée, Athapascan-1 : interprétation distribuée du flot de données d'un programme parallèleInformatique et Distribution -IMAG, septembre 1999

M. R. Garey, R. L. Graham, and D. S. Johnson, Performance Guarantees for Scheduling Algorithms, Operations Research, vol.26, issue.1, pp.3-21, 1978.
DOI : 10.1287/opre.26.1.3

M. R. Garey and D. S. Johnson, Computers and intractability: A guide to the theory of NP-completeness, 1979.

A. Geist, A. Beguelin, J. Dongarra, W. Jiang, R. Manchek et al., PVM: Parallel Virtual Machine. A Users' Guide and Tutorial for Network Parallel Computing George Karypis and V. Kumar. A fast and high quality multilevel scheme for partitioning irregular graphs, SIAM Journal on Scientific Computing, vol.20, issue.1, pp.359-392, 1994.

A. Gerasoulis and T. Yang, DSC : Scheduling parallel tasks on an unbounded number of processors, IEEE Transaction on Parallel and Distributed Systems, vol.5, pp.951-967, 1994.

A. Goldman, Impact des modèles d'exécutions pour l'ordonnancement en calcul parallèle, 1999.

A. Goldman and G. Mounié, Un exemple d'ordonnancement sous le modèle bsp, 10ème Rencontres Francophones du Parallélisme (Renpar'10), pp.239-242, 1998.

A. Goldman, G. Mounié, and D. Trystram, Near optimal algorithms for scheduling independent chains in BSP, Proceedings. Fifth International Conference on High Performance Computing (Cat. No. 98EX238), 1998.
DOI : 10.1109/HIPC.1998.738003

A. Goldman, J. Peters, and D. Trystram, Exchange of messages of different sizes, Irregular'98, number 1457, 1998.
DOI : 10.1007/BFb0018539

G. Golub and C. Van-loan, Matrix computations Johns Hopkins Studies in the Mathematical Sciences, 1996.

R. L. Graham, Bounds for Certain Multiprocessing Anomalies, Bell System Technical Journal, vol.45, issue.9, pp.1563-1581, 1966.
DOI : 10.1002/j.1538-7305.1966.tb01709.x

R. L. Graham, Bounds on Multiprocessing Timing Anomalies, SIAM Journal on Applied Mathematics, vol.17, issue.2, pp.416-429, 1969.
DOI : 10.1137/0117039

A. Gupta, G. Karypis, and V. Kumar, Highly scalable parallel algorithms for sparse matrix factorization, IEEE Transactions on Parallel and Distributed Systems, vol.8, issue.5, pp.502-520, 1997.
DOI : 10.1109/71.598277

M. Guyon, M. Chartier, F. Roux, and P. Fraunie, First Considerations about Modelling the Ocean General Circulation on MIMD Machines by Domain Decomposition Method, Proceedings of the NATO advanced research workshop on high perfomance computing in the geosciences, NATO ASI Series C462, les Houches, 1993.
DOI : 10.1007/978-94-011-0033-5_9

C. Hanen and A. Munier, An approximation algorithm for scheduling dependant tasks on m processors for small communication delays, Proceedings of IEEE Symposium on Emerging Technologies and Factory Automation, pp.167-189, 1995.

C. Hanen and A. Munier, Using duplication for scheduling unitary tasks on Ñ processors with communication delays, Theoretical Computer Science, vol.178, pp.119-127, 1997.

B. Hendrickson and R. Leland, A multilevel algorithm for partitionning graphs, Proc. Supercomputing '95, 1995.

D. S. Hochbaum and D. B. Shmoys, Using dual approximation algorithms for scheduling problems theoretical and practical results, Journal of the ACM, vol.34, issue.1, pp.144-162, 1987.
DOI : 10.1145/7531.7535

R. W. Hockney, A Fast Direct Solution of Poisson's Equation Using Fourier Analysis, Journal of the ACM, vol.12, issue.1, pp.95-113, 1965.
DOI : 10.1145/321250.321259

J. Hoogeveen, J. Lenstra, and B. Veltman, Three, four, five, six, or the complexity of scheduling with communication delays, Operations Research Letters, vol.16, issue.3, pp.129-137, 1994.
DOI : 10.1016/0167-6377(94)90024-8

J. Jang-hwang, Y. Chow, F. D. Anger, and C. Lee, Scheduling Precedence Graphs in Systems with Interprocessor Communication Times, SIAM Journal on Computing, vol.18, issue.2, pp.244-257, 1989.
DOI : 10.1137/0218016

I. D. Scherson, R. Subramanian, V. L. Reis, and L. M. Campos, Scheduling computationally intensive data parallel programs, Placement dynamique et répartition de charge : application aux systèmes parallèles et répartis (École Française de Parallélisme, Réseaux et Système), pp.107-129, 1996.

K. Jansen and L. Porkolab, Linear-Time Approximation Schemes for Scheduling Malleable Parallel Tasks, Proceedings of the tenth annual ACM- SIAM symposium on Discrete algorithms (SODA 98), pp.490-498, 1998.
DOI : 10.1007/s00453-001-0085-8
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.25.9750

T. Mark, P. E. Jones, and . Plassmann, Parallel algorithms for adaptative refinement and partitionning of unstructured meshes, Proceedings of the Scalable High Performance Computing Conference, pp.478-485, 1994.

S. Karmesin, J. Crotinger, J. Cummings, S. Haney, W. Humphrey et al., Array Design and Expression Evaluation in POOMA II, In Lecture Notes in Computer Science, vol.1505, p.231, 1998.
DOI : 10.1007/3-540-49372-7_25

C. Kenyon and E. Rémila, Approximate strip packing, Proceedings of 37th Conference on Foundations of Computer Science, pp.31-36, 1996.
DOI : 10.1109/SFCS.1996.548461

C. Kenyon and E. Rémila, A Near-Optimal Solution to a Two-Dimensional Cutting Stock Problem, Mathematics of Operations Research, vol.25, issue.4, 1998.
DOI : 10.1287/moor.25.4.645.12118

B. Kernighan and S. Lin, An effective heuristic procedure for partitionning graphs. The Bell System Techical Journal, pp.291-308, 1970.
DOI : 10.1002/j.1538-7305.1970.tb01770.x

S. Kleiman, D. Shah, and B. Smaalders, Programming With Threads, 1995.

I. Kort, Ordonnancement et Modèles d'Exécution : cas de graphes spécifiques, 1998.

V. Kumar, A. Grama, A. Gupta, and G. Karypis, Introduction to Parallel Computing: Design and Analysis of Algorithms, 1994.

B. Lewis and D. J. Berg, Threads primer: a guide to multithreaded programming, 1996.

B. Lewis and D. J. Berg, Multithreaded programming with pthreads. Sun Microsystems, 2550 Garcia Avenue, 1998.

W. T. Ludwig, Algorithms for scheduling malleable and nonmalleable parallel tasks, 1995.

W. T. Ludwig, Algorithms for scheduling malleable and nonmalleable parallel tasks, 1995.

W. T. Ludwig and P. Tiwari, Scheduling malleable and nonmalleable parallel tasks, Proceedings of the 5th Annual ACM- SIAM Symposium on Discrete Algorithms, pp.167-176, 1994.

G. Miller, S. Teng, W. Thurston, and S. Vavasis, Graph Theory and Sparse Matrix Computation, chapter Automatic mesh partitionning, 1993.

G. Mounié, C. Rapine, and D. Trystram, Efficient approximation algorithms for scheduling malleable tasks, Proceedings of the eleventh annual ACM symposium on Parallel algorithms and architectures , SPAA '99, pp.23-32, 1999.
DOI : 10.1145/305619.305622

R. Namyst, J. Méhaut, E. H. D-'hollander, G. R. Joubert, F. J. Peters et al., È Å ¾ : Parallel multithreaded machine. A computing environment for distributed architectures, Parallel Computing: State-of-the-Art and Perspectives, Proceedings of the Conference Par- Co'95 of Advances in Parallel Computing, pp.279-285, 1995.

S. Oaks and H. Wong, Java Threads. Java Series. O'Reilly & Associates, 1999.

C. H. Papadimitriou, Computational Complexity, 1994.

C. H. Papadimitriou and M. Yannakakis, Towards an Architecture-Independent Analysis of Parallel Algorithms, SIAM Journal on Computing, vol.19, issue.2, pp.322-328, 1990.
DOI : 10.1137/0219021

J. Pedlosky, Geophysical fluid dynamics. Number 710, 1987.

F. Pellegrini, Application de méthodes de partition à la résolution de problèmes de graphes issus du parallélisme, 1995.

G. N. Srinivasa-prasanna and B. R. Musicus, Generalized multiprocessor scheduling and applications to matrix computations, IEEE Transactions on Parallel and Distributed Systems, vol.7, issue.6, pp.650-664, 1996.
DOI : 10.1109/71.506703

G. N. Srinivasa-prasanna and B. R. Musicus, The optimal control approach to generalized multiprocessor scheduling, Algorithmica, vol.2, issue.4, pp.17-49, 1996.
DOI : 10.1007/BF01942605

L. Prylli, R. Tourancheau, and . Westrelin, BIP: A new protocol designed for high performance networking on Myrinet, IPPS/SPDP98, 1998.
DOI : 10.1007/3-540-64359-1_721

C. Rapine, Algorithmes d'approximation garantie pour l'ordonnancement de tâches, 1999.

C. Rapine, I. Scherson, and D. Trystram, On-line scheduling of parallelizable jobs, Lecture Notes in Computer Science, vol.1470, pp.322-327, 1998.
DOI : 10.1007/BFb0057869

V. J. Rayward-smith, UET scheduling with unit interprocessor communication delays, Discrete Applied Mathematics, vol.18, issue.1, pp.55-71, 1987.
DOI : 10.1016/0166-218X(87)90042-4
URL : http://doi.org/10.1016/0166-218x(87)90042-4

M. Rinard, The design, implementation, and evaluation of Jade, ACM Transactions on Programming Languages and Systems, vol.20, issue.3, 1994.
DOI : 10.1145/291889.291893

]. A. Robinson, P. Lermusiaux, and N. Q. Sloan, data assimilation. The Sea, pp.541-594, 1998.
URL : https://hal.archives-ouvertes.fr/hal-01144923

N. Smith and M. Lefebvre, The global ocean data assimilation ex- periment, International Symposium: Monitoring the Oceans in the 2000s: An Integrated Approach, 1998.

R. D. Smith, J. K. Dukowicz, and R. C. Malone, Parallel ocean general circulation modeling, Physica D: Nonlinear Phenomena, vol.60, issue.1-4, pp.38-61, 1992.
DOI : 10.1016/0167-2789(92)90225-C

G. N. Srinivasa-prasanna and B. R. Musicus, Generalised multiprocessor scheduling using optimal control, Proceedings of the third annual ACM symposium on Parallel algorithms and architectures , SPAA '91, pp.216-228, 1991.
DOI : 10.1145/113379.113399

A. Steinberg, A Strip-Packing Algorithm with Absolute Performance Bound 2, SIAM Journal on Computing, vol.26, issue.2, pp.401-409, 1997.
DOI : 10.1137/S0097539793255801

R. Tarjan and R. Lipton, A separator theorem for planar graphs, SIAM Journal of Applied Mathematics, vol.36, pp.177-189, 1979.

J. Turek, J. Wolf, and P. Yu, Approximate algorithms scheduling parallelizable tasks, Proceedings of the fourth annual ACM symposium on Parallel algorithms and architectures , SPAA '92, pp.323-332, 1992.
DOI : 10.1145/140901.141909

L. G. Valiant, A bridging model for parallel computation, Communications of the ACM, vol.33, issue.8, pp.103-111, 1990.
DOI : 10.1145/79173.79181

A. J. Wallcraft and D. R. Moore, The NRL layered ocean model, Parallel Computing, vol.23, issue.14, pp.2227-2242, 1997.
DOI : 10.1016/S0167-8191(97)00111-7

L. Zaslavsky, S. Kahan, B. Elton, K. Maschhoff, and L. Stern, A scalable approach for solving irregular sparse linear systems on the tera mta multithreaded parallel shared-memory computer, Proceedings of the Ninth SIAM Conference on Parallel Processing for Scientific Computing, 1999.