Browse > Article

Fault-Tolerant Adaptive Routing : Improved RIFP by using SCP in Mesh Multicomputers  

정성우 (㈜디비엠코리아)
김성천 (서강대학교 컴퓨터학과)
Publication Information
Journal of KIISE:Computer Systems and Theory / v.30, no.11, 2003 , pp. 603-609 More about this Journal
Abstract
Adaptive routing methods are studied for effective routing in many topologies where occurrence of the faulty nodes are inevitable. Mesh topology provides simplicity in implementing these methods. Many routing methods for mesh are able to tolerate a large number of faults enclosed by a rectangular faulty block. But they consider even good nodes in the faulty block as faulty nodes. Hence, it results the degradation of node utilization. This problem is solved by a method which transmits messages to destinations within faulty blocks via multiple “intermediate nodes”. It also divides faulty block into multiple expanded meshes. With these expanded meshes, DAG(Directed Acyclic Graph) is formed and a message is able to be routed by the shortest path according to the DAG. Therefore, the additional number of hops can be resulted. We propose a method that reduces the number of hops by searching direct paths from the destination node to the border of the faulty block. This path is called SCP(Short-Cut Path). If the path and the traversing message is on the same side of outside border of the faulty block, the message will cut into the path found by our method. It also reduces the message traverse latency between the source and the destination node.
Keywords
DAG; Fault-Tolerant; adaptive routing; mesh; faulty block;
Citations & Related Records
연도 인용수 순위
  • Reference
1 J. Duato, 'A Theory of Fault-Tolerant Routing in Wormhole Networks,' IEEE Trans. Parallel and Distributed Systems, vol. 8, no. 8, pp.790-802, Aug. 1997   DOI   ScienceOn
2 D. Linder and J. Harden, 'An Adaptive and Fault-Tolerant Wormhole Routing Strategy for k-ary n-cubes,' IEEE Trans. Computers, vol.40, pp.2-12, 1991   DOI   ScienceOn
3 K.M.Al-Tawil, M. Abd-Abd-Barr, and F. Ashraf, 'A Survey and Comparison of Wormhole Routing Techniques in Mesh Networks,' IEEE Network, pp.38-45, Mar. 1997   DOI   ScienceOn
4 R.V. Boppana and S. Chalasani, 'Fault-Tolerant Wormhole Routing Algorithms for Mesh Networks,' IEEE Trans. Computers, vol.44, pp.848-864, 1995   DOI   ScienceOn
5 C.C. Su and K.G. Shin, 'Adaptive Fault-Tolerant Deadlock-Free Routing in Meshes and Hypercubes,' IEEE Trans. Computers, vol.45, pp.666-683, June 1996   DOI   ScienceOn
6 C. Glass and L. Ni, 'Fault-Tolerant Wormhole Routing in Meshes,' 23rd Int'l Symp. Fault-Tolerant Computing, pp.240-249, 1993   DOI
7 M.J. Tsai and S.D. Wang, 'Adaptive and Deadlock-Free Routing for Irregular Faulty Pattern in Mesh Multicomputers,' IEEE Trans. Parallel and Distribute Systems, vol.11, no.1, pp50-62, Jan. 2000   DOI   ScienceOn