A Fault-Tolerant Routing Algorithm for NoC Using Farthest Reachable Routers

Abstract

As technology scaling, reliability has became one of the key challenges of Network-on-Chip (NoC). Many faulttolerant routing algorithms for NoC are developed to overcome fault components and provide reliable transmission. But proposed routing algorithms do not pay enough attention to find the shortest paths, which increases latency and power consumption. In this paper, a fault-tolerant routing algorithm using new component states diffusion method based on Farthest Reachable Router (FRR) is proposed. This algorithm can reduce latency by finding the shortest paths between source and destination routers. Experiment results verify that FRR routing algorithm can tolerate 79% fault patterns within 3 × 3 and reduce latency by 16-44% compared with FON.

MUGEN: A high-performance fault-tolerant routing algorithm for unreliable Networks-on-Chip

“…This information is propagated using extra wires between routers. In [4], each router stores information about the farthest reachable router in each direction. Techniques using non-local fault information have proven to be much more efficient than algorithms relying solely on local link state, even though some ideas used in the latter group of algorithms are promising.…”