Issue No.03 - March (2003 vol.52)
Dajin Wang , IEEE
<p><b>Abstract</b>—We propose a new fault block model, Minimal-Connected-Component (MCC), for fault-tolerant adaptive routing in mesh-connected multiprocessor systems. This model refines the widely used rectangular model by including fewer nonfaulty nodes in fault blocks. The positions of source/destination nodes relative to faulty nodes are taken into consideration when constructing fault blocks. The main idea behind it is that a node will be included in a fault block only if using it in a routing will definitely make the route nonminimal. The resulting fault blocks are of the <it>rectilinear-monotone polygonal</it> shapes. A sufficient and necessary condition is proposed for the existence of the minimal “Manhattan” routes in the presence of such fault blocks. Based on the condition, an algorithm is proposed to determine the existence of Manhattan routes. Since MCC is designed to facilitate minimal route finding, if there exists no minimal route under MCC fault model, then there will be absolutely no minimal route whatsoever. We will also present two adaptive routing algorithms that construct a Manhattan route avoiding all fault blocks, should such routes exist.</p>
Adaptive routing, fault model, fault tolerance, interconnection network, mesh.
Dajin Wang, "A Rectilinear-Monotone Polygonal Fault Block Model for Fault-Tolerant Minimal Routing in Mesh", IEEE Transactions on Computers, vol.52, no. 3, pp. 310-320, March 2003, doi:10.1109/TC.2003.1183946