k元n维冒泡排序网络的子网排除
发布时间：2018-11-25 11:34
【摘要】：在并行计算机系统中,元器件和线路故障普遍存在,而系统的容错能力可以通过其底层基础网络的拓扑性质衡量。为了精确度量以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!条线路。
[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 鈮，
本文编号：2355955
[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 鈮，
本文编号：2355955
本文链接：https://www.wllwen.com/kejilunwen/jisuanjikexuelunwen/2355955.html
