Researches for more reliable arrangement graphs in multiprocessor computer system

DOI10.1016/j.amc.2019.124611zbMath1433.68043OpenAlexW2965205070MaRDI QIDQ2286137

Zhongbao Yu, Zuyuan Zhang, Fang-Ming Shao

Publication date: 9 January 2020

Published in: Applied Mathematics and Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.amc.2019.124611

zbMATH Keywords

arrangement graphinclusion-exclusion principleprobabilistic fault modelsubgraph reliability

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Mathematical problems of computer architecture (68M07) Reliability, testing and fault tolerance of networks and computer systems (68M15) Graph representations (geometric and intersection representations, etc.) (05C62)

Cites Work

• The conditional fault diagnosability of \((n, k)\)-star graphs
• The number of shortest paths in the arrangement graph
• Fault diagnosability of arrangement graphs
• On reliability of the folded hypercubes
• Substar reliability analysis in star networks
• Improving bounds on link failure tolerance of the star graph
• A kind of conditional fault tolerance of \((n, k)\)-star graphs
• Robustness of star graph network under link failure
• On the arrangement graph.
• Practical Deadlock-Free Fault-Tolerant Routing in Meshes Based on the Planar Network Fault Model
• Link Failure Tolerance in the Arrangement Graphs