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

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 deve...

Full description

Saved in:
Bibliographic Details
Main Authors: Li, Ming, Zeng, Qing-An, Jone, Wen-Ben
Format: Conference Proceeding
Language:English
Subjects:
Hardware > Integrated circuits > Interconnect
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary: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.
DOI:10.1145/1146909.1147125