https://scholars.lib.ntu.edu.tw/handle/123456789/329030
標題: | Node-disjoint paths in hierarchical hypercube networks | 作者: | Wu, R.-Y. Kuo, Y.-L. GERARD JENNHWA CHANG Chen, Gen-Huey |
關鍵字: | Container; Hierarchical hypercube network; Hypercube; Interconnection network; Node-disjoint paths | 公開日期: | 2007 | 卷: | 177 | 期: | 19 | 起(迄)頁: | 4200-4207 | 來源出版物: | Information Sciences | 摘要: | The hierarchical hypercube network is suitable for massively parallel systems. One of its appealing properties is the low number of connections per processor, which can facilitate the VLSI design and fabrication. Other alluring features include symmetry and logarithmic diameter, which can derive easy and fast algorithms for communication. In this paper, a maximal number of node-disjoint paths are constructed between every two distinct nodes of the hierarchical hypercube network. Their maximal length is not greater than max {2m + 1 + 2 m + 1, 2m + 1 + m + 4}, where 2m + 1 is the diameter. The effectiveness of node-disjoint paths is further verified by experiments. © 2007 Elsevier Inc. All rights reserved. |
URI: | http://www.scopus.com/inward/record.url?eid=2-s2.0-34447345131&partnerID=MN8TOARS http://scholars.lib.ntu.edu.tw/handle/123456789/329030 |
DOI: | 10.1016/j.ins.2007.02.035 | SDG/關鍵字: | Hierarchical hypercube networks; Hypercube; Node-disjoint paths; Integrated circuit layout; Interconnection networks; Program processors; VLSI circuits; Parallel processing systems |
顯示於: | 數學系 |
在 IR 系統中的文件,除了特別指名其著作權條款之外,均受到著作權保護,並且保留所有的權利。