Conditional diagnosability of matching composition networks under the \(\mathrm{MM}^\ast\) model
From MaRDI portal
Publication:2446379
DOI10.1016/j.ins.2013.01.019zbMath1284.68083OpenAlexW1965478408MaRDI QIDQ2446379
Publication date: 16 April 2014
Published in: Information Sciences (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ins.2013.01.019
multiprocessor systemsconditional diagnosabilitycomparison diagnosis modelmatching composition networks\(\mathrm{MM}^\ast\) model
Related Items (16)
\(g\)-good-neighbor conditional diagnosability measures for 3-ary \(n\)-cube networks ⋮ On the conditional diagnosability of matching composition networks ⋮ Diagnosability and hybrid diagnosability of some classes of graphs under the BPMC model ⋮ The \(g\)-good-neighbor conditional diagnosability of locally twisted cubes ⋮ The minimum spectral radius of an edge-removed network: a hypercube perspective ⋮ On \(g\)-good-neighbor conditional diagnosability of \((n,k)\)-star networks ⋮ Strong diagnosability and conditional diagnosability of optical multi-mesh hypercube networks under the PMC model ⋮ Diagnosability of multigraph composition networks ⋮ Conditional diagnosability of multiprocessor systems based on Cayley graphs generated by transpositions ⋮ Adaptive system-level diagnosis for hypercube multiprocessors using a comparison model ⋮ Hybrid fault diagnosis capability analysis of hypercubes under the PMC model and \(\mathrm{MM}^\ast\) model ⋮ Conditional diagnosability of a class of matching composition networks under the comparison model ⋮ Theg-extra conditional diagnosability and sequentialt/k-diagnosability of hypercubes ⋮ The 3-extra conditional diagnosability of balanced hypercubes under \(\mathrm{MM}^\ast\) model ⋮ The \(g\)-good neighbor conditional diagnosability of twisted hypercubes under the PMC and MM* model ⋮ The \(1,2\)-good-neighbor conditional diagnosabilities of regular graphs
Cites Work
- A fast fault-identification algorithm for bijective connection graphs using the PMC model
- Diagnosability of star graphs with missing edges
- Embedding meshes into twisted-cubes
- Conditional edge-fault-tolerant Hamiltonicity of dual-cubes
- On the generalized twisted cube
- A \((4n - 9)/3\) diagnosis algorithm on \(n\)-dimensional cube network
- Hamiltonian laceability of bubble-sort graphs with edge faults
- A note about some properties of BC graphs
- On the independent spanning trees of recursive circulant graphs \(G(cd^m,d)\) with \(d>2\)
- Edge-pancyclicity and path-embeddability of bijective connection graphs
- On conditional diagnosability of the folded hypercubes
- The conditional diagnosability of crossed cubes under the comparison model
- (t,k)-Diagnosability of Multiprocessor Systems with Applications to Grids and Tori
- Conditional connectivity
- On Fault Isolation and Identification in t1/t1-Diagnosable Systems
- A Generalized Theory for System Level Diagnosis
- On Fault Identification in Diagnosable Systems
- Fault Diagnosis in a Boolean n Cube Array of Microprocessors
- A Theory of Diagnosability of Digital Systems
- Diagnosis of ${t / {(t + 1)}}$-Diagnosable Systems
- The Mobius cubes
- On diagnosability of large fault sets in regular topology-based computer systems
- (t, k) - Diagnosis for Matching Composition Networks under the MM* Model
- Diagnosability of hypercubes and enhanced hypercubes under the comparison diagnosis model
- The locally twisted cubes
- Strongly Diagnosable Systems under the Comparison Diagnosis Model
- A Quick Pessimistic Diagnosis Algorithm for Hypercube-Like Multiprocessor Systems under the PMC Model
- Conditional Diagnosability of Alternating Group Graphs
- The Conditional Diagnosability of k-Ary n-Cubes under the Comparison Diagnosis Model
- (t,k)-Diagnosis for Component-Composition Graphs under the MM* Model
- (t, k)-Diagnosability for Regular Networks
- On self-diagnosable multiprocessor systems: diagnosis by the comparison approach
- Sequential fault occurrence and reconfiguration in system level diagnosis
- Optimization of Reduced Dependencies for Synchronous Sequential Machines
- Multicast in wormhole-switched torus networks using edge-disjoint spanning trees.
This page was built for publication: Conditional diagnosability of matching composition networks under the \(\mathrm{MM}^\ast\) model