Adaptive Fault-tolerant Wormhole Routing in 2D Meshes
IPDPS '01 Proceedings of the 15th International Parallel & Distributed Processing Symposium
Multi-phase minimal fault-tolerant wormhole routing in meshes
Parallel Computing
Fault-tolerant wormhole routing with 2 virtual channels in meshes
Journal of Computer Science and Technology
Deadlock free routing algorithms for irregular mesh topology NoC systems with rectangular regions
Journal of Systems Architecture: the EUROMICRO Journal
Fault-tolerant wormhole routing algorithm in 2D meshes without virtual channels
ISPA'04 Proceedings of the Second international conference on Parallel and Distributed Processing and Applications
Improving a fault-tolerant routing algorithm using detailed traffic analysis
HPCC'07 Proceedings of the Third international conference on High Performance Computing and Communications
Hi-index | 0.00 |
A deterministic fault-tolerant wormhole routing algorithm is presented for mesh networks in this paper. The proposed algorithm can tolerate convex fault-connected regions with only three virtual channels per physical channel, and overlapping of processors along the boundaries of different fault regions is allowed. The proposed algorithm, which routes the messages by XY routing algorithm in the fault-free regions, is deadlock-and livelock-flee.