Path-Diversity-Aware Fault-Tolerant Routing Algorithm for Network-on-Chip Systems
Autor: | An-Yeu Andy Wu, Hsien-Kai Hsin, En-Jui Chang, Kun-Chih Jimmy Chen, Y.G. Chen |
---|---|
Rok vydání: | 2017 |
Předmět: |
Routing protocol
Dynamic Source Routing Computer science Equal-cost multi-path routing Routing table Distributed computing Enhanced Interior Gateway Routing Protocol Wireless Routing Protocol Geographic routing Hardware_PERFORMANCEANDRELIABILITY 02 engineering and technology Routing Information Protocol 0202 electrical engineering electronic engineering information engineering Destination-Sequenced Distance Vector routing Hierarchical routing Zone Routing Protocol Static routing Network packet business.industry Policy-based routing Path vector protocol 020206 networking & telecommunications 020202 computer hardware & architecture Network on a chip Computational Theory and Mathematics Routing domain Link-state routing protocol Hardware and Architecture Signal Processing Multipath routing business Computer network |
Zdroj: | IEEE Transactions on Parallel and Distributed Systems. 28:838-849 |
ISSN: | 2161-9883 1045-9219 |
DOI: | 10.1109/tpds.2016.2588482 |
Popis: | Network-on-Chip (NoC) is the regular and scalable design architecture for chip multiprocessor (CMP) systems. With the increasing number of cores and the scaling of network in deep submicron (DSM) technology, the NoC systems become subject to manufacturing defects and have low production yield. Due to the fault issues, the reduction in the number of available routing paths for packet delivery may cause severe traffic congestion and even to a system crash. Therefore, the fault-tolerant routing algorithm is desired to maintain the correctness of system functionality. To overcome fault problems, conventional fault-tolerant routing algorithms employ fault information and buffer occupancy information of the local regions. However, the information only provides a limited view of traffic in the network, which still results in heavy traffic congestion. To achieve fault-resilient packet delivery and traffic balancing, this work proposes a Path-Diversity-Aware Fault-Tolerant Routing ( PDA-FTR ) algorithm, which simultaneously considers path diversity information and buffer information. Compared with other fault-tolerant routing algorithms, the proposed work can improve average saturation throughput by 175 percent with only 8.9 percent average area overhead and 7.1 percent average power overhead. |
Databáze: | OpenAIRE |
Externí odkaz: |