Component Fault Diagnosis and Fault Tolerance of Alternating Group Graphs

2022/01/15 by Yanze Huang, Limei Lin, Eddie Cheng +1
Computer Science · Engineering · #Interconnection Networks and Systems #Radiation Effects in Electronics #Parallel Computing and Optimization Techniques

paper · doi:10.1093/comjnl/bxac006

Abstract

Abstract Reliability of a multiprocessor system becomes an important issue for parallel computing. Component diagnosability and component connectivity of a graph play crucial roles in assessing the vulnerability of an interconnection network, which are two significant indicators for the reliability and fault tolerance of a multiprocessor system. Until now, only a little knowledge of results have been known on r-component diagnosability and r-component connectivity. In this paper, we first propose the r-component diagnosability of n-dimensional alternating group graph AG_n under PMC model. And then we promote our research on AG_n by a fairly good construction for general r-component connectivity of AG_n, where 6≤ r≤ n-1. The theoretical analysis and simulation show that the general r-component connectivity of AG_n is larger than those of Q_n, D_n and FQ_n.

Citations

• The Component Diagnosability of Hypercubes with Large-Scale Faulty Nodes

Related

• Fault Diagnosability of Arrangement Graphs
• Relationship Between Component Connectivity And Component Diagnosability Of Some Regular Networks
• Equal relation between the extra connectivity and pessimistic diagnosability for some regular graphs
• Relationship between Conditional Diagnosability and 2-extra Connectivity of Symmetric Graphs
• Conditional Fault Diagnosis of Bubble Sort Graphs under the PMC Model