Researches for more reliable arrangement graphs in multiprocessor computer system

DOI10.1016/J.AMC.2019.124611MaRDI QIDQ2286137zbMATH OpenOpenAlexFDO

Authors 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 representations (geometric and intersection representations, etc.) (05C62) Mathematical problems of computer architecture (68M07) Reliability, testing and fault tolerance of networks and computer systems (68M15) Graph theory (including graph drawing) in computer science (68R10)

Recommendations

• Note on reliability evaluation of arrangement graphs
• Fault diagnosability of arrangement graphs
• The structure fault tolerance of arrangement graphs
• Subnetwork reliability analysis of bubble-sort graph networks
• On the reliability of alternating group graph-based networks

Cites work

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

Cited in

(6)

• On the reliability of alternating group graph-based networks
• Note on reliability evaluation of arrangement graphs
• Robustness of subsystem-based reliability for complete-transposition network
• Subnetwork reliability of the arrangement graphs under probabilistic fault condition
• Robustness of reliability bounds for ( n, k )-star networks
• Comparative analysis of standard topologies for intermodule connections of an aviation computing environment and their redundancy methods

This page was built for publication: Researches for more reliable arrangement graphs in multiprocessor computer system

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2286137)