S. Antonelli, F. Baiardi, S. Pelagatti, and M. Vanneschi, Communication cost and process mapping in massively parallel systems : a static approach Rapport technique, Universitt a degli studi di Pisa,dipartimento di informatica, ëBae74ë J. L. Baer. Optimal Scheduling on Two Processors of Diaeerent Speeds, pp.27-40, 1974.

J. Bb-la_-zewicz, P. Bouvry, F. Guinand, and D. Trystram, Scheduling complete intrees on two uniform processors with communication delays, LMC-IMAG, Rapport Interne, 1993.

J. Bb-la_-zewicz, P. Bouvry, D. , and R. Walkowiak, A eaecient tabu search for the mapping problem, European Chapter on Combinatorial Optimization 95.TUPoznan, 1995.

+. , P. Bouvry, J. Chassin, M. Dobrucky, L. Hluchy et al., Mapping and load balancing on distributed memory systems, uP'94, Eight Symposium on Computer and Microprocessor Applications, 1994.

J. Briat, M. Christaller, and J. Roch, Une maquette pour athapascan 0, RENPAR 6. ENS Lyon, 1994.

J. Bb-la_-zewicz, M. Drozdowski, B. Somiewicki, and R. Walkowiak, The two-dimensional cutting problem. Rapport technique CP-91-009, IIASA, Juin 1991. ëBer89ë F. Berman. Experience with an automatic solution to the mapping problem, Proceedings of the Twenty-Second Annual Hawaii International Conference on System Sciences, 1989.

. St and . Bernard, Notions d'analyse en composantes principales et application au choix de variables. Tribunix -Dossier Benchmarks, pp.88-100, 1994.

P. Bouvry, J. Geib, and D. Trystram, Analyse et Conception d'Algorithmes Parall eles,c hapitre R epartition de Charge. Livre publi e par Hermes Andes: A performance evaluation tool, application to the mapping problem, 1994.

S. W. Bollinger, S. F. Midkiae, and S. H. Bokhari, Processor and link assignmentin multicomputers using simulated annealing On the mapping problem C-30033:207í214, Mars 1981. ëBP89ë D. Benhamamouch and G. Plateau. Task allocation in distributed computing systems, International Conference Parallel Processing, 1988.

B. Braschi, ëBT89ë Dimitri P. Bertsekas and John N. Tsitsiklis. Parallel and distributedc omputation í numerical methods CPM scheduling with small interprocessor communication delays Operating systems theory, Series in Automatic Computation, pp.200-213, 1972.

P. Chr-etienne, T. L. Casavant, and J. G. Kuhl, A polynomial algorithm to optimally schedule tasks on a virtual distributed system under tree-like precedence constraints A taxonomyofscheduling in generalpurpose distributed computing systems, European Journal of Operations Research IEEE Transactions on Software Engineering, vol.433, issue.14422141í154, pp.225-230, 1988.

K. Dowdreilly, &. Associates, I. Rewini, T. G. Lewis-birkhaeuser, J. Michael et al., High Performance Computing Ecole d' et e sur les communications dans les r eseaux de processeurs Scheduling parallel program tasks onto arbitrary target machine Optimized record-replay for rpc-based parallel programming In Working conferenceo np r ogramming environments for massively parallel distributed systems Very high-speed computing systems Performance guarantees for scheduling algorithms Computers and intractability: A guide to the theory of NP-completeness A comparative study of mapping algorithms for an automated parallel programming environment, ëFdK94ë A. Fagot and J. Chassin de Kergommeaux Modern Heuristic Techniques for Combinatorial Problems. W.H. Freeman, pp.138-1533, 1966.

K. Hwang, F. A. Briggs, A. J. Hey, M. Hanan, J. M. Kurtzberg et al., The GENESIS distributed memory benchmarks A review of the placement and quadratic assignment problems A formal basis for the heuristic determination of minimum cost paths Parallel sequencing and assembly line problems On mapping systolic algorithms onto the hypercube The art of computer systems performance analysis: techniques for experimental design, measurement, simulation, and modeling A general approach to mapping of parallel computations upon multiprocessor architectures, Computer Architecture and Parallel Processing Int. Conf. on Parallel Processing, pp.324-342841, 1961.

C. King, W. Chou, and L. M. Ni, Pipelined dataparallel algorithms: part II í design, IEEE Transactions on Parallel and Distributed Systems, vol.1144, pp.486-499, 1990.

H. Kasahara and S. Narita, Practical multiprocessor scheduling algorithms for eaecient parallel processing, IEEE Transactions on Computers, issue.333111, pp.1023-1029, 1984.

H. Kobayashi, Modeling and analysis: an introduction to system performance evaluation methodology. The Systems Programming Series, 1978.

P. Kitajima and B. Plateau, Building synthetic parallel programs: the project ALPES, Topham, R. Ibbett, and T. Bemmerl, pp.161-170, 1992.

W. Ëkr88ë-brian, D. M. Kernighan, and . Ritchie, The C programming language Prentice-Hall Software Series. Prentice-Hall, Englewood Cliaes, deuxi eme edition, 1988. ëLee91ë C-L. Lee. Parallel machines scheduling with nonsimultaneous machine available time, Discrete Applied Mathematics, vol.300, pp.53-61, 1991.

J. K. Lenstra and V. M. Lo, Approximation algorithms for job shop scheduling In Workshop on Models and Algorithms for Planning and Scheduling Problems Atelier tenuu a Come Italiee en juin 93 Mapping nested loop algorithms into multidimensional systolic arrays Heuristic algorithms for task assignment in distributed systems Algorithms for static task assignment and symetric contraction in distributed systems, Proc. 4th Int. Conf. Dist. Comp. Systems ICPP88, 1988. ëMGSK87ë H. Muehlenbein, M. Gorges-Schleuter, and O. Kraemer. New solutions to the mapping problem of parallel systems: the evolution approach, pp.64-76, 1984.

F. Ëmrsv86ë-debasis-mitra, A. Romeo, J. B. Sangiovanni-vincentelli, and . Sinclair, Convergence and aenite-time behaviour of simulated annealing Advanced AppliedProbability, 18:747í771, 1986. ëMS90ë B. Monien and H. Sudborough. Embedding one interconnection network in another. Computational Graph Theory Performance of synchronous parallel algorithms with regular structures Models of machines and computation for mapping in multicomputers, Computing Supplement IEEE Transactions on Parallel and Distributed Systems, vol.7, issue.2211, pp.257-282105, 1990.

J. L. Pazat, R. H. Perrot, K. Steiglitz, V. J. Rayward-smith, P. R. Scheiman et al., Heuristique : strat egies de recherche intelligente pour la r esolution de probl emes par ordinateur.C epadues Edition Parallel Programming Synthetic models of distributed memory parallel programs Rapport technique ORNLèTM í 11634, Oak Ridge National Laboratory í Martin Marietta, ORNL í Oak Ridge, Tennessee 37831 í USA, 1990. ëPR93ë F. Pell egrini and J. Roman. Placement statique et bi-partition Combinatorial optimization: algorithms and complexity UET scheduling with unit interprocessor communication delays A processor-time-minimal systolic array for transitive closure Eaecient computation of optimal assignments for distributed tasks A graph matching approach to optimal task assignment in distributed computing systems using a minimax criterion, ëSar89ë V. Sarkar. Partitioning and Scheduling Parallel Programs for Multiprocessors IEEE Transactions on Computers, C-34433:197í203, Mars 1985. ëSto77ë H.S. Stone. Multiprocessor scheduling with the aid of network aeow algorithms. IEEE Transactions on Software Engineering ëTan88ë Andrew S. Tanenbaum. Computer Networks ëTan92ë Andrew S. Tanenbaum. Modern Operating Systems, pp.55-71257, 1977.