首页 | 本学科首页   官方微博 | 高级检索  
     


Constraint-based performance comparison of multi-dimensional interconnection networks with deterministic and adaptive routing strategies
Authors:Hamid Sarbazi-Azad [Author Vitae]
Affiliation:Department of Computer Engineering, Sharif University of Technology and School of Computer Science, Institute for Studies in Theoretical Physics and Mathematics (IPM), Tehran, Iran
Abstract: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.
Keywords:Interconnection networks   k-ary n-cube   Torus   Hypercube   Wormhole routing   Deterministic/adaptive routing   Performance comparison
本文献已被 ScienceDirect 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号