Subcube fault tolerance in hypercube multiprocessors
From MaRDI portal
Recommendations
- Subcube fault-tolerance in hypercubes
- A reconfiguration algorithm for fault tolerance in a hypercube multiprocessor
- Efficient determination of maximum incomplete subcubes in hypercubes with faults
- Tolerating faults in injured hypercubes using maximal fault-free subcube-ring
- Distributed subcube identification algorithms for reliable hypercubes
Cited in
(17)- Efficient determination of maximum incomplete subcubes in hypercubes with faults
- A fault-tolerant tree communication scheme for hypercube systems
- Load sharing in hypercube-connected multicomputers in the presence of node failures
- Global commutative and associative reduction operations in faulty SIMD hypercubes
- How robust is the n-cube?
- Processor allocation for hypercubes
- A reconfiguration algorithm for fault tolerance in a hypercube multiprocessor
- Parallel Processing and Applied Mathematics
- Algebraic approach to transformations on hypercube system
- scientific article; zbMATH DE number 2188503 (Why is no real title available?)
- Fault-tolerant multicasting in hypercubes using local safety information
- Synchronizing hypercube networks in the presence of faults
- A combinatorial analysis of subcube reliability in hypercubes
- Design of gracefully degradable hypercube-connected systems
- Subcube fault-tolerance in hypercubes
- A low-cost fault-tolerant structure for the hypercube
- A method to increase the size of healthy subcubes set in a hypercube system with node or link failures
This page was built for publication: Subcube fault tolerance in hypercube multiprocessors
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4421185)
