Deadlock-Free Message Routing in Multiprocessor Interconnection Networks
IEEE Transactions on Computers
An Adaptive and Fault Tolerant Wormhole Routing Strategy for k-ary n-cubes
IEEE Transactions on Computers
Planar-adaptive routing: low-cost adaptive networks for multiprocessors
ISCA '92 Proceedings of the 19th annual international symposium on Computer architecture
A New Theory of Deadlock-Free Adaptive Routing in Wormhole Networks
IEEE Transactions on Parallel and Distributed Systems
Adaptive Fault-Tolerant Deadlock-Free Routing in Meshes and Hypercubes
IEEE Transactions on Computers
An Improved Algorithm for Fault-Tolerant Wormhole Routing in Meshes
IEEE Transactions on Computers
A Fault-Tolerant Routing Scheme for Meshes with Nonconvex Faults
IEEE Transactions on Parallel and Distributed Systems
Interconnection Networks: An Engineering Approach
Interconnection Networks: An Engineering Approach
Fault-Tolerant Wormhole Routing Algorithms for Mesh Networks
IEEE Transactions on Computers
Communication in Multicomputers with Nonconvex Faults
IEEE Transactions on Computers
Adaptive Fault-Tolerant Wormhole Routing Algorithms for Hypercube and Mesh Interconnection
IPPS '97 Proceedings of the 11th International Symposium on Parallel Processing
A Fault-Tolerant and Deadlock-Free Routing Protocol in 2D Meshes Based on Odd-Even Turn Model
IEEE Transactions on Computers
A New Approach to Fault-Tolerant Wormhole Routing for Mesh-Connected Parallel Computers
IEEE Transactions on Computers
XMulator: A Listener-Based Integrated Simulation Platform for Interconnection Networks
AMS '07 Proceedings of the First Asia International Conference on Modelling & Simulation
A new adaptive fault-tolerant routing methodology for direct networks
HiPC'04 Proceedings of the 11th international conference on High Performance Computing
| Hi-index | 0.00 |
We propose a partially adaptive fault-tolerant and deadlock-free routing algorithm in n-dimensional meshes based on the fault-tolerant planar-adaptive routing and Duato's protocol. In particular, we show that only four virtual channels per physical channel are sufficient for tolerating multiple faulty regions even in the case of n-dimensional meshes. Our scheme is able to handle faulty blocks whose associated fault rings have overlaps. In addition, it can be used to route messages when fault regions touch the boundaries of the mesh. A flag bit is introduced for guiding misrouted messages. Messages are routed adaptively in healthy regions of the network. Once a message faces a faulty region, it is routed around it using a non-minimal path. A flit-level simulator is employed to evaluate the performance of the proposed algorithm and to compare its performance to those already introduced.