Deadlock-Free Message Routing in Multiprocessor Interconnection Networks
IEEE Transactions on Computers
Multicast in hypercube multiprocessors
Journal of Parallel and Distributed Computing
A comparison of adaptive wormhole routing algorithms
ISCA '93 Proceedings of the 20th annual international symposium on computer architecture
Adaptive fault-tolerant multicast in hypercube multicomputers
Journal of Parallel and Distributed Computing
Adaptive multicast wormhole routing in 2D mesh multicomputers
Journal of Parallel and Distributed Computing
A Trip-Based Multicasting Model in Wormhole-Routed Networks with Virtual Channels
IEEE Transactions on Parallel and Distributed Systems
IEEE Transactions on Parallel and Distributed Systems
Deadlock-Free Multicast Wormhole Routing in 2-D Mesh Multicomputers
IEEE Transactions on Parallel and Distributed Systems
Multicast communication algorithm on a wormhole-routed star graph interconnection network
HIPC '96 Proceedings of the Third International Conference on High-Performance Computing (HiPC '96)
IEEE Transactions on Computers
Multi-Node Multicast in Three and Higher Dimensional Wormhole Tori and Meshes with Load Balance
ICPP '00 Proceedings of the Proceedings of the 2000 International Conference on Parallel Processing
| Hi-index | 0.00 |
The existing algorithms for deadlock-free multicasting in interconnection networks assume the Hamiltonian property in the networks topology. However, these networks fail to be Hamiltonian in the presence of faults. This paper investigates the use of Euler circuits in deadlock-free multicasting. Not only are Euler circuits known to exist in all connected networks, a fast polynomial-time algorithm exists to find an Euler circuit in a network. We present a multicasting algorithm which works for both regular and irregular topologies. Our algorithm is applicable to store-and-forward as well as wormhole-routed networks. We show that at most two virtual channels are required per physical channel for any connected network. We also prove that no virtual channels are required to achieve deadlock-free multicasting on a large class of networks. Unlike other existing algorithms for deadlock-free multicasting in faulty networks, our algorithm requires a small amount of information to be stored at each node. The potential of our technique is further illustrated with the help of various examples. A performance analysis on wormhole-routed networks shows that our routing algorithm outperforms existing multicasting procedures.