【摘要】：為了度量發(fā)生故障時k元n方體對其可匹配性的保持能力,通過剖析條件故障下使得k元n方體中不存在完美匹配或幾乎完美匹配所需故障集的構(gòu)造,研究了條件故障下使得k元n方體不可匹配所需的最小故障數(shù)。當(dāng)k≥4為偶數(shù)且n≥2時,得出了k元n方體這一容錯性參數(shù)的精確值并對其所有相應(yīng)的最小故障集進行了刻畫;當(dāng)k≥3為奇數(shù)且n≥2時,給出了該k元n方體容錯性參數(shù)的一個可達下界和一個可達上界。結(jié)果表明,選取k為奇數(shù)的k元n方體作為底層互連網(wǎng)絡(luò)拓撲設(shè)計的并行計算機系統(tǒng)在條件故障下對其可匹配性有良好的保持能力;進一步地,該系統(tǒng)在故障數(shù)不超過2n時仍是可匹配的,要使該系統(tǒng)不可匹配至多需要4n-3個故障元。
[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 鈮，

本文編號：2434973