A fast fault-identification algorithm for bijective connection graphs using the PMC model

DOI10.1016/j.ins.2011.10.022zbMath1284.68081WikidataQ114167449 ScholiaQ114167449MaRDI QIDQ454914

Tseng-Kuei Li, Hong-Chun Hsu, Chang-Hsiung Tsai

Publication date: 10 October 2012

Published in: Information Sciences (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ins.2011.10.022

zbMATH Keywords

reliability; interconnection network; diagnosability; PMC model; diagnostic algorithm

Mathematics Subject Classification ID

68R10: Graph theory (including graph drawing) in computer science

68M15: Reliability, testing and fault tolerance of networks and computer systems

Related Items

On the \(t/k\)-diagnosability of BC networks, A diagnosis algorithm by using graph-coloring under the PMC model, Diagnosable evaluation of enhanced optical transpose interconnection system networks, Fault isolation and identification in general biswapped networks under the PMC diagnostic model, Adaptive system-level diagnosis for hypercube multiprocessors using a comparison model, Constructing completely independent spanning trees in crossed cubes, Fault detection and diagnosis of non-linear non-Gaussian dynamic processes using kernel dynamic independent component analysis, Conditional diagnosability of multiprocessor systems based on Cayley graphs generated by transpositions, Dimension-adjacent trees and parallel construction of independent spanning trees on crossed cubes, Conditional diagnosability of matching composition networks under the \(\mathrm{MM}^\ast\) model, THE CONGESTION OF GENERALIZED CUBE COMMUNICATION PATTERN IN LINEAR ARRAY NETWORK

Cites Work

• Unnamed Item
• Efficient unicast in bijective connection networks with the restricted faulty node set
• An efficient fault-tolerant routing algorithm in bijective connection networks with restricted faulty edges
• Conditional diagnosability of alternating group networks
• Diagnosable evaluation of DCC linear congruential graphs under the PMC diagnostic model
• Embedding of cycles in twisted cubes with edge-pancyclic
• Embedding meshes into locally twisted cubes
• Recursive circulants and their embeddings among hypercubes
• ``Hypermeshes: Optical interconnection networks for parallel computing
• Edge-pancyclicity and path-embeddability of bijective connection graphs
• An 0(n^2.5) Fault Identification Algorithm for Diagnosable Systems
• A Generalized Theory for System Level Diagnosis
• Characterization of Connection Assignment of Diagnosable Systems
• The Mobius cubes
• The locally twisted cubes
• Optimization of Reduced Dependencies for Synchronous Sequential Machines