Distributed subcube identification algorithms for reliable hypercubes

DOI10.1016/0020-0190(91)90088-YMaRDI QIDQ1178248zbMATH OpenFDO

Authors Shahram Latifi

Publication date 26 June 1992

Published in Information Processing Letters (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/0020-0190(91)90088-Y

zbMATH Keywords

heuristicsNP-completenessgreedy algorithmsdistributed

Mathematics Subject Classification ID

Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Distributed algorithms (68W15) General theory of computer systems (68M01)

Recommendations

• Subcube fault tolerance in hypercube multiprocessors
• Efficient determination of maximum incomplete subcubes in hypercubes with faults
• A reconfiguration algorithm for fault tolerance in a hypercube multiprocessor
• Subcube fault-tolerance in hypercubes
• Routing in hypercube networks with a constant fraction of faulty nodes

Cites work

• scientific article; zbMATH DE number 3639144 (Why is no real title available?)
• A reconfiguration algorithm for fault tolerance in a hypercube multiprocessor
• Fault Diagnosis in a Boolean n Cube Array of Microprocessors
• Reducibility among combinatorial problems

Cited in

(5)

• Efficient determination of maximum incomplete subcubes in hypercubes with faults
• Subcube fault tolerance in hypercube multiprocessors
• A reconfiguration algorithm for fault tolerance in a hypercube multiprocessor
• Parallel Processing and Applied Mathematics
• Algebraic approach to transformations on hypercube system

This page was built for publication: Distributed subcube identification algorithms for reliable hypercubes

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