期刊文献+
任意字段
题名或关键词
题名
关键词
文摘
作者
第一作者
机构
刊名
分类号
参考文献
作者简介
基金资助
栏目信息

超级扭立方体互连网络及其性质 被引量：1

THE SUPER TWISTED CUBE INTERCONNECTION NETWORKS AND THEIR PROPERTIES
下载PDF
导出
摘要 扭立方体是超立方体的一类变体,它具有比超立方体更好的性质。但是,同超立方体一样,它也是具有2n个顶点的n-正则图,故要使一个扭立方体的维数(即顶点度数)增加1(称为升级),就必须成倍地增加扭立方体中的顶点个数。为了解决这一问题,将具有2n个顶点的扭立方体的拓扑结构加以改变,得到了包含任意多个顶点的互连网络——超级扭立方体(STN)。证明了超级扭立方体保持了扭立方体的最高连通度、对数级的直径和顶点度数、Hamilton性质、连通度级的tp-可诊断度等方面的优良性质,更进一步地,由于它包含了任意多个顶点,所以对它的升级只需增加任意多个顶点,从而克服了扭立方体的升级必须成倍增加其顶点个数的缺点。 The Twisted Cube is a hypercube variant.It has some superior properties to the hypercube.However,like the hypercube,it is also an n-regular graph with 2n nodes.In order to increase 1 dimension（i.e.upgrade one level）,the nodes of the Twisted Cube must be multiplied.In order to solve the problem,the topological structure of the Twisted Cube with 2n nodes is modified to create an interconnection network——the Super Twisted Cube（STN）,which contains an arbitrary number of nodes.It is proven that the STN maintains the greatest connectivity,numerical diameter node numbers,Hamilton property,connectivity level tp-diagnostic properties of the Twisted Cube.Moreover,since it contains an arbitrary number of nodes,it only needs to add an arbitrary number of nodes to upgrade.Therefore it overcomes the above mentioned drawback of having to multiply its nodes to upgrade the Twisted Cube.
作者 王喜 樊建席
机构地区 苏州大学计算机科学与技术学院
出处 《计算机应用与软件》 CSCD 2011年第10期17-19,106,共4页 Computer Applications and Software
基金 国家自然科学基金(60873047)
关键词 扭立方体 超级扭立方体 升级 连通度 可诊断性 HAMILTON性质 直径 Twisted cube Super twisted cube Upgrade Connectivity Diagnosable Hamilton property Diameter
分类号 TP31 [自动化与计算机技术—计算机软件与理论]
  • 相关文献

参考文献11

  • 1Smola B, Stulikova I, Pelcova J, et al. Structure and morphology of effective obstacles in high performance Mg-rare earth base alloys, proc. 6th Int. Conf. Mg Alloy Appl., edt. Kainer K U, Germany, Lib of Congress Cord, 2003. 43.
  • 2Leighton F T. Introduction to parallel algorithms and architectures: ar- rays, trees, Hypercubes [ M ]. Morgan Kauffman Publishers, 1992.
  • 3Lee S C, Hook L R. IEEE Transactions on Computers. Logic and com- puter design in nanospace. 2008 ( 7 ) : 156 - 406.
  • 4Ohara H. Light metal, 1998, 48: 422.
  • 5Fan J X,Lin X L. The t/k-Diagnosability of the BC Graphs[J]. IEEE Transactions on Computers,2005,54 (2) : 176 - 184.
  • 6Zhu Q. On conditional diagnosability and reliability of the BC networks[J].Journal of Supercomputer,2008 (45) : 173 - 184.
  • 7王德强,刘玉蓉.扭立方体连接网络的几乎泛圈性[J].东北大学学报（自然科学版）,1999,20(1):12-14. 被引量：1
  • 8Flandorfer H. Metall. & Mater. Trans., 1997, A28: 265.
  • 9樊建席.超级交叉立方体互连网络及其拓扑性质[J].计算机学报,1999,22(2):222-224. 被引量：9
  • 10樊建席,管殿柱.超级Mbius立方体──一类最优容错的小直径互连网络[J].计算机研究与发展,1999,36(3):315-319. 被引量：3

二级参考文献25

  • 1[1]Efe K. A variation on the hypercube with lower diameter.IEEE Transactions on Computers, 1991,40(11) :1312～1316
  • 2[2]Cull P, Larson S M. The Mobius cubes. IEEE Transactions on Computers, 1995, 44(5): 647～659
  • 3[3]Efe K. The crossed cube architecture for Parallel Computing. IEEE Transactions on Parallel and Distributed Systems, 1992,3(5):513～524
  • 4[4]Efe K, Blachwell P K, Slough W, Shiau T. Topological properties of the crossed cube architecture. Parallel Computing,1994, 21(12):1763～1775
  • 5[5]Chang C-P, Sung T-Y, Hsu L-H. Edge congestion and topological properties of crossed cubes. IEEE Transactions on Computers, 2000, 11(1):63～80
  • 6[6]Kulasinghe P, Bettayeb S. Embedding binary trees into crossed cubes. IEEE Transactions on Computers, 1995, 44(7):923～929
  • 7[7]Kulasinghe P. Connectivity of the crossed cubes. Information Processing Letters, 1997, 61(4):222～226
  • 8[8]Fan J. Diagnosability of the Mobius cubes. IEEE Transactions on Parallel and Distributed Systems, 1998, 9(9):923～928
  • 9[9]Fan J. Hamilton-connectivity and cycle-embedding of the Mobius cubes. Information Processing Letters, 2002, 82(2):113～117
  • 10[10]Fan J. Diagnosability of Crossed cubes under the comparison diagnosis model. IEEE Transactions on Parallel and Distributed Systems, 2002, 13(7) :687～692

共引文献25

同被引文献18

  • 1常青彦,马美杰,徐俊明.局部纽立方体网络的容错泛圈性[J].中国科学技术大学学报,2006,36(6):607-610. 被引量：2
  • 2Lin X L, Ni L M. Deadlock-free multicast wormhole routing in multicomputer networks//Proceedings of the 18th Annual International Symposium on Computer Architecture. 1991: 116-125.
  • 3Lin X L, McKinley P K, Ni I. M. Deadlock-free multicast wormhole routing in 2 D mesh multicomputer. IEEE Trans- actions on Parallel and Distributed Systems, 1994, 5 (8): 793-804.
  • 4Bondy J A, Murty U S A. Graph theory with applications. London/New York: MacMilian/Elsevier, 1976.
  • 5Bhuyan L N, Agrawal D P. Generalized hypercube and hy- perbus structures for a computer network. IEEE Transac tions on Computers, 1984, 33(4) : 323-333.
  • 6Leighton F T. Introduction to Parallel Algorithms and Archi tectures: Arrays, Trees, Hypercubes. Morgan Kauffman Publishers, 1992.
  • 7Lee S C, Hook L R. Logic and computer design in nano space. IEEE Transactions on Computers, 2008, 57 ( 7 ) :156-406.
  • 8Yang X F, Evans D J, Megson G M. The locally twisted cubes. International Journal of Computer Mathematics, 2005, 82(4): 401-413.
  • 9Fan J X, Lin X L. The t/k diagnosability of the BC graphs. IEEE Transactions on Computers, 2005, 54(2): 176 184.
  • 10Zhu Q. On conditional diagnosability and reliability of the BC networks. Journal of Supercomputer, 2008, 45(2): 173-184.

引证文献1

计算机应用与软件
2011年 第10期

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

内容加载中请稍等...
;
使用帮助 返回顶部