Deadlock-free multicast wormhole routing in multicomputer networks
ISCA '91 Proceedings of the 18th annual international symposium on Computer architecture
ServerNet Deadlock Avoidance and Fractahedral Topologies
IPPS '96 Proceedings of the 10th International Parallel Processing Symposium
Multicast on Irregular Switch-based Networks with Wormhole Routing
HPCA '97 Proceedings of the 3rd IEEE Symposium on High-Performance Computer Architecture
Efficient Broadcast and Multicast on Multistage Interconnnection Networks using Multiport Encoding
SPDP '96 Proceedings of the 8th IEEE Symposium on Parallel and Distributed Processing (SPDP '96)
Hi-index | 0.00 |
This paper presents a novel concept of multi-drop path-based multidestination message passing on switch-based irregular networks. First, the multi-drop mechanism is defined with an associated header encoding scheme, and this mechanism is used to develop path-based multidestination worms. Next, a method is proposed to identify valid multidestination paths on arbitrary irregular networks with a typical deadlock-free routing. Then, the deadlock-free property of multidrop path-based worms is emphasized. Using the above concepts, three multicast algorithms are proposed: multi-drop path-based greedy (MDPG), multi-drop path-based less-greedy (MDP-LG), and multi-drop path-based binomial (MDP-B). The proposed algorithms are compared with each other and with the best unicast based algorithm, the CCO [5], for a range of system and technological parameters. The MDP-LG scheme is shown to be the best to implement multicast with reduced latency.