期刊文献+

泡形互连网络的条件连通性度量 被引量:2

Conditional vertex connectivity measures for bubble-sort networks
下载PDF
导出
摘要 n维泡形网络是设计大规模多处理机系统时最常用的互连网络拓扑结构之一,它以n维泡形图Bn为数学模型。F是连通图G的顶点子集,使得G-F不再连通且G-F的每个连通分支都有至少有n个顶点的F的势叫做G的Rk连通度。Rk连通度是衡量网络可靠性的一个重要参数。一般来说,网络的Rk连通度越大,其可靠性越高。研究了n维泡形网络的Rk连通性;证明了在n维泡形网络中,当n≥3时,其R1连通度为2n-4;当n≥4时,其R2连通度为4n-12。 The n-dimensional bubble-sort network is one of the most popular interconnection networks in large-scale multiprocessor systems and it takes n-dimensional bubble-sort graph Bn as mathematical model.The Rk-vertex-connectivity of a connected graph G is the minimum cardinality of a set of vertices whose deletion disconnects G and any vertex of the remaining components has at least k neighbors.The Rk-vertex-connectivity is one of the most parameters to evaluate the reliability of a network.In general,the larger the Rk-vertex-connectivity of a network is,the more reliable the network is.The Rk-vertex-connectivity of n-dimensional bubble-sort graphs is investigated.The theorems that the R1-vertex-connectivity of Bn is 2n-4 for n≥3 and R2-vertex-connectivity of Bn is 4n-12 for n≥4 are proved.
出处 《计算机工程与应用》 CSCD 北大核心 2011年第22期13-16,共4页 Computer Engineering and Applications
基金 国家自然科学基金No.61070229 山西省自然科学基金(No.2011021004)~~
关键词 互连网络 条件点连通度 泡形网络 可靠性 interconnection networks conditional vertex connectivity bubble-sort graphs reliability
  • 相关文献

参考文献16

  • 1Gunasokaran R, Siddharth S, Krishnaraj P, et al.Efficient algo- rithms to solve broadcast scheduling problem in WiMAX mesh networks[J].Computer Communications, 2010, 33 (11) : 1325-1333.
  • 2Stewart I A,Xiang Yonghong.Bipanconnectivity and bipancyclici- ty in k-ary n-cubes[J].IEEE Transactions on Parallel and Distrib-uted Systems, 2009,20( 1 ) : 25-33.
  • 3经紟,杜正中,马美杰,徐俊明.超立方体网络的边容错二部泛连通度(英文)[J].中国科学技术大学学报,2008,38(9):1017-1019. 被引量:2
  • 4Walker D, Latifi S.Improving bounds on link failure tolerance of the star graph[J].Information Sciences,2010,180(13.) :2571-2575.
  • 5王雷 林亚平.基于超立方体环连接Petersen图互连网络研究.计算机学报,2007,9(6):339-343.
  • 6刘有耀,韩俊刚.Torus连接Petersen图互连网络及路由算法[J].计算机科学,2009,36(3):78-81. 被引量:5
  • 7Harary EConditional connectivity[J].Networks, 1983,13 (3) : 347-357.
  • 8Fabrega J,Fiol M A.Extraconnecfivity of graphs with large girth[J]. Discrete Mathematics; 1994,127(1/3) : 163-170.
  • 9Esfahanian A H.Generalized measures of fault tolerance with application to N-cube networks[J].IEEE Transactions on Comput- ers, 1989,38( 11 ) : 1586-1591.
  • 10Latifi S, Hegde M, Morteza N EConditional connectivity mea- sures for large multiprocessor systems[J].IEEE Transactions on Computers, 1994,43 ( 2 ) : 218-222.

二级参考文献23

  • 1刘方爱,刘志勇,乔香珍.A practical interconnection network RP(k) and its routing algorithms[J].Science in China(Series F),2001,44(6):461-473. 被引量:6
  • 2王雷,林亚平.基于超立方体环连接的Petersen图互联网络研究[J].计算机学报,2005,28(3):409-413. 被引量:20
  • 3王雷,林亚平,夏巍.双环Petersen图互联网络及路由算法[J].软件学报,2006,17(5):1115-1123. 被引量:10
  • 4Li L K, Tsai C H, Tan J M, et al. Bipanconnectivity and edge-fault-tolerant biancyclicity of hypercubes[J].Information Processing Letters, 2003,87 : 107-110.
  • 5Saad Y, Schultz M H. TolmlogicaI properties of hypercubes[J].IEEETransComput, 1988,37(7):867-872.
  • 6Wang D. Embedding Hamihonian cycles into folded hypercubes with faulty links[J].J Parallel and Distrib Comput, 2001,61 : 545-564.
  • 7Xu Jun-ming. Topological Structure and Analysis of Intereonnection Networks [M]. Dordrecht/Boston/ London: Kluwer Academic Publishers, 2001.
  • 8Xu Jun-ming, Ma Mei jie, Du Zheng-zhong. Edgefault-tolerant properties of hypercubes and folded hypercubes[J]. Australasian Journal of Combinatorics, 2006,35:7-16.
  • 9Wu R-Y, Chang J G,Chen G-H. Node-disjoint paths in hierarchical hypereube networks[C]//20th International Parallel and Distributed Processing Symposium. April 2006:5
  • 10Hillis W D. The Connection Machine [M]. Cambridge, MA, MIT Press, 1985

共引文献5

同被引文献3

引证文献2

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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