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

DOI10.1016/J.INS.2011.10.022MaRDI QIDQ454914zbMATH OpenOpenAlexWikidataFDO

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

zbMATH Keywords

diagnosabilitydiagnostic algorithminterconnection networkPMC modelreliability

Mathematics Subject Classification ID

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

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

Cites work

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

Cited in

(12)

• 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
• A fast diagnosis algorithm for locally twisted cube multiprocessor systems under the MM\(^{*}\) model
• On the t/k-diagnosability of BC networks
• The congestion of generalized cube communication pattern in linear array network
• 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

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)