DyXY - A proximity congestion-aware deadlock-free dynamic routing method for Network on Chip

被引:211
作者
Li, Ming [1 ]
Zeng, Qing-An [1 ]
Jone, Wen-Ben [1 ]
机构
[1] Univ Cincinnati, Dept Elect & Comp Engn, Cincinnati, OH 45221 USA
来源
43RD DESIGN AUTOMATION CONFERENCE, PROCEEDINGS 2006 | 2006年
关键词
algorithms; performance; design; Network-on-Chip; packet routing; queuing theory;
D O I
10.1109/DAC.2006.229242
中图分类号
TP3 [计算技术、计算机技术];
学科分类号
0812 ;
摘要
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.
引用
收藏
页码:849 / +
页数:2
相关论文
共 10 条
[1]   Networks on chips: A new SoC paradigm [J].
Benini, L ;
De Micheli, G .
COMPUTER, 2002, 35 (01) :70-+
[2]  
BOURA YM, 1994, INT CON DISTR COMP S, P589, DOI 10.1109/ICDCS.1994.302473
[3]   The odd-even turn model for adaptive routing [J].
Chiu, GM .
IEEE TRANSACTIONS ON PARALLEL AND DISTRIBUTED SYSTEMS, 2000, 11 (07) :729-738
[4]  
CORPORATION I, 1991, INTEL ADV INFORM
[5]   VIRTUAL-CHANNEL FLOW-CONTROL [J].
DALLY, WJ .
IEEE TRANSACTIONS ON PARALLEL AND DISTRIBUTED SYSTEMS, 1992, 3 (02) :194-205
[6]  
Dally WJ, 2001, DES AUT CON, P684, DOI 10.1109/DAC.2001.935594
[7]  
GLASS CJ, 1992, PROC INT CONF PARAL, P101
[8]   THE TURN MODEL FOR ADAPTIVE ROUTING [J].
GLASS, CJ ;
NI, LM .
JOURNAL OF THE ACM, 1994, 41 (05) :874-902
[9]  
Hu JC, 2004, DES AUT CON, P260
[10]  
KLEINROCK L, 1976, QUEUING SYSTEMS