Deadlock-Free Message Routing in Multiprocessor Interconnection Networks
IEEE Transactions on Computers
A Trip-Based Multicasting Model in Wormhole-Routed Networks with Virtual Channels
IEEE Transactions on Parallel and Distributed Systems
A Broadcast Algorithm for All-Port Wormhole-Routed Torus Networks
IEEE Transactions on Parallel and Distributed Systems
An Improved Algorithm for Fault-Tolerant Wormhole Routing in Meshes
IEEE Transactions on Computers
Multiple Multicast with Minimized Node Contention on Wormhole k-ary n-cube Networks
IEEE Transactions on Parallel and Distributed Systems
Fault-Tolerant Communication Algorithms in Toroidal Networks
IEEE Transactions on Parallel and Distributed Systems
Fault-Tolerant Wormhole Routing Algorithms for Mesh Networks
IEEE Transactions on Computers
Communication in Multicomputers with Nonconvex Faults
IEEE Transactions on Computers
Fault-Tolerant Wormhole Routing Algorithms in Meshes in the Presence of Concave Faults
IPDPS '00 Proceedings of the 14th International Symposium on Parallel and Distributed Processing
Fault-Tolerant Broadcasting in 2-D Wormhole-Routed Meshes
The Journal of Supercomputing
Broadcasting and routing in faulty mesh networks
IPDPS'06 Proceedings of the 20th international conference on Parallel and distributed processing
| Hi-index | 0.00 |
This paper describes a fault-tolerant broadcast algorithm for wormhole-routed torus networks for which there is only local knowledge of faulty components. This algorithm tolerates up to k-1 faulty nodes in a k-ary n-cube provided the faults do not cause the network to be disconnected. Based on fault-tolerant dimension-order unicast communication, this algorithm is deadlock-free and no additional virtual channels are needed. The first stage of this algorithm is itself an optimal broadcast algorithm for a torus if no faults are present. The second stage overcomes the presence of up to k-1 faults with a fixed number of additional message transmissions. Thus, the cost of this algorithm is within a constant factor of the cost of optimal non-faulttolerant broadcast algorithms.