On Fault Isolation and Identification in t1/t1-Diagnosable Systems
IEEE Transactions on Computers
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
Distributed Diagnosis Algorithms for Regular Interconnected Structures
IEEE Transactions on Computers
On Diagnosability of Large Fault Sets in Regular Topology-Based Computer Systems
IEEE Transactions on Computers
Diagnosability of the Möbius Cubes
IEEE Transactions on Parallel and Distributed Systems
Fault-tolerant Hamiltonicity of twisted cubes
Journal of Parallel and Distributed Computing
IEEE Transactions on Computers
Proceedings of the Parallel Architectures and Languages Europe, Volume I: Parallel Architectures PARLE
Node-pancyclicity and edge-pancyclicity of crossed cubes
Information Processing Letters
Optimal Path Embedding in Crossed Cubes
IEEE Transactions on Parallel and Distributed Systems
Minimum neighborhood in a generalized cube
Information Processing Letters
Optimal fault-tolerant embedding of paths in twisted cubes
Journal of Parallel and Distributed Computing
A (4n-9)/3 diagnosis algorithm on n-dimensional cube network
Information Sciences: an International Journal
Embedding meshes into crossed cubes
Information Sciences: an International Journal
Optimal Embeddings of Paths with Various Lengths in Twisted Cubes
IEEE Transactions on Parallel and Distributed Systems
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
Efficient Fault Identification of Diagnosable Systems under the Comparison Model
IEEE Transactions on Computers
Embedding a family of disjoint 3D meshes into a crossed cube
Information Sciences: an International Journal
On conditional diagnosability and reliability of the BC networks
The Journal of Supercomputing
Generalized matching networks and their properties
International Journal of Parallel, Emergent and Distributed Systems
Diagnosability of Two-Matching Composition Networks
COCOON '08 Proceedings of the 14th annual international conference on Computing and Combinatorics
Embedding a family of disjoint multi-dimensional meshes into a crossed cube
Information Processing Letters
A note about some properties of BC graphs
Information Processing Letters
Diagnosable evaluation of DCC linear congruential graphs under the PMC diagnostic model
Information Sciences: an International Journal
Node-pancyclicity and edge-pancyclicity of crossed cubes
Information Processing Letters
Minimum neighborhood in a generalized cube
Information Processing Letters
One-to-one communication in twisted cubes under restricted connectivity
Frontiers of Computer Science in China
Efficient unicast in bijective connection networks with the restricted faulty node set
Information Sciences: an International Journal
Hamiltonian properties of twisted hypercube-like networks with more faulty elements
Theoretical Computer Science
The spined cube: A new hypercube variant with smaller diameter
Information Processing Letters
Embedding meshes into twisted-cubes
Information Sciences: an International Journal
Theoretical Computer Science
Fault diagnosis for hypercube-like networks
AICT'11 Proceedings of the 2nd international conference on Applied informatics and computing theory
Independent spanning trees on twisted cubes
Journal of Parallel and Distributed Computing
A fast fault-identification algorithm for bijective connection graphs using the PMC model
Information Sciences: an International Journal
Edge-pancyclicity of twisted cubes
ISAAC'05 Proceedings of the 16th international conference on Algorithms and Computation
Complete path embeddings in crossed cubes
Information Sciences: an International Journal
An algorithm to construct independent spanning trees on parity cubes
Theoretical Computer Science
Hamiltonian connectivity of restricted hypercube-like networks under the conditional fault model
Theoretical Computer Science
t/t-Diagnosability of regular graphs under the PMC model
ACM Transactions on Design Automation of Electronic Systems (TODAES)
{2,3}-Extraconnectivities of hypercube-like networks
Journal of Computer and System Sciences
Dimension-adjacent trees and parallel construction of independent spanning trees on crossed cubes
Journal of Parallel and Distributed Computing
Hi-index | 14.99 |
Processor fault diagnosis takes an important role in fault-tolerant computing on multiprocessor systems. There are two classical diagnosis strategies驴the precise strategy and the pessimistic strategy, both of which are based on the well-known PMC diagnostic model. Nevertheless, the degree of diagnosability of the system is limited under these two strategies. A better method, called the t/k-diagnosis strategy, is proposed by Somani and Peleg, in which the identified fault-set is allowed to contain at most k fault-free processors. Using this diagnosis strategy, the degree of diagnosability of the hypercube increases greatly as the number of the fault-free processors in the fault-set increases. In this paper, we study the t/k-diagnosability of so-called BC graphs that include hypercubes, crossed cubes, Möbius cubes, and twisted cubes, etc. We show that any n-dimensional BC graph is t(n,k)/k-diagnosable when n\geq 4 and 0\leq k\leq n, where t(n,k)=(k+1)n-{\frac{1}{2}}(k+1)(k+2)+1. Therefore, the crossed cube, the Möbius cube, and the twisted cube all have the same t/k-diagnosability as the hypercube. As a result, the algorithms developed for diagnosis on the hypercube may also be used to diagnose multiprocessor systems whose network topologies are based on BC graphs.