Performance analysis of minimal path fault tolerant routing in NoC

详细信息    查看全文

• 作者：Mushtaq Ahmed (1)
  V. Laxmi (1)
  M. S. Gaur (1)
  
• 关键词：Minimal path Fault Tolerant (MinFT) ; Adaptive Routing ; Network on Chip (NoC) ; TP302
• 刊名：Journal of Electronics (China)
• 出版年：2011
• 出版时间：November 2011
• 年：2011
• 卷：28
• 期：4-6
• 页码：587-595
• 全文大小：596KB
• 参考文献：1. C. J. Glass and L. M. Ni. The turn model for adaptive routing. / Journal of the ACM, 41(1994)5, 874鈥?02. CrossRef
  2. Ge-Ming Chiu. The odd-even turn model for adaptive routing. / IEEE Transactions on Parallel and Distributed Systems, 11(2000)7, 729鈥?38. CrossRef
  3. J. Wu. A fault tolerant and deadlock free routing protocol in 2D Meshes based on ODD-EVEN turn model. / IEEE Transactions on Computers, 52(2003)9, 1154鈥?169. CrossRef
  4. T. Dumitras, S. Kerner, and R. Marculescu. Towards on-chip fault tolerant communication. Proceedings of the 40th Design Automation Conference, Jan. 21鈥?4, 2003, 225鈥?32.
  5. M. Pirretti, G. M. Link, R. R. Brooks. N. Vijaykrishnan, M. Kandemir, and M. J. Irwin. Fault tolerant algorithms for network-on-chip interconnect. IEEE Computer Society Annual Symposium on VLSI, Feb. 19鈥?0, 2004, 46鈥?1.
  6. H. Zhu, P. P. Pande, and C. Grecu. Performance evaluation of adaptive routing algorithms for achieving fault tolerance in NoC fabrics. IEEE International Conference on Application-specific Systems, Architectures and Processors, 2007, 42鈥?7.
  7. Yonghui Li and Huaxi Gu. Fault tolerant routing algorithm based on the artificial potential field model in Network-on-Chip. / Journal of Applied Mathematics and Computation, 217(2010)4, 3226鈥?235. CrossRef
  8. R. Rameshan, M. Ahmed, V. Laxmi, and M. S. Gaur. Minimal path, fault tolerant routing in 2-D mesh NoC. VLSI design and Test, July 7鈥?, 2010, 62鈥?6.
  9. J. Duato. A theory of fault tolerant routing in worm hole network. / IEEE Transaction on Parallel and Distributed systems, 8(1997)8, 790鈥?01. CrossRef
  10. J. Duato. A new theory of deadlock free adaptive routing in wormhole Networks. / IEEE Transaction on Parallel and Distributed Systems, 4(2003)12, 1320鈥?331. CrossRef
  11. M. S. Gaur, V. Laxmi, M. Ahmed, et al. Minimal path, fault tolerant, QoS aware routing with node and Llnk Failure in 2-D Mesh NoC. IEEE symposium on Defect and Fault Tolerance, Oct. 6鈥?, 2010, Kyoto, 60鈥?6.
  12. Lavina Jain, B. M. Al-Hashimi, M. S. Gaur, V. Laxmi, and A. Narayanan. NIRGAM: A simulator for NoC interconnect routing and modelling. Design, Automation and Test in Europe, Nice, France, April 16鈥?0, 2007, 382鈥?83.
  
• 作者单位：Mushtaq Ahmed (1)
  V. Laxmi (1)
  M. S. Gaur (1)
  
  1. Department of Computer Engineering, Malaviya National Institute of Technology, Jaipur, 3020017, India
  
• ISSN：1993-0615

文摘

Occurrence of faults in Network on Chip (NoC) is inevitable as the feature size is continuously decreasing and processing elements are increasing in numbers. Faults can be revocable if it is transient. Transient fault may occur inside router, or in the core or in communication wires. Examples of transient faults are overflow of buffers in router, clock skew, cross talk, etc.. Revocation of transient faults can be done by retransmission of faulty packets using oblivious or adaptive routing algorithms. Irrevocable faults causes non-functionality of segment and mainly occurs during fabrication process. NoC reliability increases with the efficient routing algorithms, which can handle the maximum faults without deadlock in network. As transient faults are temporary and can be easily revoked using retransmission of packet, permanent faults require efficient routing to route the packet by bypassing the nonfunctional segments. Thus, our focus is on the analysis of adaptive minimal path fault tolerant routing to handle the permanent faults. Comparative analysis between partial adaptive fault tolerance routing West-First, North-Last, Negative-First, Odd Even, and Minimal path Fault Tolerant routing (MinFT) algorithms with the nodes and links failure is performed using NoC Interconnect RoutinG and Application Modeling simulator (NIRGAM) for the 2D Mesh topology. Result suggests that MinFT ensures data transmission under worst conditions as compared to other adaptive routing algorithms.