冒泡排序图容错性分析的一个结果  

A Study of Fault Tolerance in Bubble Sort Graphs

作　　者：王勤国 

机构地区：[1]朔州师范高等专科学校,山西朔州036000

出　　处：《黑河学院学报》2013年第5期126-128,共3页Journal of Heihe University

摘　　要：可靠性和有效性是互连网络设计的重要标准,而容错性的研究对考察网络的可靠性是十分必要的。通过分析B n中所有B n-k被破坏的顶点数f(n,k)的界,确定n是素数时,f(n,k)的值;在k=1时,得到f(n,k)的具体值。对1<k≤n-3,探讨寻找破坏B n中所有B n-k的顶点数的一般方法。Reliability and efficiency are important criteria in the design of interconnection networks. Fault tolerance is an very important for measuring reliability of an interconnection network. By analysing all the Bn-k in Bn, the bound on f（ n, k）, the number of fault nodes to make every Bn - k , have been derived. value for f（ n, k） is determined when n is prime and k = 1, n = 2, n - 1. For 1 〈 k ~〈 n - 3, a presented to derive a set of faulty nodes which damage all in Bn. general The exact method is

关 键 词：容错性 互联网络 冒泡排序图 循环翻转 

分 类 号：O157.5[理学—数学]