Dynamic Intermediate Node Algorithm (DINA); a novel fault tolerance routing methodology for NoC’s

In this paper we present a methodology to design fault-tolerant routing algorithms for two-dimensional mesh networks. Our methodology, Dynamic intermediate node algorithm (DINA) supports fully adaptive routing, does not degrade performance in the absence of faults, and supports a reasonably large number of faults without significantly degrading performance. Consequently, this work examines fault tolerant communication algorithms for use in the NoC domain. Before two different flooding algorithms and a random walk algorithm have been investigated. These algorithms have an exceedingly high communication overhead and cause huge congestion in usual traffics. We show that our proposed algorithm offers significantly reduced overhead while maintaining useful levels of fault tolerance and load balancing.