Topological Properties of Hypercubes
IEEE Transactions on Computers
Introduction to parallel algorithms and architectures: array, trees, hypercubes
Introduction to parallel algorithms and architectures: array, trees, hypercubes
On Self-Diagnosable Multiprocessor Systems: Diagnosis by the Comparison Approach
IEEE Transactions on Computers
Adaptive System-Level Diagnosis for Hypercube Multiprocessors
IEEE Transactions on Computers
Better Adaptive Diagnosis of Hypercubes
IEEE Transactions on Computers
FOCS '95 Proceedings of the 36th Annual Symposium on Foundations of Computer Science
A comparison connection assignment for diagnosis of multiprocessor systems
ISCA '80 Proceedings of the 7th annual symposium on Computer Architecture
Adaptive Diagnosis of Variants of the Hypercube
IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences
A (4n-9)/3 diagnosis algorithm on n-dimensional cube network
Information Sciences: an International Journal
IEEE Transactions on Computers
On conditional diagnosability of the folded hypercubes
Information Sciences: an International Journal
Conditional diagnosability of hypercubes under the comparison diagnosis model
Journal of Systems Architecture: the EUROMICRO Journal
Diagnosable evaluation of DCC linear congruential graphs under the PMC diagnostic model
Information Sciences: an International Journal
On Adaptive Fault Diagnosis for Multiprocessor Systems
ISAAC '01 Proceedings of the 12th International Symposium on Algorithms and Computation
A survey of comparison-based system-level diagnosis
ACM Computing Surveys (CSUR)
Topological Structure and Analysis of Interconnection Networks
Topological Structure and Analysis of Interconnection Networks
Fault diagnosis for hypercube-like networks
AICT'11 Proceedings of the 2nd international conference on Applied informatics and computing theory
A fast fault-identification algorithm for bijective connection graphs using the PMC model
Information Sciences: an International Journal
Diagnosability of star graphs with missing edges
Information Sciences: an International Journal
Three-round adaptive diagnosis in binary n-cubes
ISAAC'04 Proceedings of the 15th international conference on Algorithms and Computation
The diagnosability of the matching composition network under the comparison diagnosis model
IEEE Transactions on Computers
Conditional diagnosability of balanced hypercubes under the PMC model
Information Sciences: an International Journal
Conditional diagnosability of matching composition networks under the MM* model
Information Sciences: an International Journal
IEEE Transactions on Computers
Conditional Diagnosability of Alternating Group Graphs
IEEE Transactions on Computers
The Conditional Diagnosability of k-Ary n-Cubes under the Comparison Diagnosis Model
IEEE Transactions on Computers
Hi-index | 0.07 |
Fault detection and localization are important in multiprocessor computing systems. Several methods of system self-diagnosis have been developed, including the model proposed by Preparata, Metze, and Chien (known as the PMC model) and a comparison model proposed by Maeng and Malek (the MM model). Adaptive diagnosis is a practical system-level diagnostic scheme whose main design objectives are to reduce the number of test rounds and the total number of tests. A number of interesting research results have been presented for adaptive diagnosis using the classical PMC model. However, adaptive diagnosis using the MM model has been discussed only in relation to completely connected systems and torus systems. In this paper we consider the problem of adaptive fault diagnosis in an n-dimensional hypercube using the MM model. The hypercube is an important interconnection network and an n-dimensional hypercube has been shown to be n-diagnosable using the MM model. The goal is to correctly identify the status of all processors, assuming that the number of faulty vertices does not exceed the hypercube dimension. For a cycle of N vertices, we show that at least four test rounds are necessary for complete diagnosis if N is not a multiple of three. We propose a scheme that completely diagnoses a 4-dimensional hypercube in at most seven test rounds and an n-dimensional hypercube, for n=5 in at most six test rounds and at most N+2n^3+8n^2 tests, where N=2^n.