TY - GEN
T1 - A new fault information model for fault-tolerant adaptive and minimal routing in 3-D meshes
AU - Jiang, Zhen
AU - Wu, Jie
AU - Wang, Dajin
PY - 2005
Y1 - 2005
N2 - In this paper we rewrite Wang's Minimal-Connected-Component (MCC) model [7] in 2-D meshes without using global information so that not only the existence of a minimal path can be ensured at the source, but also such a path can be formed by routing decisions at intermediate nodes along the path. We extend this MCC model and the corresponding routing in 2-D meshes to 3-D meshes. It is based on our early work on fault tolerant adaptive and minimal routing [9] and the boundary information model [8] in 3-D meshes. We study fault tolerant adaptive and minimal routing from the source and the destination and consider the positions of the source and destination when the new faulty components are constructed. Specifically, all faulty nodes will be contained in some disjoint faulty components and a healthy node will be included in a faulty component only if using it in the routing will definitely cause a non-minimal routing path. A sufficient and necessary condition is proposed for the existence of the minimal routing path in the presence of our faulty components. Based on such a condition, the corresponding routing will guarantee a minimal path whenever it exists.
AB - In this paper we rewrite Wang's Minimal-Connected-Component (MCC) model [7] in 2-D meshes without using global information so that not only the existence of a minimal path can be ensured at the source, but also such a path can be formed by routing decisions at intermediate nodes along the path. We extend this MCC model and the corresponding routing in 2-D meshes to 3-D meshes. It is based on our early work on fault tolerant adaptive and minimal routing [9] and the boundary information model [8] in 3-D meshes. We study fault tolerant adaptive and minimal routing from the source and the destination and consider the positions of the source and destination when the new faulty components are constructed. Specifically, all faulty nodes will be contained in some disjoint faulty components and a healthy node will be included in a faulty component only if using it in the routing will definitely cause a non-minimal routing path. A sufficient and necessary condition is proposed for the existence of the minimal routing path in the presence of our faulty components. Based on such a condition, the corresponding routing will guarantee a minimal path whenever it exists.
UR - http://www.scopus.com/inward/record.url?scp=33645216320&partnerID=8YFLogxK
M3 - Conference contribution
AN - SCOPUS:33645216320
SN - 0769523803
SN - 9780769523804
T3 - Proceedings of the International Conference on Parallel Processing
SP - 500
EP - 507
BT - Proceedings - 2005 International Conference on Parallel Processing
T2 - 2005 International Conference on Parallel Processing
Y2 - 14 June 2005 through 17 June 2005
ER -