【摘要】：為了度量發(fā)生故障時(shí)k元n方體對(duì)其可匹配性的保持能力,通過(guò)剖析條件故障下使得k元n方體中不存在完美匹配或幾乎完美匹配所需故障集的構(gòu)造,研究了條件故障下使得k元n方體不可匹配所需的最小故障數(shù)。當(dāng)k≥4為偶數(shù)且n≥2時(shí),得出了k元n方體這一容錯(cuò)性參數(shù)的精確值并對(duì)其所有相應(yīng)的最小故障集進(jìn)行了刻畫(huà);當(dāng)k≥3為奇數(shù)且n≥2時(shí),給出了該k元n方體容錯(cuò)性參數(shù)的一個(gè)可達(dá)下界和一個(gè)可達(dá)上界。結(jié)果表明,選取k為奇數(shù)的k元n方體作為底層互連網(wǎng)絡(luò)拓?fù)湓O(shè)計(jì)的并行計(jì)算機(jī)系統(tǒng)在條件故障下對(duì)其可匹配性有良好的保持能力;進(jìn)一步地,該系統(tǒng)在故障數(shù)不超過(guò)2n時(shí)仍是可匹配的,要使該系統(tǒng)不可匹配至多需要4n-3個(gè)故障元。
[Abstract]:In order to measure the ability of k-ary n-cube to keep its matching ability in the event of failure, the construction of fault set required for perfect matching or almost perfect matching in k-element n-cube is analyzed by analyzing the conditional fault. The minimum number of faults required to make k-ary n-cube unmatched under conditional faults is studied. When k 鈮，

本文編號(hào)：2434973