Network Performance of Pruned Hierarchical Torus Network
Network Performance of Pruned Hierarchical Torus Network
复制标题
DOI：
10.1109/npc.2009.11
复制
发表时间：
2009-10
期刊：
影响因子：
--
通讯作者：
M. Rahman;Xiaohong Jiang;Md. Shahin-Al Masud;S. Horiguchi
中科院分区：
文献类型：
--
作者：
M. Rahman;Xiaohong Jiang;Md. Shahin-Al Masud;S. Horiguchi
互连网络的复杂性通常决定了并行计算机的规模，因此并行计算机可达到的性能受到互连网络特性的限制。剪枝技术降低了复杂度，从而提高了性能。在本文中，我们应用修剪技术的层次环面网络（HTN）和研究修剪HTN的结构细节。我们探讨了网络直径，平均距离，平分宽度，垂直链接的峰值数，和VLSI布局面积不同的HTN。结果表明，修剪HTN具有几个有吸引力的功能，包括小直径，小的平均距离，少量的电线，特别是少量的垂直链接，和经济的布局面积相比，其非修剪对应。
The complexity of an interconnection network often determines the size of the parallel computer and thus the attainable performance of a parallel computer is limited by the characteristics of the interconnection network. Pruning technique reduces the complexity and hence increases the performance. In this paper, we apply the pruning technique on Hierarchical Torus Network (HTN) and study the architectural details of the pruned HTN. We have explored the network diameter, average distance, bisection width, peak number of vertical links, and VLSI layout area of different HTN. It is shown that the pruned HTN possesses several attractive features including small diameter, small average distance, small number of wires, a particularly small number of vertical links, and economic layout area as compared to its non-pruned counterpart.