The t/k-diagnosability of m-ary n-cube networks

DOI10.1016/J.TCS.2023.114345MaRDI QIDQ6138838zbMATH OpenOpenAlexFDO

Authors Wen Yin, Jiarong Liang, Yuhao Xie, Changzhen Li

Publication date 16 January 2024

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

Full work available at URL https://doi.org/10.1016/j.tcs.2023.114345

zbMATH Keywords

diagnosabilitynetwork topologymultiprocessor system\(t / k\)-diagnosability\(m\)-ary \(n\)-cube

Mathematics Subject Classification ID

Theory of computing (68Qxx)

Cites work

• A diagnosis algorithm by using graph-coloring under the PMC model
• An 0(n^2.5) Fault Identification Algorithm for Diagnosable Systems
• An Approach to the Diagnosability Analysis of a System
• An adaptive and fault tolerant wormhole routing strategy for k-ary n-cubes
• Characterization of Connection Assignment of Diagnosable Systems
• Fault diagnosability of bicube networks under the PMC diagnostic model
• Lee distance and topological properties of k-ary n-cubes
• On Fault Identification in Diagnosable Systems
• On diagnosability of large fault sets in regular topology-based computer systems
• On the k-ary hypercube
• Optimization of Reduced Dependencies for Synchronous Sequential Machines
• Performance evaluation on hybrid fault diagnosability of regular networks
• The \(g\)-good-neighbor conditional diagnosability of hypercube under PMC model
• The \(g\)-good-neighbor conditional diagnosability of the crossed cubes under the PMC and MM* model
• The \(g\)-good-neighbor diagnosability of locally twisted cubes
• The diagnosability of the \(k\)-ary \(n\)-cubes using the pessimistic strategy

This page was built for publication: The \(t/k\)-diagnosability of \(m\)-ary \(n\)-cube networks

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