Non-minimal, turn-model based NoC routing

  • Authors:
  • Wen-Chung Tsai;Kuo-Chih Chu;Yu-Hen Hu;Sao-Jie Chen

  • Affiliations:
  • Information and Communications Research Laboratories, Industrial Technology Research Institute, Hsinchu 310, Taiwan, ROC;Department of Electronic Engineering, Lunghwa University of Science and Technology, Taoyuan 333, Taiwan, ROC;Department of Electrical and Computer Engineering, University of Wisconsin-Madison, Madison, WI 53706-1691, USA;Department of Electrical Engineering, Graduate Institute of Electronics Engineering, National Taiwan University, Taipei 106, Taiwan, ROC

  • Venue:
  • Microprocessors & Microsystems
  • Year:
  • 2013

Quantified Score

Hi-index 0.00

Visualization

Abstract

In this study, it is shown that any deadlock-free, turn-model based minimal routing algorithm can be extended to a non-minimal routing algorithm. Specifically, three novel non-minimal NoC routing algorithms are proposed based on the Odd-Even, West-First, and Negative-First turn models, respectively. These algorithms are not only deadlock free and livelock free, but can also leverage non-minimal routing paths to avoid traffic congestion and improve fault tolerance. Moreover, these algorithms are backward compatible with existing minimal routing schemes. As a result, they represent an ideal routing solution to NoC-based interconnections designed for both existing and emerging embedded multicore systems.