【摘要】：在并行計(jì)算機(jī)系統(tǒng)中,元器件和線路故障普遍存在,而系統(tǒng)的容錯(cuò)能力可以通過其底層基礎(chǔ)網(wǎng)絡(luò)的拓?fù)湫再|(zhì)衡量。為了精確度量以k元n維冒泡排序網(wǎng)絡(luò)為底層拓?fù)浣Y(jié)構(gòu)的并行計(jì)算機(jī)系統(tǒng)的容錯(cuò)能力,結(jié)合其層次結(jié)構(gòu)和子網(wǎng)劃分特征,分別提出了節(jié)點(diǎn)故障模型和線路故障模型下攻擊該網(wǎng)絡(luò)中所有k-m元n-m維冒泡排序子網(wǎng)絡(luò)的算法,確定了需要攻擊的最優(yōu)節(jié)點(diǎn)集合和最優(yōu)線路集合。根據(jù)算法可得:當(dāng)2≤k≤n-2,m≤k-1時(shí),攻擊k元n維冒泡排序網(wǎng)絡(luò)中所有的k-m元n-m維冒泡排序子網(wǎng)絡(luò),在節(jié)點(diǎn)故障模型下需要攻擊至少C_n~mm!個(gè)節(jié)點(diǎn),在邊故障模型下需要攻擊至少C_n~mm!條線路。
[Abstract]:In parallel computer systems, component and circuit faults are common, and the fault tolerance of the system can be measured by the topological properties of its underlying network. In order to measure the fault-tolerant ability of parallel computer systems with k-ary n-dimensional bubbling sorting network as the underlying topology, the hierarchical structure and subnet partition characteristics are combined. The algorithms for attacking all k-m element n-m dimensional bubbling sorting subnetworks in the network under node fault model and line fault model are presented respectively. The optimal node set and optimal line set which need to be attacked are determined. According to the algorithm, when 2 鈮，

本文編號(hào)：2355955