DyXY: a proximity congestion-aware deadlock-free dynamic routing method for network on chip

  • Authors:
  • Ming Li;Qing-An Zeng;Wen-Ben Jone

  • Affiliations:
  • University of Cincinnati. Cincinnati, OH;University of Cincinnati. Cincinnati, OH;University of Cincinnati. Cincinnati, OH

  • Venue:
  • Proceedings of the 43rd annual Design Automation Conference
  • Year:
  • 2006

Quantified Score

Hi-index 0.00

Visualization

Abstract

A novel routing algorithm, namely dynamic XY (DyXY) routing, is proposed for NoCs to provide adaptive routing and ensure deadlock-free and livelock-free routing at the same time.A new router architecture is developed to support the routing algorithm.Analytical models based on queuing theory are developed for DyXY routing for a two-dimensional mesh NoC architecture,and analytical results match very well with the simulation results.It is observed that DyXY routing can achieve better performance compared with static XY routing and odd-even routing.