文献类型：期刊文献

英文题名：Researches for more reliable arrangement graphs in multiprocessor computer system

作者：Yu, Zhongbao[1];Shao, Fangming[1];Zhang, Zuyuan[1]

机构：[1]East China Univ Sci & Technol, Sch Sci, Shanghai 200237, Peoples R China

年份：2019

卷号：363

外文期刊名：APPLIED MATHEMATICS AND COMPUTATION

收录：;EI(收录号：20193107254040);WOS:【SCI-EXPANDED(收录号:WOS:000486390400028)】；

基金：This paper was supported in part by the National Natural Science Foundation of China (No. 61040040).

语种：英文

外文关键词：Arrangement graph; Inclusion-exclusion principle; Probabilistic fault model; Subgraph reliability

摘要：The arrangement graph A(n,k) is regarded as an attractive interconnection network in multiprocessor computer system. The subsystem-reliability (s-reliability) is defined as the probability that a fault-free subgraph of a specific size is still available, and is able to measure the health state of the system. In this paper, we mainly consider the comparison of two different topologies of arrangement graphs with the same number of processors and the robustness of reliability bounds of arrangement graph. Further, we prove that the larger n is, the higher s-reliability of A(n,k) will be, and provide a theoretical basis for finding the topology of more reliable arrangement graph with the same number of processors. The simulation is carried out to verify the robustness of reliability bounds and comparison of more pairs of arrangement graph. (C) 2019 Elsevier Inc. All rights reserved.