Minimum deadlock-free message routing restrictions in binary hypercubes
Journal of Parallel and Distributed Computing
The turn model for adaptive routing
Journal of the ACM (JACM)
Unicast-Based Multicast Communication in Wormhole-Routed Networks
IEEE Transactions on Parallel and Distributed Systems
Adaptive wormhole routing in hypercube multicomputers
Journal of Parallel and Distributed Computing
Multidestination Message Passing in Wormhole k-ary n-cube Networks with Base Routing Conformed Paths
IEEE Transactions on Parallel and Distributed Systems
Deadlock-Free Multicast Wormhole Routing in 2-D Mesh Multicomputers
IEEE Transactions on Parallel and Distributed Systems
Multidestination Message Passing Mechanism Conforming to Base Wormhole Routing Scheme
PCRCW '94 Proceedings of the First International Workshop on Parallel Computer Routing and Communication
MultiSim: A Simulation Tool for the Study of Large-Scale Multiprocessors
MASCOTS '93 Proceedings of the International Workshop on Modeling, Analysis, and Simulation On Computer and Telecommunication Systems
| Hi-index | 0.01 |
In this paper, we consider path-based multicast on wormhole-routed hypercubes. A minimum set of routing restrictions is used as the base routing algorithm. To correctly perform multicast, we present the natural list to sort the destination nodes. It can be proved to be deadlock-free for both one-port and multi-port systems. Furthermore, it creates only one worm for each multicast. Between each pair of nodes in a multicast path with distance k, on the average, there are at least (k+1)!/2k adaptive shortest paths, which is superior to previous works. We also propose a heuristic algorithm to reduce the path length. The simulation result shows that its sustainable throughput is much better than related works. In addition, unicast and broadcast can be treated as degenerated cases and use the same routing algorithm. Therefore, it offers a comprehensive routing solution for communication on hypercubes.