节点文献

一种在立方环网络上加总线的方法

A METHOD FOR INSTALLING BUSES ON CUBE-CONNECTED-CYCLES NETWORK

  • 推荐 CAJ下载
  • PDF下载
  • 不支持迅雷等下载工具,请取消加速工具后下载。

【作者】 童明生刘长河范天佑

【Author】 TONG Ming-Sheng(Department of Computer Scienace and Engineering, Beijing Institute of Technology, Beijing 100081)LIU Chang-He;Fan Tian-You(Research Center of Materials Science, Beijing Institute of Technology, Beijing 100081)

【机构】 北京理工大学计算机科学工程系!北京100081北京理工大学材料中心!北京

【摘要】 本文提出一种在立方环网络(CCC)上加总线的方法.对于小规模的CCC网络,这种方法能使其直径降为3;而对于大规模的CCC网络,能使其直径降为原来的2/3以下,并且还可以使网络中各结点的度降为≤2.

【Abstract】 Hypercube is an important interconnection network. It has many advan-tages,such as small diameter. However,its degree is somewhat big. The degree ofn-dimension Hypercube(Hn) is n,this is not easy to be realized in VLSI. In order toovercome this shortcoming,a new topology structure of intereconnection networks,cube-connection-cycles(CCC),which is composed of Hypercube and rings,was pro-posed by Preparata et al. in 1981. The degree of every node in CCC is less than 3,which is decreased greatly than that of Hypercube. However,the diameter of CCC(d) has increased comparing with that of Hypercube. The diameter of CCC with 2nnodes satisfies,is bigger than that of H.,whih is n. In this paper,anew method for installing busses on CCC is proposed, to reduce the diameter ofsmall CCC network structure to be 3. While,for large CCC systems,it is reduced toless than two-thirds that of the regular CCC. After adding buses,the links withinthe rings of CCC become useless and can be removed,so the degree of each node isreduced to less than 2. The node-to-node routing algorithm on the modified CCC isalso proposed in this paper.

  • 【文献出处】 计算机学报 ,CHINESE JOURNAL OF COMPUTERS , 编辑部邮箱 ,1998年10期
  • 【分类号】TP393
  • 【下载频次】31
节点文献中: 

本文链接的文献网络图示:

本文的引文网络