A Simple and Efficient Fault-Tolerant Adaptive Routing Algorithm for Meshes

Authors:
Arash Shamaei;Abbas Nayebi;Hamid Sarbazi-Azad
Affiliations:
IPM School of Computer Science, and Payeme Noor University,;IPM School of Computer Science, and Sharif University of Technology, Tehran, Iran;IPM School of Computer Science, and Sharif University of Technology, Tehran, Iran
Venue:
ICA3PP '08 Proceedings of the 8th international conference on Algorithms and Architectures for Parallel Processing
Year:
2008

Citing 5
Cited 0

Deadlock-Free Message Routing in Multiprocessor Interconnection Networks

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
Interconnection Networks: An Engineering Approach

Interconnection Networks: An Engineering Approach
Fault-Tolerant Wormhole Routing Algorithms for Mesh Networks

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

Quantified Score

Hi-index	0.00

Visualization

Abstract

The planar-adaptive routing algorithm is a simple method to enhance wormhole routing algorithms for fault-tolerance in meshes but it cannot handle faults on the boundaries of mesh without excessive loss of performance. In this paper, we show that this algorithm can further be improved using a flag bit introduced for guiding misrouted messages. So, the proposed algorithm can be used to route messages when fault regions touch the boundaries of the mesh. We also show that our scheme does not lead to diminish the performance of the network and only three virtual channels per physical channels are sufficient for tolerating multiple boundary faulty regions.