Parameterized Path Based Randomized Oblivious Minimal Path Routing with Fault Tolerance in 2D Mesh Network on Chip
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.
KeywordsSource Node Destination Node Fault Tolerance Link Failure Path Selection
Unable to display preview. Download preview PDF.
- 1.Lehtonen, T., Liljeberg, P., Plosila, J.: Fault Tolerant Distributed Routing Algorithms for Mesh Networks-on-Chip. In: ISSCS 2009, pp. 1–4 (2009)Google Scholar
- 3.Pirretti, M., Link, G.M., Brooks, R.R., Vijaykrishnan, N., Kandemir, M., Irwin, M.J.: Fault Tolerant Algorithms for NoC Interconnect. In: Proceedings of ISVLSI, pp. 46–51 (February 2004)Google Scholar
- 4.Dumitras, T., Kerner, S., Marculescu, R.: Towards on-chip fault tolerant communication. In: Proceedings of the 40th Design Automation Conference, DAC 2003, January 21-24, pp. 225–232 (2003)Google Scholar
- 6.Zhen, Z., Alain, G., Sami, T.: A Reconfigurable Routing Algorithm for a Fault Tolerant 2D Mesh Network on Chip. In: DAC, pp. 441–446 (2008)Google Scholar
- 7.Cho, M.H., Lis, M., Shim, K.S., Kinsy, M., Devadas, S.: Path-Based, Randomized, Oblivious, Minimal Routing. In: NoCArc, pp. 23–28 (2009)Google Scholar
- 9.Jain, L., Al-Hashimi, B.M., Gaur, M.S., Laxmi, V., Narayanan, A.: NIRGAM: A Simulator for NoC Interconnect Routing and Modelling. In: Design, Automation and Test in Europe (DATE 2007), April 16-20 (2007)Google Scholar
- 10.Gaur, M.S., Laxmi, V., Ahmed, M., et al.: Minimal path, Fault Tolerant, QoS aware Routing with node and link failure in 2-D Mesh NoC. In: IEEE Symposium Defect and Fault Tolerance DFTS 2010, October 6-8, pp. 60–66 (2010)Google Scholar
- 11.Kahng, A.B., Li, B., Peh, L.-S., Samadi, K.: ORION 2.0: A Fast and Accurate NoC Power and Area Model for Early-Stage Design Space Exploration. In: DATE 2009, pp. 423–428 (2009)Google Scholar