Efficient determination of maximum incomplete subcubes in hypercubes with faults

DOI10.1109/12.544487MaRDI QIDQ4420809zbMATH OpenOpenAlexFDO

Authors Nian-Feng Tzeng, Guanghua Lin

Publication date 1996

Published in IEEE Transactions on Computers (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1109/12.544487

zbMATH Keywords

maximum subcubesreconfigration

Mathematics Subject Classification ID

Reliability, testing and fault tolerance of networks and computer systems (68M15) Computer system organization (68M99)

Recommendations

• A reconfiguration algorithm for fault tolerance in a hypercube multiprocessor
• Subcube fault tolerance in hypercube multiprocessors
• Distributed subcube identification algorithms for reliable hypercubes
• An effective routing algorithm in incomplete hypercubes
• Tolerating faults in injured hypercubes using maximal fault-free subcube-ring

Cited in

(7)

• A reconfiguration algorithm for fault tolerance in a hypercube multiprocessor
• Distributed subcube identification algorithms for reliable hypercubes
• Algebraic approach to transformations on hypercube system
• Tolerating faults in injured hypercubes using maximal fault-free subcube-ring
• A method to increase the size of healthy subcubes set in a hypercube system with node or link failures
• Subcube fault tolerance in hypercube multiprocessors
• scientific article; zbMATH DE number 2188503 (Why is no real title available?)

This page was built for publication: Efficient determination of maximum incomplete subcubes in hypercubes with faults

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