A Deadlock-Free and Connectivity-Guaranteed Methodology for Achieving Fault-Tolerance in On-Chip Networks.

To improve the reliability of on-chip network based systems, we design a deadlock-free routing technique that is more resilient to component failures and guarantees a higher degree of node connectivity. The routing methodology consists of three key steps. First, we determine the maximal connected subgraph of the faulty network by checking whether the defective components happen to be the cut vertices and bridges of the network topology. A precise fault diagnosis mechanism is used to identify partial defective routers. Second, we construct an acyclic channel dependency graph that breaks all cycles and preserves connectivity of the maximal connected subgraph. This is done through the cycle-breaking and connectivity guaranteed (CBCG) algorithm. Finally, we introduce a fault-tolerant adaptive routing scheme that can be used with or without virtual channels for network congestion avoidance and high-throughput routing. The simulation results show both the effectiveness and robustness of the proposed approach. For an $8 \times 8$ <alternatives><inline-graphic xlink:type="simple" xlink:href="ren-ieq1-2425887.gif"/></alternatives> 2D-Mesh with 40 percent of link damage, full connectivity and deadlock freedom are still archived without disabling any faultless router in 98.18 percent of the simulations. In a 2D-Torus, the simulation percentage is even higher (99.93 percent). The hardware overhead for supporting the introduced features is minimal. An on-line implementation of <sc>cbcg</sc> using TSMC 65nm library has only 0.966 and 1.139 percent area overhead for the $8\times8$ <alternatives><inline-graphic xlink:type="simple" xlink:href="ren-ieq2-2425887.gif"/></alternatives> and $16 \times 16$<alternatives><inline-graphic xlink:type="simple" xlink:href="ren-ieq3-2425887.gif"/> </alternatives> 2D-Meshes. [ABSTRACT FROM AUTHOR]