Fault-Tolerant Networks-on-Chip Routing with Coarse and Fine-Grained Look-ahead

Research output: Contribution to journalArticle

31 Citations (Scopus)

Abstract

Fault tolerance and adaptive capabilities are challenges for modern Networks-on-Chip (NoC) due to the increase in physical defects in advanced manufacturing processes. Two novel adaptive routing algorithms, namely coarse and fine-grained look-ahead algorithms, are proposed in this paper to enhance 2D mesh/torus NoC system fault-tolerant capabilities. These strategies use fault-flag codes from neighbouring nodes to obtain the status or conditions of real-time traffic in a NoC region; then calculate the path weights and choose the route to forward packets. This approach enables the router to minimise congestion for the adjacent connected channels and also to bypass a path with faulty channels by looking ahead at distant neighbouring router paths. The novelty of the proposed routing algorithms is the weighted path selection strategies, which make near-optimal routing decisions to maintain the NoC system performance under high fault rates. Results show that the proposed routing algorithms can achieve performance improvement compared to other state of the art works under various traffic loads and high fault rates. The routing algorithm with fine-grained look-ahead capability achieves a higher throughput compared with the coarse-grained approach under complex fault patterns. The hardware area/power overheads of both routing approaches are relatively low which does not prohibit scalability for large scale NoC implementations.
Original languageEnglish
JournalIEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems
Volume2015
DOIs
Publication statusPublished - 22 Jul 2015

Keywords

  • Networks-on-Chip
  • adaptive routing
  • fault tolerance
  • hardware reliability

Fingerprint Dive into the research topics of 'Fault-Tolerant Networks-on-Chip Routing with Coarse and Fine-Grained Look-ahead'. Together they form a unique fingerprint.

  • Cite this