This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
An Improved Algorithm for Fault-Tolerant Wormhole Routing in Meshes
September 1997 (vol. 46 no. 9)
pp. 1040-1042

Abstract—Boppana and Chalasani [1] present simple methods to enhance wormhole routing algorithms for fault-tolerance in meshes. In this brief paper, we note that one of their algorithms, f-cube4, can further be improved. In particular, we show that only three virtual channels per physical channel are sufficient for tolerating multiple faulty regions. We also show that our scheme does not lead to deadlock with any combination of faults, while f-cube4 leads to deadlocks for some extreme combinations of fault regions.

[1] R. Boppana and S. Chalasani, "Fault-Tolerant Wormhole Routing Algorithms for Mesh Networks," IEEE Trans. Computers, vol. 44, no. 7, pp. 848-864, July 1995.
[2] D.H. Linder and J.C. Harden, "An Adaptive and Fault Tolerant Wormhole Routing Strategy for k-Ary n-Cubes," IEEE Trans. Computers, vol. 40, no. 1, pp. 2-12, Jan. 1991.
[3] A.A. Chien and J.H. Kim, "Planar-Adaptive Routing: Low-Cost Adaptive Networks for Multiprocessors," Proc. 19th Int'l Symp. Computer Architecture, vol. 20, no. 2, pp. 268-277, May 1992.
[4] C. Su and K. G. Shin, “Adaptive Fault Tolerant Deadlock-Free Routing in Meshes and Hypercubes,” IEEE Trans. Computers, vol. 45, no. 6, pp. 666–683, June 1996.
[5] W.J. Dally and C.L. Seitz, “Deadlock-Free Message Routing in Multiprocessor Interconnection Networks,” IEEE Trans. Computers, Vol. C-36, No. 5, May 1987, pp. 547-553.

Index Terms:
Fault-tolerant, deadlock, wormhole routing, virtual channel, channel dependency.
Citation:
Pao-Hwa Sui, Sheng-De Wang, "An Improved Algorithm for Fault-Tolerant Wormhole Routing in Meshes," IEEE Transactions on Computers, vol. 46, no. 9, pp. 1040-1042, Sept. 1997, doi:10.1109/12.620485
Usage of this product signifies your acceptance of the Terms of Use.