首页    期刊浏览 2024年11月23日 星期六
登录注册

文章基本信息

  • 标题:Hierarchical Dual-Net: A Flexible Interconnection Network and its Routing Algorithm
  • 其他标题:Hierarchical Dual-Net: A Flexible Interconnection Network and its Routing Algorithm
  • 本地全文:下载
  • 作者:Yamin Li ; Shietung Peng ; Wanming Chu
  • 期刊名称:International Journal of Networking and Computing
  • 印刷版ISSN:2185-2847
  • 出版年度:2012
  • 卷号:2
  • 期号:2
  • 页码:234-250
  • 语种:English
  • 出版社:International Journal of Networking and Computing
  • 摘要:In this paper, we propose a flexible interconnection network, called hierarchical dual-net (HDN), with low node degree and short diameter for constructing a large scale of supercomputer. The HDN is constructed based on a symmetric product graph (base network). A k-level hierarchical dual-net, HDN(B,k,S), contains (2N0)2k/(2 × Πki=1si) nodes, where S={G'1,G'2,...,G'k}, G'i is a super-node and si = |G'i| is the number of nodes in the super-node at the level i for 1 ≤ i ≤ k, and N0 is the number of nodes in the base network B. The node degree of HDN(B,k,S) is d0+k, where d0 is the node degree of the base network. The HDN structure is better than existing networks such as hypercube and 2D/3D torus with respect to the degree and diameter. Another benefit of the HDN is that we can select suitable super-nodes to control the growing speed of the number of nodes for constructing a supercomputer of the desired scale. We investigate the topological properties of the HDN and compare them to that of other networks and give efficient routing and broadcasting algorithms for the hierarchical dual-net.
  • 关键词:Interconnection Networks; Routing; Broadcasting; Algorithms
国家哲学社会科学文献中心版权所有