k元n方体的可靠性评估

Reliability assessment of k-ary n-cube networks

并行计算机系统功能的实现很大程度上依赖于系统互连网络的性能。为了精确度量以k元n方体为底层拓扑结构的并行计算机系统的容错能力,研究了点故障模型下k元n方体中k元(n-1)方体子网络的可靠性。当k≥3且为奇数时,分别在固定划分模式和灵活划分模式下对k元n方体中不同数目的k元(n-1)方体子网络保持无故障状态的平均失效时间进行了分析,并得出了这一子网络可靠性评估参数的计算公式。结果表明,当基于k为奇数的k元n方体构建的并行计算机系统指派子网络执行用户任务时,在点故障模型下灵活划分模式相比固定划分模式有着更好的容错能力。

The functions of a parallel computer system heavily rely on the performance of interconnection network of the system.In order to measure the fault tolerance abilities of the parallel computer systems with k-ary n-cubes as underlying topologies,the reliability of the subnetworks of k-ary(n-1)-cubes in a k-ary n-cube under the node fault model was studied.For odd k≥3,the mean time to failure to maintain the fault free condition of different number of k-ary(n-1)-cubes in a k-ary n-cube was analyzed under the fixed partition pattern and the flexible partition pattern,respectively.And the calculation formulas for the reliability evaluation parameter of subnetwork were obtained.Under the node fault model,the results indicate that the parallel computer system which is built based on k-ary n-cubes with odd k has better fault tolerance ability under the flexible partition pattern when subnetworks in the system are assigned for the user task execution.