计算机应用 ›› 2013, Vol. 33 ›› Issue (04): 1036-1038.DOI: 10.3724/SP.J.1087.2013.01036

• 先进计算 • 上一篇    下一篇

3元n立方网络的2阶超连通性

赵元庆1,金显华2   

  1. 1. 安阳师范学院 计算机与信息工程学院,河南 安阳 455002
    2. 安阳师范学院 公共计算机教学部,河南 安阳 455002
  • 收稿日期:2012-10-09 修回日期:2012-11-27 出版日期:2013-04-01 发布日期:2013-04-23
  • 通讯作者: 赵元庆
  • 作者简介:赵元庆(1976-),男,黑龙江绥化人,讲师,硕士,主要研究方向:网络优化、智能计算;金显华(1979-),女,河南信阳人,讲师,硕士,主要研究方向:网络优化。
  • 基金资助:

    国家自然科学基金资助项目(41001251)

Second-extraconnectivity of 3-ary n-cube networks

ZHAO Yuanqing1,JIN Xianhua2   

  1. 1. School of Computer and Information Engineering, Anyang Normal University, Anyang Henan 455002, China
    2. Computer Teaching Department, Anyang Normal University, Anyang Henan 455002, China
  • Received:2012-10-09 Revised:2012-11-27 Online:2013-04-01 Published:2013-04-23
  • Contact: ZHAO Yuanqing

摘要: 为了度量以3元n立方网络为底层拓扑结构的并行与分布式系统的连通性,通过构造其2阶超割的方法,计算出当n不小于2时,3元n立方网络的2阶超连通度是6n-7。证明了对于以3元n立方网络为底层拓扑结构的并行与分布式计算机系统,当有不超过6n-8个节点发生故障且每个连通分支至少还有3个健康的节点时,该并行与分布式系统的任意两个节点之间仍然有一条无故障的通信线路。

关键词: 互连网络, 3元n立方, 容错, 连通度, 超连通度

Abstract: To evaluate the connectivity of parallel and distributed computer systems which take 3-ary n-cubes as underlying topologies, by constructing the extra 2-cut of 3-ary n-cubes, the second-extraconnectivity of 3-ary n-cubes was proved to be equal to 6n-7 for an arbitrary integer n no less than 2. The result shows that for any two nodes of the parallel and distributed system which take the 3-ary n-cube as underlying topology, there is at least a fault-free path connecting them if the number of the faulty nodes in the system does not exceed 6n-8 and each connected branch still has at least three healthy nodes.

Key words: interconnection network, 3-ary n-cube, fault tolerance, connectivity, extraconnectivity

中图分类号: