, 5 1.3.2 L'allocation -l'ordonnancement : : : : : : : : : : : : : : : 6
, 34 3.4.2 interblocage : : : : : : : : : : : : : : : : : : : : : : : : : : 35 3, Validit e, p.36
, 83 5.3.1 Une famille de r eseaux r eguliers : grilles et hypercubes, p.83
, 108 7.3.1 SEE et routage par intervalles classique, p.108
, Evaluating the performance o f multicomputer conngurations, IEEE Compute, pp.23-37, 1986.
, Algorithm to Check Network States for Deadlock, IBM Journal of Research and Development, vol.23, issue.1
DOI : 10.1147/rd.231.0082
, Routing and ow control in Systems Network Architecture, IBM System Journal, vol.18, issue.2, 1979.
, Etude et mise en uvre de routages non blocants dans les architectures multi-processeurs, Th ese Universit e Claude Bernard -Lyon 1, 1991.
, 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
, Parallelism and Greddy algorithms, 1984.
, The looping algorithm extended t o b ase 2 t rearrangeable switching networks, IEEE Trans. on Computers, vol.25, pp.1057-1063, 1977.
, 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
, A novel deadlock free and starvation free p acket switching communication processor. Lectures and Notes Computer Science no 258 juin, 1987.
, Communication Cost and Process Mapping in Massively Parallel Systems: a Static Approach
, 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
, Programming Languages for Distributed Computing Systems, ACM Computing Surveys, vol.21, issue.3, 1989.
, Preex routing schemes in dynamic networks, 1990.
, Parallel computing : An Indian perspective, Proc. of CONPAR 90 -VAPP IV, 1990.
DOI : 10.1007/3-540-53065-7_84
, The GF11 Parallel Computer. Experimental Parallel Computing Architectures, 1987.
, Th eorie des graphes. Gauthier-Villars, 1983.
, Time-Stamp Approach to Store-and-Forward Deadlock Prevention, IEEE Transactions on Communications, vol.35, issue.5, 1987.
DOI : 10.1109/TCOM.1987.1096799
, 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
, MARC : A T ool for Automatic Connguration of Parallel Programs, 1991.
, 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.
, 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.
, Deadlock Abscence Proofs for Networks of Communicating Processes, Information Processing Letters, vol.9, issue.4, 1979.
, Classiication and evaluation of parallel programming tools, 1990.
, 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=10.1.1.15.3111
, A study of non blocking switching networks. The bell system technical journal, 1953.
, Automatic generation of DAG parallelism, ACM SIGLPAN, vol.54, issue.6, 1989.
, The torus routing chip. Distributed Computing, 1986.
, Deadlock-Free Message Routing in Multiprocessor Interconnection Networks, IEEE Transactions on Computers, vol.36, issue.5, 1987.
DOI : 10.1109/TC.1987.1676939
, A VLSI Architecture for Dynamic Routing in HARTS. CRL-TR-04-88
, A Microprogramable VLSI Routing Controller for Haartz, Proc. IEEE Int. Conf. on Computer VLSI Design, 1989.
, Performance A nalysis of Virtual Cut-through switching in Haartz: A Hexagonal Mesh Multicomputer, 1991.
, PDS : Advanced Program Development System for transputer based machines, Proc. of the 10th OCCAM User Group, pp.15-28, 1989.
, A survey of interconnection networks, IEEE Computer, 1981.
, STRAND : new concepts in parallel programming, 1990.
, 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
, Computers and Intractability : A guide to the theory of NP-Completness, p.65, 1979.
, A D AG-based algorithm for prevention of store and forward d e adlock in packets networks, IEEE Transactions on Communications, vol.30, 1981.
, Free Buuer Allocation -An Investigation by Simulation, Computer Networks, vol.2, pp.191-208, 1978.
, PARX : Noyau de syst eme pour ordinateurs massivement parall eles. -Contr^ ole de la communication entre p r ocessus, 1991.
, Prevention of Store and forward d e adlock in computer networks, IEEE Transactions on Communications, vol.33, issue.12, 1985.
, 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
, Prevention of buuer deadlocks in packet switching networks. The IFIP-II ASA Workshop on Data Communication, 1975.
, Prevention of Deadlocks in Packet-Switched Data Transport Systems, IEEE Transactions on Communications, vol.29, issue.4, 1981.
DOI : 10.1109/TCOM.1981.1095021
, McIntosh Experiences Using the ParaScope Editor: an Interactive Parallel Programming Tool, ACM SIGPLAN Notice, vol.28, issue.7, 1993.
, The Deadlock Probllem: An Overview, IEEE Computer, 1980.
, High Performance Communications in Processor Networks, ACM Computer Architecture News, vol.17, issue.7, 1989.
, High performance communications in processor networks, Proc. 16 th Int. Symp. on Computer Architecture, 1989.
, Functional programming for loosely-coupled multiprocessors . Research monographs in parallel and distributed computing, the, 1989.
, Automatic translation of FORTAN programs to vector forms, 1980.
, Virtual cut-through : A new computer communication switching technique, Computers Networks, issue.3, 1979.
, 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
, Transputers and Routers: Components for Concurrent Machines Draft paper, 1990.
, The Next Generation of Transputers and, Proc. EDMCC2, 1991.
, Deadlock avoidance in Store and Forward networks, IEEE Transactions on Communications, vol.28, issue.3, 1980.
, Developping Powerful Communication Mechanisms for Distributed Memory Computers from Simple and EEcient Message-Routing, Proc. 5th Distributed Memory Computing Conference, 1990.
, The Mad- Postman Network Chip, Proc. Transputing'91, P. W elch e t al. Eds, 1991.
, A d e adlock free routing algorithm with network size independent buuering space LNCS 457, pp.490-501
, et commandes optimales de r eseaux de connexion sans blocage, Annales des T el ecom, 1969.
, The ARPA Network Design Decisions, Computer Networks, vol.1, pp.213-289, 1977.
, The New Routing Algorithm of the ARPANET, IEEE T. COM. vol. Com, vol.28, issue.5, 1980.
, 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
, A T rade-OO between Space and EEciency for Routing Tables, pp.510-530, 1989.
, Decomposition of Permutation Networks, IEEE Trans. on Comp, vol.22, pp.639-643, 1973.
, 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.
, Techniques Math ematiques de la Recherche Op erationnelle II : El ements de la th eorie des graphes Notes de cours, 1977.
, Routing with Compact Routing Tables: ILS for Generalized Meshes, 1993.
, Routing without routing tables, 1982.
, Labelling and Implicit Routing in Networks, The Computer Journal, vol.28, issue.1, 1985.
DOI : 10.1093/comjnl/28.1.5
, Determining average program execution times and their variance, ACM SIGPLAN Notices, vol.24, issue.7, pp.298-312, 1989.
DOI : 10.1145/74818.74845
, Partitionning and Scheduling Parallel Programs for Multiprocessors. Research monographs in parallel and distributed computing, 1989.
, Interconnection of computer networks, Computer Networks (1976), vol.1, issue.3, pp.175-195, 1977.
DOI : 10.1016/0376-5075(77)90003-4
, Allocation de processus sur les architectures parall eles a m emoire distribu ee Th ese Institut National Polytechnique de Grenoble, 1993.
, Parall elisation automatique de programmes pour ordinateur multiprocesseur a m emoire partag ee, 1989.
, On Neiman's algorithm for the control of rearrangeable switching networks, IEEE Trans on Computers, vol.22, pp.737-742, 1974.
, 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
, Introduction a l'architecture des machines supernodes, 1990.
, A Permutation Network, Journal of the ACM, vol.15, issue.1, pp.159-163, 1968.
DOI : 10.1145/321439.321449
, Performance M o deling of the Modiied Mesh-Connected Parallel Computer, Proc. of the 9th Int. Conf. on Distributed Computing, 1989.
, Assigning parallel executable intercommunicating subtasks to processors
, A Communication chip for multiprocessors
, 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
, Optimizing Supercompilers for Supercomputers. Research monographs in parallel and distributed computing, 1989.