Parameterized path based randomized oblivious minimal path routing with fault tolerance in 2D mesh network on chip

Abstract

Fault tolerance has become one of the major concerns in routers or links as the transistor feature size is shrinking leading to gate scaling in Network on Chip (NoC). More number of processing elements (PE) are being incorporated for interconnection in system on chip, making it difficult to deliver packets to the destination. Overcome from permanent fault can be achieved using efficient routing algorithms whereas retransmission of faulty packet resolve transient faults in the network. Routing would be efficient, if it can handle multiple faults in the path while managing congestion in the network. In this paper a path based randomized oblivious minimal routing algorithm (FTPROM) with fault tolerance is proposed. FTPROM is derived from parameterized PROM is an oblivious routing. It uses probability functions to provide more diversity to route in the network and handles congestion in better way. Routing follows minimal path in presence of faults both as node and link failure. Simulation results show that the proposed algorithm is effective in terms of congestion handling, latency, and degree of adaptiveness. © 2012 Springer-Verlag GmbH.