An efficient PMC model-based local diagnosis structure and algorithm

DOI10.1016/J.TCS.2025.115218MaRDI QIDQ6988590zbMATH OpenFDO

Authors Meirun Chen, Cheng-Kuan Lin, Stafen Wang

Publication date 4 May 2025

Published in Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/J.TCS.2025.115218

zbMATH Keywords

interconnection networkslocal diagnosabilitylocal diagnosis algorithmPMC model

Mathematics Subject Classification ID

Network design and communication in computer systems (68M10) Reliability, testing and fault tolerance of networks and computer systems (68M15) Graph theory (including graph drawing) in computer science (68R10)

Cites work

• A general approach to deriving the \(g\)-good-neighbor conditional diagnosability of interconnection networks
• A group-theoretic model for symmetric interconnection networks
• A new structure for a vertex to be locally t-diagnosable in large multiprocessor systems
• An 0(n^2.5) Fault Identification Algorithm for Diagnosable Systems
• Bounds for sorting by prefix reversal
• Characterization of component diagnosability of regular networks
• Conditional connectivity of Cayley graphs generated by transposition trees
• Conditional diagnosability of balanced hypercubes under the PMC model
• Diagnosability of Cayley graphs generated by transposition trees with missing edges
• Diagnosability of star graphs with missing edges
• Fault diagnosability of arrangement graphs
• Graph theory
• Graph theory and interconnection networks.
• On \(g\)-extra conditional diagnosability of hypercubes and folded hypercubes
• On conditional diagnosability of the folded hypercubes
• On the g-extra diagnosability of enhanced hypercubes
• On the conditional diagnosability of matching composition networks
• Optimization of Reduced Dependencies for Synchronous Sequential Machines
• Strong Diagnosability and Conditional Diagnosability of Multiprocessor Systems and Folded Hypercubes
• Strong local diagnosability of (n,k)-star graphs and Cayley graphs generated by 2-trees with missing edges
• The -Diagnosability for Regular Networks
• The \(g\)-good-neighbor conditional diagnosability of hypercube under PMC model
• The \(t/s\)-diagnosability and \(t/s\)-diagnosis algorithm of folded hypercube under the PMC/MM* model
• The t/k-Diagnosability of Star Graph Networks
• The diagnosability of triangle-free graphs

Cited in

(1)

• Hybrid diagnosability based on g-extra fault pattern under the HPMC* model

This page was built for publication: An efficient PMC model-based local diagnosis structure and algorithm

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