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

DOI10.1016/J.INS.2011.10.022zbMATH Open1284.68081OpenAlexW1990598647WikidataQ114167449 ScholiaQ114167449MaRDI QIDQ454914FDOQ454914

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

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

Recommendations

• Symmetric PMC model of diagnosis, \(b\)-matchings in graphs and fault identification in \(t\)-diagnosable systems
• A fast diagnosis algorithm for locally twisted cube multiprocessor systems under the MM\(^{*}\) model
• On diagnosability of large multiprocessor networks
• Improved precise fault diagnosis algorithm for hypercube-like graphs
• scientific article; zbMATH DE number 7070754

zbMATH Keywords

reliabilitydiagnosabilityinterconnection networkPMC modeldiagnostic algorithm

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Reliability, testing and fault tolerance of networks and computer systems (68M15)

Cites Work

• An 0(n^2.5) Fault Identification Algorithm for Diagnosable Systems
• Title not available (Why is that?)
• 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
• Optimization of Reduced Dependencies for Synchronous Sequential Machines
• Conditional diagnosability of alternating group networks
• Edge-pancyclicity and path-embeddability of bijective connection graphs
• Characterization of Connection Assignment of Diagnosable Systems
• The Mobius cubes
• The locally twisted cubes
• Embedding of cycles in twisted cubes with edge-pancyclic
• Embedding meshes into locally twisted cubes
• Recursive circulants and their embeddings among hypercubes
• Diagnosable evaluation of DCC linear congruential graphs under the PMC diagnostic model
• A Generalized Theory for System Level Diagnosis
• ``Hypermeshes: Optical interconnection networks for parallel computing

Cited In (12)

• Fault isolation and identification in general biswapped networks under the PMC diagnostic model
• On the \(t/k\)-diagnosability of BC networks
• A diagnosis algorithm by using graph-coloring under the PMC model
• 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
• Constructing completely independent spanning trees in crossed cubes
• A fast diagnosis algorithm for locally twisted cube multiprocessor systems under the MM\(^{*}\) model
• Diagnosable evaluation of enhanced optical transpose interconnection system networks
• Adaptive system-level diagnosis for hypercube multiprocessors using a comparison model
• Conditional diagnosability of multiprocessor systems based on Cayley graphs generated by transpositions
• Fault detection and diagnosis of non-linear non-Gaussian dynamic processes using kernel dynamic independent component analysis

This page was built for publication: A fast fault-identification algorithm for bijective connection graphs using the PMC model

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q454914)