Optimum Broadcasting and Personalized Communication in Hypercubes
IEEE Transactions on Computers
Optimal communication algorithms for hypercubes
Journal of Parallel and Distributed Computing
Constructing Parallel Paths Between Two Subcubes
IEEE Transactions on Computers
A Trip-Based Multicasting Model in Wormhole-Routed Networks with Virtual Channels
IEEE Transactions on Parallel and Distributed Systems
Discrete Mathematics and Its Applications
Discrete Mathematics and Its Applications
Fault-Tolerant Wormhole Routing Algorithms for Mesh Networks
IEEE Transactions on Computers
Efficient Routing Schemes for Multiple Broadcasts in Hypercubes
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
An Euler Path Based Technique for Deadlock-free Multicasting
ICPP '97 Proceedings of the international Conference on Parallel Processing
ICPP '98 Proceedings of the 1998 International Conference on Parallel Processing
Multidestination Message Passing Mechanism Conforming to Base Wormhole Routing Scheme
PCRCW '94 Proceedings of the First International Workshop on Parallel Computer Routing and Communication
Communication in Multicomputers with Nonconvex Faults
Euro-Par '95 Proceedings of the First International Euro-Par Conference on Parallel Processing
Turn grouping for efficient multicast in wormhole mesh networks
FRONTIERS '96 Proceedings of the 6th Symposium on the Frontiers of Massively Parallel Computation
Fault-Tolerant Multicast Routing in the Mesh with No Virtual Channels
HPCA '96 Proceedings of the 2nd IEEE Symposium on High-Performance Computer Architecture
A survey and comparison of wormhole routing techniques in a mesh networks
IEEE Network: The Magazine of Global Internetworking
Dual-tree-based multicasting on wormhole-routed irregular switch-based networks
Journal of Systems Architecture: the EUROMICRO Journal
Multipath-Based Multicasting Strategies for Wormhole-Routed Star Graph Interconnection Networks
The Journal of Supercomputing
Multicast communication in wormhole-routed symmetric networks with hamiltonian cycle model
Journal of Systems Architecture: the EUROMICRO Journal
Multicast communication in wormhole-routed 2D torus networks with hamiltonian cycle model
Journal of Systems Architecture: the EUROMICRO Journal
| Hi-index | 14.98 |
Recently, wormhole routers with multidestination capability have been proposed to support fast multicast in a multicomputer network. To avoid communication deadlock, existing results have proposed to construct a Hamilton path, Euler path, trip, or their variants in the network, perhaps with some degree of support of virtual channels [1], [14], [15], [18], [23]. In this paper, we identify that a network which is itself Eulerian or is Eulerian after some links are removed, can enjoy the multidestination capability without support of virtual channels. From this definition, we then develop several techniques to achieve fault-tolerant multicast in a torus/mesh of any dimension with regular fault patterns (such as single node, block, L-shape, T-shape, $+$-shape, U-shape, and H-shape) and even irregular fault patterns. The result improves over existing results on the requirement of support of virtual channels and fault-tolerant capability. Simulation results on tori are presented.