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
Topological properties of the crossed cube architecture
Parallel Computing
Connectivity of the crossed cube
Information Processing Letters
Diagnosability of Hypercubes and Enhanced Hypercubes under the Comparison Diagnosis Model
IEEE Transactions on Computers
Edge Congestion and Topological Properties of Crossed Cubes
IEEE Transactions on Parallel and Distributed Systems
Embedding Binary Trees into Crossed Cubes
IEEE Transactions on Computers
The Crossed Cube Architecture for Parallel Computation
IEEE Transactions on Parallel and Distributed Systems
IEEE Transactions on Parallel and Distributed Systems
A comparison connection assignment for diagnosis of multiprocessor systems
ISCA '80 Proceedings of the 7th annual symposium on Computer Architecture
Diagnosabilities of Regular Networks
IEEE Transactions on Parallel and Distributed Systems
(t,k)-Diagnosis for Matching Composition Networks
IEEE Transactions on Computers
(t, k) - Diagnosis for Matching Composition Networks under the MM* Model
IEEE Transactions on Computers
Efficient Fault Identification of Diagnosable Systems under the Comparison Model
IEEE Transactions on Computers
On conditional diagnosability of the folded hypercubes
Information Sciences: an International Journal
Diagnosability of Two-Matching Composition Networks
COCOON '08 Proceedings of the 14th annual international conference on Computing and Combinatorics
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 | 0.01 |
Editor's Note: This paper unfortunately contains some errors which led to the paper being reprinted in the October 2002 issue. Please see IEEE Transactions on Parallel and Distributed Systems,vol. 13, no. 10, October 2002, pp. 1099-1104 for the correct paper (available without subscription).Diagnosability of a multiprocessor system is one important study topic in the parallel processing area. As a hypercube variant, the crossed cube has many attractive properties. The diameter, wide diameter and fault diameter of it are all approximately half of those of the hypercube. The power that the crossed cube simulates trees and cycles is stronger than the hypercube. Because of these advantages of the crossed cube, it has attracted much attention from researchers. In this paper, we show that the n-dimensional crossed cube is n-diagnosable under a major diagnosis model驴the comparison diagnosis model proposed by Malek and Maeng if n 4. According to this, the polynomial algorithm presented by Sengupta and Dahbura may be used to diagnose the n-dimensional crossed cube, provided that the number of the faulty nodes in the n-dimensional crossed cube does not exceed n. The conclusion of this paper also indicates that the diagnosability of the n-dimensional crossed cube is the same as that of the n-dimensional hypercube when n5 and better than that of the n-dimensional hypercube when n = 4.