Constraint-based performance comparison of multi-dimensional interconnection networks with deterministic and adaptive routing strategies

被引:3
作者
Sarbazi-Azad, H [1 ]
机构
[1] Sharif Univ Technol, Dept Comp Engn, Tehran, Iran
[2] Inst Studies Theoret Phys & Math, Sch Comp Sci, Tehran, Iran
关键词
interconnection networks; k-ary n-cube; torus; hypercube; wormhole routing; deterministic/adaptive routing; performance comparison;
D O I
10.1016/j.compeleceng.2003.04.002
中图分类号
TP3 [计算技术、计算机技术];
学科分类号
0812 ;
摘要
Several studies have examined the relative performance merits of the torus and hypercube taking into account the channel bandwidth constraints imposed by implementation technology. While the torus has been shown to outperform the hypercube under the constant wiring density constraint, the opposite conclusion has been reached when the constant pin-out constraint is considered. However, all these studies have assumed deterministic routing and have not taken into account the internal hardware cost of routers. This paper re-examines the performance merits of the torus and hypercube using both fully-adaptive and deterministic routing strategies. Moreover, it uses a new cost model which takes into account the internal hardware cost of routers. (C) 2003 Elsevier Ltd. All rights reserved.
引用
收藏
页码:167 / 182
页数:16
相关论文
共 29 条