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

Author

Junshi Wang ; Letian Huang ; Guangjun Li ; Xiaohang Wang ; Mak, Terrence

Author_Institution

Sch. of Commun. & Informaion Eng., Univ. of Electron. Sci. & Technol. of China, Chengdu, China

fYear

2013

fDate

21-22 Dec. 2013

Firstpage

153

Lastpage

158

Abstract

As technology scaling, reliability has became one of the key challenges of Network-on-Chip (NoC). Many fault-tolerant 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.

Keywords

fault tolerance; integrated circuit reliability; low-power electronics; network routing; network-on-chip; FRR; NoC; component states diffusion; destination router; farthest reachable routers; fault components; fault patterns; fault tolerant routing algorithms; network-on-chip; power consumption; reliability; source router; technology scaling; Fault tolerant systems; Partitioning algorithms; Ports (Computers); Redundancy; Routing; farthest reachable router; fault-tolerant routing algorithm; network-on-chip;

fLanguage

English

Publisher

ieee

Conference_Titel

Dependable, Autonomic and Secure Computing (DASC), 2013 IEEE 11th International Conference on

Conference_Location

Chengdu

Print_ISBN

978-1-4799-3380-8

Type

conf

DOI

10.1109/DASC.2013.54

Filename

6844354