%0 Conference Proceedings %T Optimal Deadlock-free Path-based Multicast Algorithms in Meshes %+ Software Tools for Telecommunications and Distributed Systems (RESEDAS) %A Bouchitte, Vincent %A Cohen, Johanne %A Fleury, Eric %Z Colloque avec actes et comité de lecture. %< avec comité de lecture %Z 98-R-203 || bouchitte98a %B 5th International Colloquium on Structural Information & Communication Complexity (SIROCCO'98) %C Amalfi, Italy %P 17 p %8 1998 %D 1998 %K Multicasting %K Wormhole Routing %K Deadlock Free %K Multiprocessors %K Parallel Computers %Z Computer Science [cs]/Other [cs.OH]Conference papers %X Multicasting is an information dissemination problem which consists, for a node of a distributed memory parallel computer, of sending the same message to an arbitrary subset of nodes. The two major criteria to be considered in multicast communication are \textsl{traffic} (number of channels used) & \textsl{latency} (time required). In this paper, we proposed new polynomial algorithms giving optimal solutions in terms of traffic or latency for a mesh network using \textsl{wormhole} routing & \textsl{path-based} facility. All the algorithms are shown to be deadlock-free. Moreover, we generalize our algorithms to arbitrary Hamiltonian graphs. %G English %L inria-00098443 %U https://inria.hal.science/inria-00098443 %~ CNRS %~ INRIA %~ INPL %~ INRIA-LORRAINE %~ LORIA2 %~ INRIA-NANCY-GRAND-EST %~ TESTALAIN1 %~ UNIV-LORRAINE %~ INRIA2 %~ LORIA