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
Sequential Diagnosability is Co-NP Complete
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
Sequentially t-Diagnosable Systems: A Characterization and Its applications
IEEE Transactions on Computers - Special issue on fault-tolerant 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
Correct and Almost Complete Diagnosis of Processor Grids
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
Diagnosability of regular systems
Journal of Algorithms
A comparison connection assignment for diagnosis of multiprocessor systems
ISCA '80 Proceedings of the 7th annual symposium on Computer Architecture
(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
(t,k)-Diagnosis for Matching Composition Networks
IEEE Transactions on Computers
Analysis and Optimal Design of Self-Diagnosable Systems with Repair
IEEE Transactions on Computers
An 0(n2.5) Fault Identification Algorithm for Diagnosable Systems
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
Diagnosability of Two-Matching Composition Networks
COCOON '08 Proceedings of the 14th annual international conference on Computing and Combinatorics
A survey of comparison-based system-level diagnosis
ACM Computing Surveys (CSUR)
Conditional diagnosability of matching composition networks under the MM* model
Information Sciences: an International Journal
| Hi-index | 14.98 |
(t, k) - diagnosis, which is a generalization of sequential diagnosis, requires at least k faulty processors identified and repaired in each iteration provided there are at most t faulty processors, where t\geq k. In this paper, a (t,k){\hbox{-}}\rm diagnosis algorithm under the MM* model is proposed 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 a matching composition network of n dimensions is (\Omega({\frac{2^{n}\ast\log n}{n}}),n){\hbox{-}}\rm diagnosable.