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
Diagnosabilities of Hypercubes Under the Pessimistic One-Step Diagnosis Strategy
IEEE Transactions on Computers
Introduction to parallel algorithms and architectures: array, trees, hypercubes
Introduction to parallel algorithms and architectures: array, trees, hypercubes
An introduction to photonic switching fabrics
An introduction to photonic switching fabrics
Diagnosability of the Möbius Cubes
IEEE Transactions on Parallel and Distributed Systems
Scalable network architectures using the optical transpose interconnection system (OTIS)
Journal of Parallel and Distributed Computing
Multiprocessor Fault Diagnosis Under Local Constraints
IEEE Transactions on Computers
Diagnosability of Enhanced Hypercubes
IEEE Transactions on Computers
ICPADS '96 Proceedings of the 1996 International Conference on Parallel and Distributed Systems
A fast pessimistic one-step diagnosis algorithm for hypercube multicomputer systems
Journal of Parallel and Distributed Computing
Conditional Diagnosability Measures for Large Multiprocessor Systems
IEEE Transactions on Computers
Diagnosabilities of Regular Networks
IEEE Transactions on Parallel and Distributed Systems
IEEE Transactions on Parallel and Distributed Systems
A Local Diagnosability Measure for Multiprocessor Systems
IEEE Transactions on Parallel and Distributed Systems
Worst-Case Diagnosis Completeness in Regular Graphs under the PMC Model
IEEE Transactions on Computers
Characterization of Connection Assignment of Diagnosable Systems
IEEE Transactions on Computers
On Fault Identification in Diagnosable Systems
IEEE Transactions on Computers
An 0(n2.5) Fault Identification Algorithm for Diagnosable Systems
IEEE Transactions on Computers
A Theory of Diagnosability of Digital Systems
IEEE Transactions on Computers
Computer
General biswapped networks and their topological properties
APPT'07 Proceedings of the 7th international conference on Advanced parallel processing technologies
International Journal of Computer Mathematics
IEEE Transactions on Parallel and Distributed Systems
Conditional Diagnosability of Augmented Cubes under the PMC Model
IEEE Transactions on Dependable and Secure Computing
A fast fault-identification algorithm for bijective connection graphs using the PMC model
Information Sciences: an International Journal
Theoretical Computer Science
IEEE Transactions on Computers
| Hi-index | 5.23 |
Processor fault identification in a multiprocessor system plays an important role in reliable computing. The process of identifying faulty processors is called the diagnosis of the system. Several diagnostic models have been proposed, the most popular being the PMC (Preparata, Metze and Chen) diagnostic model proposed in 1967. The precise strategy and the pessimistic strategy are two classical diagnostic strategies based on the PMC model. The precise strategy correctly identifies all faulty nodes. The pessimistic diagnosis strategy isolates all faulty nodes within a set containing at most one fault-free node. General biswapped networks were proposed in 2007 as interconnection networks amenable to implementation using a mix of electronic and optical communication links. The model is inspired by and extended from biswapped networks and OTIS networks. In this paper, we focus on the diagnosabilities of general biswapped networks under the precise and pessimistic strategies based on the PMC diagnostic model. It is proved that the general biswapped network Gbsw(G,H) with @d(G)=1 and @d(H)=1 is t-diagnosable and t"1/t"1-diagnosable under the precise and the pessimistic strategies, respectively, where t is the minimum node degree of the network and t"1 is the minimum number of neighbors of any pair of nodes. In addition, a pessimistic diagnosis algorithm for general biswapped networks is proposed and the algorithm can run in O(t"1N) time where N denotes the total number of nodes in the network.