Very-large-scale network-on-chip (VLS-NoC) has become a promising fabric for supercomputers, but this fabric may encounter the many-fault problem. This article proposes a deterministic routing algorithm to tolerate the effects of many faults in VLS-NoCs. This approach generates routing tables offline using a breadth-first traversal algorithm and stores a routing table locally in each switch for online packet transmission. The approach applies the Tarjan algorithm to degrade the faulty NoC and maximizes the number of available nodes in the reconfigured NoC. In 2D NoCs, the approach updates routing tables of some nodes using the deprecated channel/node rules and avoids deadlocks in the NoC. In 3D NoCs, the approach uses a forbidden-turn selection algorithm and detour rules to prevent faceted rings and ensures the NoC is deadlock-free. Experimental results demonstrate that the proposed approach provides fault-free communications of 2D and 3D NoCs after injecting 40 faulty links. Meanwhile, it maximizes the number of available nodes in the reconfigured NoC. The approach also outperforms existing algorithms in terms of average latency, throughput, and energy consumption.

中文翻译：

---

一种在超大规模片上网络上容错多故障的确定性路径路由算法

超大规模片上网络（VLS-NoC）已成为一种很有前途的超级计算机结构，但这种结构可能会遇到多故障问题。本文提出了一种确定性路由算法来容忍 VLS-NoC 中许多故障的影响。该方法使用广度优先遍历算法离线生成路由表，并在每个交换机本地存储路由表，用于在线数据包传输。该方法应用 Tarjan 算法来降级故障 NoC 并最大化重新配置的 NoC 中的可用节点数。在 2D NoC 中，该方法使用已弃用的通道/节点规则更新某些节点的路由表，并避免 NoC 中的死锁。在 3D NoC 中，该方法使用禁止转弯选择算法和绕行规则来防止刻面环并确保 NoC 无死锁。实验结果表明，所提出的方法在注入 40 个故障链路后提供了 2D 和 3D NoC 的无故障通信。同时，它使重新配置的 NoC 中可用节点的数量最大化。该方法在平均延迟、吞吐量和能耗方面也优于现有算法。