The adaptive bubble router

被引:76
作者
Puente, V [1 ]
Izu, C
Beivide, R
Gregorio, JA
Vallejo, F
Prellezo, JM
机构
[1] Univ Cantabria, E-39005 Santander, Spain
[2] Univ Adelaide, Adelaide, SA 5005, Australia
关键词
interconnection subsystem; packet deadlock; crossbar arbitration; hardware routers; VLSI design; performance evaluation; cc-NUMA systems; parallel application benchmarks;
D O I
10.1006/jpdc.2001.1746
中图分类号
TP301 [理论、方法];
学科分类号
081202 ;
摘要
The design of a new adaptive virtual cut-through router for torus networks is presented in this paper. With much lower VLSI costs than adaptive wormhole routers, the adaptive Bubble router is even faster than deterministic wormhole routers based on virtual channels, This has been achieved by combining a low-cost deadlock avoidance mechanism tor virtual cut-through networks, called Bubble flow control, with an adequate design of the router's arbiter. A thorough methodology has been employed to quantify the impact that this router design has at all levels, from its hardware cost to the system performance when running parallel applications. At the VLSI level. our proposal is the adaptive router with the shortest clock cycle and node delay when compared with other state-of-the-art alternatives. This translates into the lowest latency and highest throughput under standard synthetic loads, At system level, these gains reduce the execution time of the benchmarks considered. Compared with current adaptive wormhole routers, the execution time is reduced by up to 27%. Furthermore. this is the only router that improves system performance when compared with simpler static designs. (C) 2001 Academic Press.
引用
收藏
页码:1180 / 1208
页数:29
相关论文
共 29 条
[2]  
CARBONARO J, 1996, P HOT INT S 4 AUG
[3]   A flow control mechanism to avoid message deadlock in k-ary n-cube networks [J].
Carrion, C ;
Beivide, R ;
Gregorio, JA ;
Vallejo, F .
FOURTH INTERNATIONAL CONFERENCE ON HIGH-PERFORMANCE COMPUTING, PROCEEDINGS, 1997, :322-329
[4]  
CHIEN AA, 1992, P 19 ANN INT S COMP
[5]  
CHIEN AA, 1993, P HOT INT 93 PAL ALT
[6]  
DALLY WJ, 1987, IEEE T COMPUT, V36, P547, DOI 10.1109/TC.1987.1676939
[7]   PERFORMANCE ANALYSIS OF K-ARY N-CUBE INTERCONNECTION NETWORKS [J].
DALLY, WJ .
IEEE TRANSACTIONS ON COMPUTERS, 1990, 39 (06) :775-785
[8]   THE TORUS ROUTING CHIP [J].
DALLY, WJ ;
SEITZ, CL .
DISTRIBUTED COMPUTING, 1986, 1 (04) :187-196
[9]   A NEW THEORY OF DEADLOCK-FREE ADAPTIVE ROUTING IN WORMHOLE NETWORKS [J].
DUATO, J .
IEEE TRANSACTIONS ON PARALLEL AND DISTRIBUTED SYSTEMS, 1993, 4 (12) :1320-1331
[10]   A necessary and sufficient condition for deadlock-free routing in cut-through and store-and-forward networks [J].
Duato, J .
IEEE TRANSACTIONS ON PARALLEL AND DISTRIBUTED SYSTEMS, 1996, 7 (08) :841-854