Network-on-Chip routing algorithms by breaking cycles

  • Authors:
  • Minghua Tang;Xiaola Lin

  • Affiliations:
  • School of Information Science and Technology, Sun Yat-sen University, Guangzhou, China;Ministry of Education, Key Laboratory of Digital Life (Sun Yat-sen University), Guangzhou, China

  • Venue:
  • ICA3PP'10 Proceedings of the 10th international conference on Algorithms and Architectures for Parallel Processing - Volume Part I
  • Year:
  • 2010

Quantified Score

Hi-index 0.00

Visualization

Abstract

In this paper, we propose a methodology to design routing algorithms for Network-on-Chip (NoC) which are customized for a set of applications The routing algorithms are achieved by breaking all the cycles in the application specific channel dependency graph(ASCDG) Thus, the result routing algorithms are ensured to be deadlock-free The proposed method can overcome the shortcomings of the method in [1] which heavily depends on the order of the cycles being treated and has high computational complexity Simulation results show that the Routing Algorithms by Breaking Cycles (RABC) improves the performance significantly.