Deadlock-Free Message Routing in Multiprocessor Interconnection Networks
IEEE Transactions on Computers
Multicasting in generalized multistage interconnection networks
Journal of Parallel and Distributed Computing
Methods and problems of communication in usual networks
Proceedings of the international workshop on Broadcasting and gossiping 1990
Using MPI: portable parallel programming with the message-passing interface
Using MPI: portable parallel programming with the message-passing interface
PVM: Parallel virtual machine: a users' guide and tutorial for networked parallel computing
PVM: Parallel virtual machine: a users' guide and tutorial for networked parallel computing
IEEE Transactions on Parallel and Distributed Systems
Deadlock-Free Multicast Wormhole Routing in 2-D Mesh Multicomputers
IEEE Transactions on Parallel and Distributed Systems
A Theory of Deadlock-Free Adaptive Multicast Routing in Wormhole Networks
IEEE Transactions on Parallel and Distributed Systems
Performance Evaluation of Multicast Wormhole Routing in 2D-Torus Multicomputers
ICCI '92 Proceedings of the Fourth International Conference on Computing and Information: Computing and Information
Multi-address Encoding for Multicast
PCRCW '94 Proceedings of the First International Workshop on Parallel Computer Routing and Communication
Multidestination Message Passing Mechanism Conforming to Base Wormhole Routing Scheme
PCRCW '94 Proceedings of the First International Workshop on Parallel Computer Routing and Communication
ICPP '94 Proceedings of the 1994 International Conference on Parallel Processing - Volume 03
Optimized Broadcasting and Multicasting Protocols in Cut-Through Routed Networks
IEEE Transactions on Parallel and Distributed Systems
| Hi-index | 0.00 |
Multicasting is an information dissemination problem which consists, for a processor of a distributed memory parallel computer, to send the same message to a subset of processors. In this paper we revisit our multicasting algorithms for the mesh, and using wormhole routing with the path-based facility. We have shown that our algorithms perform generally faster than algorithms previously described in the literature under the same model. This was shown analytically, and experimentally. However the analysis was mainly performed in absence of contention due to other traffic (possibly other multicasts). In this paper, we complete the analysis, and we show that our algorithms perform efficiently even if the network is heavily loaded.