On Fault Isolation and Identification in t1/t1-Diagnosable Systems
IEEE Transactions on Computers
A Group-Theoretic Model for Symmetric Interconnection Networks
IEEE Transactions on Computers
Generalized Measures of Fault Tolerance with Application to N-Cube Networks
IEEE Transactions on Computers
Diagnosabilities of Hypercubes Under the Pessimistic One-Step Diagnosis Strategy
IEEE Transactions on Computers
IEEE Transactions on Parallel and Distributed Systems
On Diagnosability of Large Fault Sets in Regular Topology-Based Computer Systems
IEEE Transactions on Computers
Adaptive System-Level Diagnosis for Hypercube Multiprocessors
IEEE Transactions on Computers
Better Adaptive Diagnosis of Hypercubes
IEEE Transactions on Computers
Routing properties of supercubes
Information Sciences: an International Journal
Introduction to Parallel Processing: Algorithms and Architectures
Introduction to Parallel Processing: Algorithms and Architectures
Properties and Performance of Folded Hypercubes
IEEE Transactions on Parallel and Distributed Systems
A fast pessimistic one-step diagnosis algorithm for hypercube multicomputer systems
Journal of Parallel and Distributed Computing
The t/k-Diagnosability of the BC Graphs
IEEE Transactions on Computers
Minimum neighborhood in a generalized cube
Information Processing Letters
On embedding cycles into faulty twisted cubes
Information Sciences: an International Journal
A parallel routing algorithm on circulant networks employing the Hamiltonian circuit latin square
Information Sciences: an International Journal
Complete path embeddings in crossed cubes
Information Sciences: an International Journal
Efficient Fault Identification of Diagnosable Systems under the Comparison Model
IEEE Transactions on Computers
Largest connected component of a star graph with faulty vertices
International Journal of Computer Mathematics
Fault diagnosis for hypercube-like networks
AICT'11 Proceedings of the 2nd international conference on Applied informatics and computing theory
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
The 2-path-bipanconnectivity of hypercubes
Information Sciences: an International Journal
Adaptive system-level diagnosis for hypercube multiprocessors using a comparison model
Information Sciences: an International Journal
| Hi-index | 0.07 |
As a generalization of the precise and pessimistic diagnosis strategies of system-level diagnosis of multicomputers, the t/k diagnosis strategy can significantly improve the self-diagnosing capability of a system at the expense of no more than k fault-free processors (nodes) being mistakenly diagnosed as faulty. In the case k=2, to our knowledge, there is no known t/k diagnosis algorithm for general diagnosable system or for any specific system. Hypercube is a popular topology for interconnecting processors of multicomputers. It is known that an n-dimensional cube is (4n-9)/3-diagnosable. This paper addresses the (4n-9)/3 diagnosis of n-dimensional cube. By exploring the relationship between a largest connected component of the 0-test subgraph of a faulty hypercube and the distribution of the faulty nodes over the network, the fault diagnosis of an n-dimensional cube can be reduced to those of two constituent (n-1)-dimensional cubes. On this basis, a diagnosis algorithm is presented. Given that there are no more than 4n-9 faulty nodes, this algorithm can isolate all faulty nodes to within a set in which at most three nodes are fault-free. The proposed algorithm can operate in O(Nlog"2N) time, where N=2^n is the total number of nodes of the hypercube. The work of this paper provides insight into developing efficient t/k diagnosis algorithms for larger k value and for other types of interconnection networks.