Two-round diagnosability measures for multiprocessor systems

DOI10.1155/2020/9535818zbMath1441.68014OpenAlexW3037011266MaRDI QIDQ781778

Jiarong Liang, Qian Zhang, Changzhen Li

Publication date: 18 July 2020

Published in: Complexity (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1155/2020/9535818

Mathematics Subject Classification ID

Mathematical problems of computer architecture (68M07) Reliability, testing and fault tolerance of networks and computer systems (68M15)

Cites Work

• On the \(t/k\)-diagnosability of BC networks
• Efficient unicast in bijective connection networks with the restricted faulty node set
• Diagnosability of star graphs under the comparison diagnosis model
• On conditional fault tolerance and diagnosability of hierarchical cubic networks
• The strong local diagnosability of a hypercube network with missing edges
• Conditional diagnosability of multiprocessor systems based on complete-transposition graphs
• A kind of conditional fault tolerance of \((n, k)\)-star graphs
• A fast pessimistic one-step diagnosis algorithm for hypercube multicomputer systems
• The spined cube: a new hypercube variant with smaller diameter
• Online policy iterative-based \(H_\infty\) optimization algorithm for a class of nonlinear systems
• Edge-pancyclicity and path-embeddability of bijective connection graphs
• Component connectivity of the hypercubes
• The $t/k$-Diagnosability of Star Graph Networks
• A Fast Pessimistic Diagnosis Algorithm for Hypercube-Like Networks under the Comparison Model
• On the maximal connected component of a hypercube with faulty vertices III
• Optimization of Reduced Dependencies for Synchronous Sequential Machines