Diagnosability of Two-Matching Composition Networks

DOI10.1007/978-3-540-69733-6_47zbMath1148.68317OpenAlexW1484082034MaRDI QIDQ3511359

Chia-Wei Lee, Sun-Yuan Hsieh

Publication date: 10 July 2008

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-540-69733-6_47

Mathematics Subject Classification ID

Network design and communication in computer systems (68M10) Graph theory (including graph drawing) in computer science (68R10)

Related Items (3)

The relationship between extra connectivity and conditional diagnosability of regular graphs under the PMC model ⋮ Hybrid fault diagnosis capability analysis of hypercubes under the PMC model and \(\mathrm{MM}^\ast\) model ⋮ Hybrid PMC (HPMC) fault model and diagnosability of interconnection networks

Cites Work

• A simple proof for the constructions of optical priority queues
• On Fault Isolation and Identification in t₁/t₁-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
• Diagnosis of ${t / {(t + 1)}}$-Diagnosable Systems
• On diagnosability of large fault sets in regular topology-based computer systems
• Diagnosability of hypercubes and enhanced hypercubes under the comparison diagnosis model
• Augmented cubes
• 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

This page was built for publication: Diagnosability of Two-Matching Composition Networks