Researches for more reliable arrangement graphs in multiprocessor computer system

Zhongbao Yu, Fangming Shao and Zuyuan Zhang

Applied Mathematics and Computation, 2019, vol. 363, issue C, -

Abstract: The arrangement graph An,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 An,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.

Keywords: Arrangement graph; Inclusion-exclusion principle; Probabilistic fault model; Subgraph reliability (search for similar items in EconPapers)
Date: 2019
References: View complete reference list from CitEc
Citations:

Downloads: (external link)
http://www.sciencedirect.com/science/article/pii/S0096300319306034
Full text for ScienceDirect subscribers only

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:eee:apmaco:v:363:y:2019:i:c:4

DOI: 10.1016/j.amc.2019.124611

Access Statistics for this article

Applied Mathematics and Computation is currently edited by Theodore Simos

More articles in Applied Mathematics and Computation from Elsevier
Bibliographic data for series maintained by Catherine Liu ().