Two-round diagnosability measures for multiprocessor systems
From MaRDI portal
Recommendations
Cites work
- A Fast Pessimistic Diagnosis Algorithm for Hypercube-Like Networks under the Comparison Model
- A fast pessimistic one-step diagnosis algorithm for hypercube multicomputer systems
- A kind of conditional fault tolerance of (n, k)-star graphs
- Component connectivity of the hypercubes
- Conditional diagnosability of multiprocessor systems based on complete-transposition graphs
- Diagnosability of star graphs under the comparison diagnosis model
- Edge-pancyclicity and path-embeddability of bijective connection graphs
- Efficient unicast in bijective connection networks with the restricted faulty node set
- On conditional fault tolerance and diagnosability of hierarchical cubic networks
- On the t/k-diagnosability of BC networks
- On the maximal connected component of a hypercube with faulty vertices III
- Online policy iterative-based \(H_\infty\) optimization algorithm for a class of nonlinear systems
- Optimization of Reduced Dependencies for Synchronous Sequential Machines
- The $t/k$-Diagnosability of Star Graph Networks
- The spined cube: a new hypercube variant with smaller diameter
- The strong local diagnosability of a hypercube network with missing edges
Cited in
(3)- Fault diagnosability of DQcube under the PMC model
- Necessary and sufficient conditions for \(t\)-diagnosability of multiprocessor computer systems for various models of nonreliable testing established using the system graph-theoretical model
- Partial and complete local diagnosis in computer systems with circulant structure
This page was built for publication: Two-round diagnosability measures for multiprocessor systems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q781778)