k元n维冒泡排序网络的子网排除

Sub-network Preclusion in (n,k)-bubble-sort Networks

在并行计算机系统中,元器件和线路故障普遍存在,而系统的容错能力可以通过其底层基础网络的拓扑性质衡量。为了精确度量以k元n维冒泡排序网络为底层拓扑结构的并行计算机系统的容错能力,结合其层次结构和子网划分特征,分别提出了节点故障模型和线路故障模型下攻击该网络中所有k-m元n-m维冒泡排序子网络的算法,确定了需要攻击的最优节点集合和最优线路集合。根据算法可得:当2≤k≤n-2,m≤k-1时,攻击k元n维冒泡排序网络中所有的k-m元n-m维冒泡排序子网络,在节点故障模型下需要攻击至少C_n^mm!个节点,在边故障模型下需要攻击至少C_n^mm!条线路。

In the real parallel computer systems,faults of processors and links are inevitable,and the fault tolerance ability of a system can be evaluated by the performance of its interconnection network.In order to measure the fault tolerance abilities of the parallel computers which take（n,k）-bubble-sort networks as underlying topologies,combining the hierarchical structures and sub-network partitions＇ characters of（n,k）-bubble-sort networks,an algorithm of the problem that destroy all the（n-m,k-m）-bubble-sort networks in the（n,k）-bubble-sort network under the node fault model and the link fault model was proposed,and the optimal attacking nodes set and the optimal attacking links set were obtained.According to the algorithm,to destroy all the（n-m,k-m）-bubble-sort networks in the（n,k）-bubblesort network,at least C_n^mm!nodes or C_n^mm!links ought to be faulty under the node fault model and the link fault model,respectively,where 2≤k≤n-2 and m≤k-1.