. Le-probl-eme-de-partitionnement, 5 1.3.2 L'allocation -l'ordonnancement : : : : : : : : : : : : : : : 6

. Abscence-de-famine-et-equit-e, 34 3.4.2 interblocage : : : : : : : : : : : : : : : : : : : : : : : : : : 35 3, Validit e, p.36

M. Ethodes-de-routage-par-intervalles, 83 5.3.1 Une famille de r eseaux r eguliers : grilles et hypercubes, p.83

M. Ethodes-de-g-en-eration-de and S. , 108 7.3.1 SEE et routage par intervalles classique, p.108

D. P. Agrawal866, V. K. Agrawal, and . Janakiran, Evaluating the performance o f multicomputer conngurations, IEEE Compute, pp.23-37, 1986.

V. Ahuja79aa and . Ahuja, Algorithm to Check Network States for Deadlock, IBM Journal of Research and Development, vol.23, issue.1
DOI : 10.1147/rd.231.0082

V. Ahuja79bb and . Ahuja, Routing and ow control in Systems Network Architecture, IBM System Journal, vol.18, issue.2, 1979.

A. N. Alhafez, Etude et mise en uvre de routages non blocants dans les architectures multi-processeurs, Th ese Universit e Claude Bernard -Lyon 1, 1991.

A. F. Allen, M. Burke, P. Charles, R. Cytron, and J. Ferrante, An overview of the PTRAN analysis system for multiprocessing, Journal of Parallel and Distributed Computing, vol.5, issue.5, pp.617-640, 1988.
DOI : 10.1016/0743-7315(88)90015-9

A. R. Anderson and E. Mayr, Parallelism and Greddy algorithms, 1984.

S. Andresen777 and . Andresen, The looping algorithm extended t o b ase 2 t rearrangeable switching networks, IEEE Trans. on Computers, vol.25, pp.1057-1063, 1977.

F. D. Anger900, J. J. Anger, Y. Hwang, and . Chow, Scheduling with sufficient loosely coupled processors, Journal of Parallel and Distributed Computing, vol.9, issue.1, pp.87-92, 1990.
DOI : 10.1016/0743-7315(90)90116-7

J. K. Annot877, R. A. Annot, and . Van-twist, A novel deadlock free and starvation free p acket switching communication processor. Lectures and Notes Computer Science no 258 juin, 1987.

A. S. Antonelli, F. Baiardi, S. Pelagatti, and M. Vanneschi, Communication Cost and Process Mapping in Massively Parallel Systems: a Static Approach

A. B. Awerbuch, A. Bar-noy, N. Linial, and D. Peleg, Improved routing strategies with succinct tables, Journal of Algorithms, vol.11, issue.3, pp.307-341, 1990.
DOI : 10.1016/0196-6774(90)90017-9

H. E. Bal899, J. G. Bal, A. S. Steiner, and . Tanembaum, Programming Languages for Distributed Computing Systems, ACM Computing Surveys, vol.21, issue.3, 1989.

E. M. Bakker900, J. Bakker, R. B. Van-leeuwen, and . Tan, Preex routing schemes in dynamic networks, 1990.

V. P. Bhatkar900 and . Bhatkar, Parallel computing : An Indian perspective, Proc. of CONPAR 90 -VAPP IV, 1990.
DOI : 10.1007/3-540-53065-7_84

J. Beeten877, M. Beetem, D. Denneau, and . Weingarten, The GF11 Parallel Computer. Experimental Parallel Computing Architectures, 1987.

C. Berge833 and . Berge, Th eorie des graphes. Gauthier-Villars, 1983.

J. Blazewicz877, J. Blazewics, G. Brzezinski, and . Gambosi, Time-Stamp Approach to Store-and-Forward Deadlock Prevention, IEEE Transactions on Communications, vol.35, issue.5, 1987.
DOI : 10.1109/TCOM.1987.1096799

W. Blume922, R. Blume, and . Eigenman, Performance analysis pf parallelizing compilers on the Perfect Benchmarks programs, IEEE Transactions on Parallel and Distributed Systems, vol.3, issue.6, 1992.
DOI : 10.1109/71.180621

J. E. Boillat911, N. Boillat, P. G. Iselin, and . Kropf, MARC : A T ool for Automatic Connguration of Parallel Programs, 1991.

A. Bouloutas899 and P. M. Bouloutas, Some Graph Partitioning Problems and Algorithms Related t o R outing in Large Computer Networks, Proc. of the 9th Int. Conf. on Distributed Computing, 1989.

C. W. Chan877, T. S. Chan, and . Um, An algorithm for detecting and resolving Store and Forward d e adlocks in Packet-Switching networks, IEEE Transactions on Communications, vol.35, issue.8, 1987.

K. M. Chandy799, J. Chandy, and . Misra, Deadlock Abscence Proofs for Networks of Communicating Processes, Information Processing Letters, vol.9, issue.4, 1979.

L. C. Chang900, B. T. Chang, and . Smith, Classiication and evaluation of parallel programming tools, 1990.

C. I. Cidon, J. M. Jaae, and M. Sidi, Distributed Store and Forward d e adlock detection and resolution algorithm, IEEE Transactions on Communications, vol.35, issue.11, 1987.
DOI : 10.1109/tcom.1987.1096699

URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=

C. Clos533 and . Clos, A study of non blocking switching networks. The bell system technical journal, 1953.

C. R. Cytron, M. Hind, and W. Hsieh, Automatic generation of DAG parallelism, ACM SIGLPAN, vol.54, issue.6, 1989.

W. J. Dally866, C. L. Dally, and . Seitz, The torus routing chip. Distributed Computing, 1986.

W. J. Dally877, C. L. Dally, and . Seitz, Deadlock-Free Message Routing in Multiprocessor Interconnection Networks, IEEE Transactions on Computers, vol.36, issue.5, 1987.
DOI : 10.1109/TC.1987.1676939

J. W. Dolter888, P. Dolter, K. G. Ramanathan, and . Shin, A VLSI Architecture for Dynamic Routing in HARTS. CRL-TR-04-88

J. W. Dolter899, R. Dolter, K. G. Ramanathan, and . Shin, A Microprogramable VLSI Routing Controller for Haartz, Proc. IEEE Int. Conf. on Computer VLSI Design, 1989.

J. W. Dolter911, R. Dolter, K. G. Ramanathan, and . Shin, Performance A nalysis of Virtual Cut-through switching in Haartz: A Hexagonal Mesh Multicomputer, 1991.

J. Eudes877, F. Eudes, L. Menneteau, T. Mugwaneza, and . Muntean, PDS : Advanced Program Development System for transputer based machines, Proc. of the 10th OCCAM User Group, pp.15-28, 1989.

T. Y. Feng811 and . Feng, A survey of interconnection networks, IEEE Computer, 1981.

I. Foster900, S. Foster, and . Taylor, STRAND : new concepts in parallel programming, 1990.

H. N. Gabow766 and . Gabow, Using euler partitions to edge color bipartite multigraphs, International Journal of Computer & Information Sciences, vol.2, issue.4, pp.345-355, 1976.
DOI : 10.1007/BF00998632

M. R. Garey799, D. S. Garey, and . Jonhson, Computers and Intractability : A guide to the theory of NP-Completness, p.65, 1979.

D. Gelernter811 and . Gelernter, A D AG-based algorithm for prevention of store and forward d e adlock in packets networks, IEEE Transactions on Communications, vol.30, 1981.

A. Giessler788, J. Giessler, A. Hanle, E. Konig, and . Pade, Free Buuer Allocation -An Investigation by Simulation, Computer Networks, vol.2, pp.191-208, 1978.

N. A. Gonzalez911, . Gonzalez, and . Valenzuela, PARX : Noyau de syst eme pour ordinateurs massivement parall eles. -Contr^ ole de la communication entre p r ocessus, 1991.

I. S. Gopal855, Prevention of Store and forward d e adlock in computer networks, IEEE Transactions on Communications, vol.33, issue.12, 1985.

R. L. Graham799, E. L. Graham, J. K. Lawler, A. H. Lenstra, and . Kan, Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey, Annals of Discrete Mathematics, pp.287-326, 1979.
DOI : 10.1016/S0167-5060(08)70356-X

K. D. Gunther755 and . Gunther, Prevention of buuer deadlocks in packet switching networks. The IFIP-II ASA Workshop on Data Communication, 1975.

K. D. Gunther811 and . Gunther, Prevention of Deadlocks in Packet-Switched Data Transport Systems, IEEE Transactions on Communications, vol.29, issue.4, 1981.
DOI : 10.1109/TCOM.1981.1095021

M. W. Hall933, T. J. Hall, K. Harvey, and N. Kennedy, McIntosh Experiences Using the ParaScope Editor: an Interactive Parallel Programming Tool, ACM SIGPLAN Notice, vol.28, issue.7, 1993.

S. S. Isloor800, T. A. Isloor, and . Marsland, The Deadlock Probllem: An Overview, IEEE Computer, 1980.

C. R. Jesshope89aa, P. Jesshope, J. Miller, and . Yantchev, High Performance Communications in Processor Networks, ACM Computer Architecture News, vol.17, issue.7, 1989.

C. R. Jesshope89bb, P. R. Jesshope, Y. T. Miller, and . Yantchev, High performance communications in processor networks, Proc. 16 th Int. Symp. on Computer Architecture, 1989.

P. Kelly899 and . Kelly, Functional programming for loosely-coupled multiprocessors . Research monographs in parallel and distributed computing, the, 1989.

K. Kennedy800 and . Kennedy, Automatic translation of FORTAN programs to vector forms, 1980.

P. Kermani799, L. Kermani, and . Kleinrock, Virtual cut-through : A new computer communication switching technique, Computers Networks, issue.3, 1979.

L. Kleinrock777, F. Kleinrock, and . Kamoun, Hierarchical routing for large networks Performance evaluation and optimization, Computer Networks (1976), vol.1, issue.3, pp.155-174, 1977.
DOI : 10.1016/0376-5075(77)90002-2

M. D. May and P. Thompson, Transputers and Routers: Components for Concurrent Machines Draft paper, 1990.

D. May911 and . May, The Next Generation of Transputers and, Proc. EDMCC2, 1991.

P. Merlin800, P. S. Merlin, and . Hweitzer, Deadlock avoidance in Store and Forward networks, IEEE Transactions on Communications, vol.28, issue.3, 1980.

P. R. Miller900, J. T. Miller, and . Yantchev, Developping Powerful Communication Mechanisms for Distributed Memory Computers from Simple and EEcient Message-Routing, Proc. 5th Distributed Memory Computing Conference, 1990.

P. R. Miller911, C. R. Miller, Y. T. Jesshope, and . Yantchev, The Mad- Postman Network Chip, Proc. Transputing'91, P. W elch e t al. Eds, 1991.

L. Mugwaneza900, T. Mugwaneza, I. Muntean, and . Sakho, A d e adlock free routing algorithm with network size independent buuering space LNCS 457, pp.490-501

V. I. Neiman699 and . Neiman, et commandes optimales de r eseaux de connexion sans blocage, Annales des T el ecom, 1969.

J. M. Quillan777, . Mc, D. C. Quillan, and . Walden, The ARPA Network Design Decisions, Computer Networks, vol.1, pp.213-289, 1977.

J. M. Quillan800, . Mc, I. Quillan, E. Richer, and . Rosen, The New Routing Algorithm of the ARPANET, IEEE T. COM. vol. Com, vol.28, issue.5, 1980.

M. C. Paull622, Reswitching of Connection Networks, Bell System Technical Journal, vol.41, issue.3, pp.833-855, 1962.
DOI : 10.1002/j.1538-7305.1962.tb00478.x

D. Peleg899, E. Peleg, and . Upfal, A T rade-OO between Space and EEciency for Routing Tables, pp.510-530, 1989.

H. R. Ramanujan733 and . Ramanujam, Decomposition of Permutation Networks, IEEE Trans. on Comp, vol.22, pp.639-643, 1973.

A. W. Roscoe877 and . Roscoe, Routing messages through networks : an exercise in deadlock avoidance. 7th O. U. G. and International Workshop on Parallel Programming of Transputers based machines, pp.14-16, 1987.

S. Sakarovitch, Techniques Math ematiques de la Recherche Op erationnelle II : El ements de la th eorie des graphes Notes de cours, 1977.

I. Sakho933, L. Sakho, Y. Mugwaneza, and . Langue, Routing with Compact Routing Tables: ILS for Generalized Meshes, 1993.

N. Santoro822, R. Santoro, and . Khatib, Routing without routing tables, 1982.

N. Santoro855, R. Santoro, and . Khatib, Labelling and Implicit Routing in Networks, The Computer Journal, vol.28, issue.1, 1985.
DOI : 10.1093/comjnl/28.1.5

V. Sarkar89aa and . Sarkar, Determining average program execution times and their variance, ACM SIGPLAN Notices, vol.24, issue.7, pp.298-312, 1989.
DOI : 10.1145/74818.74845

V. Sarkar89bb and . Sarkar, Partitionning and Scheduling Parallel Programs for Multiprocessors. Research monographs in parallel and distributed computing, 1989.

C. A. Sunshine777 and . Sunshine, Interconnection of computer networks, Computer Networks (1976), vol.1, issue.3, pp.175-195, 1977.
DOI : 10.1016/0376-5075(77)90003-4

E. G. Talbi933 and . Talbi, Allocation de processus sur les architectures parall eles a m emoire distribu ee Th ese Institut National Polytechnique de Grenoble, 1993.

N. Tawbi899, P. Tawbi, and . Feautrier, Parall elisation automatique de programmes pour ordinateur multiprocesseur a m emoire partag ee, 1989.

N. T. Tsaowu744 and . Tsao-wu, On Neiman's algorithm for the control of rearrangeable switching networks, IEEE Trans on Computers, vol.22, pp.737-742, 1974.

A. Trew911, G. Trew, J. Wilson, R. B. Van-leeuwen, and . Tan, Past, Present, Parallel : A Survey of Available Parallel Computing Systems Routing with Compact Routing Tables. RUU-CS-83-16 Computer Networks with Compact Routing Tables, pp.259-273, 1983.
DOI : 10.1007/978-1-4471-1842-8

P. Waille900 and T. Muntean, Introduction a l'architecture des machines supernodes, 1990.

A. Waksman688 and . Waksman, A Permutation Network, Journal of the ACM, vol.15, issue.1, pp.159-163, 1968.
DOI : 10.1145/321439.321449

C. J. Wang899, V. P. Wang, C. H. Nelson, and . Wu, Performance M o deling of the Modiied Mesh-Connected Parallel Computer, Proc. of the 9th Int. Conf. on Distributed Computing, 1989.

M. O. Ward844, D. J. Ward, and . Romero, Assigning parallel executable intercommunicating subtasks to processors

W. Whobrey, A Communication chip for multiprocessors

L. D. Wittie811 and . Wittie, Communication Structures for Large Networks of Microcomputers, IEEE Transactions on Computers, vol.30, issue.4, pp.284-273, 1981.
DOI : 10.1109/TC.1981.1675774

M. Wolfe899 and . Wolfe, Optimizing Supercompilers for Supercomputers. Research monographs in parallel and distributed computing, 1989.