Title :
A scalable and fault-tolerant routing algorithm for NoCs
Author :
Shi, Zewen ; You, Kaidi ; Ying, Yan ; Huang, Bei ; Zeng, Xiaoyang ; Yu, Zhiyi
Author_Institution :
State Key Lab. of ASIC & Syst., Fudan Univ., Shanghai, China
fDate :
May 30 2010-June 2 2010
Abstract :
Computing design has been moving to multi-core or many-core domain and Network-on-chip (NoC) is upcoming. However, manufacturing defects and hard malfunction are inevitable, and fault-tolerant routing algorithm is important to provide the required communication in spite of failures. The proposed algorithm, referred to as scalable and fault-tolerant distributed routing (SFDR), partitions the system into nine regions using the concept of divide-and-conquer. Each region guarantees fault-tolerance of one´s own area and the whole system still works no matter where the fault node locates. The novel routing algorithm has excellent scalability with hardware cost keeping constant independent of system size. The router has been synthesized using SMIC 0.13um CMOS process and there is almost no hardware overhead compared to Logic-Based Distributed Routing (LBDR) which is only partially fault-tolerant and hardware cost reduces up to 42% compared to table-based routing.
Keywords :
CMOS logic circuits; divide and conquer methods; fault tolerance; network routing; network-on-chip; CMOS; SMIC; computing design; divide-and-conquer; fault-tolerant routing algorithm; logic-based distributed routing; many-core domain; multi-core domain; network-on-chip; scalable routing algorithm; Computer networks; Costs; Fault tolerance; Fault tolerant systems; Hardware; Manufacturing; Network-on-a-chip; Partitioning algorithms; Routing; Scalability;
Conference_Titel :
Circuits and Systems (ISCAS), Proceedings of 2010 IEEE International Symposium on
Conference_Location :
Paris
Print_ISBN :
978-1-4244-5308-5
Electronic_ISBN :
978-1-4244-5309-2
DOI :
10.1109/ISCAS.2010.5538017