Volume I: Parallel architectures on PARLE: Parallel Architectures and Languages Europe
Fault-tolerant computing: theory and techniques; Vol. 2
A Generalized Theory for System Level Diagnosis
IEEE Transactions on Computers
Topological Properties of Hypercubes
IEEE Transactions on Computers
Diagnosabilities of Hypercubes Under the Pessimistic One-Step Diagnosis Strategy
IEEE Transactions on Computers
A Variation on the Hypercube with Lower Diameter
IEEE Transactions on Computers
On Self-Diagnosable Multiprocessor Systems: Diagnosis by the Comparison Approach
IEEE Transactions on Computers
A linear time algorithm for sequential diagnosis in hypercubes
Journal of Parallel and Distributed Computing
A Graph Partitioning Approach to Sequential Diagnosis
IEEE Transactions on Computers
Diagnosability of the Möbius Cubes
IEEE Transactions on Parallel and Distributed Systems
Diagnosability of Hypercubes and Enhanced Hypercubes under the Comparison Diagnosis Model
IEEE Transactions on Computers
Diagnosability of Crossed Cubes under the Comparison Diagnosis Model
IEEE Transactions on Parallel and Distributed Systems
Diagnosability of Enhanced Hypercubes
IEEE Transactions on Computers
IEEE Transactions on Computers
(t, k)-Diagnosable System: A Generalization of the PMC Models
IEEE Transactions on Computers
Diagnosability of t-Connected Networks and Product Networks under the Comparison Diagnosis Model
IEEE Transactions on Computers
Conditional Diagnosability Measures for Large Multiprocessor Systems
IEEE Transactions on Computers
Characterization of Connection Assignment of Diagnosable Systems
IEEE Transactions on Computers
An 0(n2.5) Fault Identification Algorithm for Diagnosable Systems
IEEE Transactions on Computers
Fault Diagnosis in a Boolean n Cube Array of Microprocessors
IEEE Transactions on Computers
On the Computational Complexity of System Diagnosis
IEEE Transactions on Computers
Computer
The diagnosability of the matching composition network under the comparison diagnosis model
IEEE Transactions on Computers
(t, k) - Diagnosis for Matching Composition Networks under the MM* Model
IEEE Transactions on Computers
Embedding meshes into crossed cubes
Information Sciences: an International Journal
Fault-free Hamiltonian cycles in crossed cubes with conditional link faults
Information Sciences: an International Journal
Edge-pancyclicity and path-embeddability of bijective connection graphs
Information Sciences: an International Journal
Diagnosability of Two-Matching Composition Networks
COCOON '08 Proceedings of the 14th annual international conference on Computing and Combinatorics
Diagnosable evaluation of DCC linear congruential graphs under the PMC diagnostic model
Information Sciences: an International Journal
A fast fault-identification algorithm for bijective connection graphs using the PMC model
Information Sciences: an International Journal
t/t-Diagnosability of regular graphs under the PMC model
ACM Transactions on Design Automation of Electronic Systems (TODAES)
Conditional diagnosability of matching composition networks under the MM* model
Information Sciences: an International Journal
| Hi-index | 14.98 |
(t,k){\hbox{-}}{\rm diagnosis}, which is a generalization of sequential diagnosis, requires at least k faulty processors identified and replaced in each iteration provided there are at most t faulty processors, where t \ge k. This paper proposes a (t,k){\hbox{-}}{\rm diagnosis} algorithm for matching composition networks, which include many well-known interconnection networks such as hypercubes, crossed cubes, twisted cubes, and Möbius cubes. It is shown that matching composition networks of n dimensions are (\Omega({\frac{2^n*\log n}{n}}), n){\hbox{-}}{\rm diagnosable}, where n5.