RECURSIVE DUAL-NET: A NEW VERSATILE NETWORK FOR SUPERCOMPUTERS OF THE NEXT GENERATION

作     者：Li, Yamin Peng, Shietung Chu, Wanming 

作者机构：Hosei Univ Dept Comp Sci Tokyo 1848584 Japan Univ Aizu Dept Comp Hardware Aizu Wakamatsu Fukushima 9658580 Japan 

出 版 物：《JOURNAL OF THE CHINESE INSTITUTE OF ENGINEERS》 

年 卷 期：2009年第32卷第7期

页      面：931-938页

核心收录：

学科分类：12[管理学] 1201[管理学-管理科学与工程(可授管理学、工学学位)] 08[工学] 

主　　题：parallel processing interconnection network 

摘      要：In this paper, we propose a new versatile network, called a recursive dual-net (RDN), as a potential candidate for the interconnection network of supercomputers of the next generation. The RDN is based on recursive dual-construction of a base network. A k-level recursive dual construction for k 0 creates a network containing (2m)2(k)/2 nodes with node-degree d + k, where in and d are the number of nodes and the node-degree of the base network, respectively. The RDN is node and edge symmetric if the base network is node and edge symmetric. The RDN can contain a huge number of nodes, each with small node-degree and short diameter. For example, we can construct a symmetric RDN connecting more than 3-million nodes with only 6 links per node and a diameter of 22. We investigate the topological properties of the RDN and compare them to those of other networks including 3D torus, WK-recursive network, hypercube, cube-connected-cycle, and dual-cube. We also establish the efficient routing and broadcasting algorithms for the RDN.