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

Author

Li, Ming ; Zeng, Qing-An ; Jone, Wen-Ben

Author_Institution

Dept. of Electr. & Comput. Eng., Cincinnati Univ., OH

fYear

0

fDate

0-0 0

Firstpage

849

Lastpage

852

Abstract

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

Keywords

integrated circuit design; microprocessor chips; multiprocessor interconnection networks; network routing; network-on-chip; queueing theory; DyXY routing; adaptive routing; analytical models; congestion-aware routing; deadlock-free routing; dynamic XY routing; dynamic routing; livelock-free routing; network on chip; odd-even routing; proximity routing; queuing theory; router architecture; static XY routing; Algorithm design and analysis; Analytical models; Computer architecture; Computer networks; Computer science; Network-on-a-chip; Queueing analysis; Routing; Switches; System recovery; Algorithms; Design; Network-on-Chip; Packet Routing; Performance; Queuing Theory;

fLanguage

English

Publisher

ieee

Conference_Titel

Design Automation Conference, 2006 43rd ACM/IEEE

Conference_Location

San Francisco, CA

ISSN

0738-100X

Print_ISBN

1-59593-381-6

Type

conf

DOI

10.1109/DAC.2006.229242

Filename

1688915