欢迎您！东篱公司
退出
-
申报数据库
-
立项数据库
-
成果数据库
-
项目获奖数据库
中文摘要：
为了度量以k元n立方网络为底层网络拓扑的并行计算机系统的容错能力，通过构造k元n立方网络中使得所有的k元1立方子网都发生故障的最小节点集合的方法，提出求解其k元1立方子网排除点割集的一种递归算法；证明了要使k元n立方网络中所有k元1立方子网都发生故障至少需要破坏掉扩。个节点。结果表明，在不超过kn-1-1个节点被破坏的情况下，以k元n立方网络为底层拓扑构建的并行计算机系统中依然存在无故障的k元1立方子网。
英文摘要：
In order to measure the fault tolerance ability of the parallel computers which take the k-ary n-cube as underlying topology, by constructing the minimum node set whose removal will lead to every k-ary 1-cube in the k-ary n-cube faulty, a recursive algorithm for finding the k-ary 1-cube subnet preclusion node cut of the k-ary n-cube was proposed. It is proved that at least kn-1 nodes need to be damaged if a rival wants to destroy all k-ary 1-cubes in the k-ary n-cube. The result indicates that there are still undamaged k-ary 1-cubes in the parallel computers which take the k-ary n-cube as underlying topology if the number of the faulty nodes does not exceed kn- 1 - 1.
同期刊论文项目
同项目期刊论文
期刊信息
位置：