An effective routing algorithm in incomplete hypercubes

DOI10.1016/0167-8191(94)90128-7MaRDI QIDQ1349981zbMATH OpenOpenAlexFDO

Authors Shuhua Hu, Hsing-Lung Chen

Publication date 27 February 1997

Published in Parallel Computing (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/0167-8191(94)90128-7

zbMATH Keywords

RoutingFault-toleranceHypercubeDeadlock-freeParallel paths

Mathematics Subject Classification ID

Computer system organization (68M99)

Recommendations

• Parallel routing algorithms for incomplete hypercube interconnection networks
• An algorithm paradigm for incomplete hypercubes
• Embedding cycles and meshes onto incomplete hypercubes
• Fault-tolerant wormhole routing for hypercube networks
• AN ADAPTIVE FAULT-TOLERANT WORMHOLE ROUTING ALGORITHM FOR HYPERCUBES

Cited in

(6)

• Efficient determination of maximum incomplete subcubes in hypercubes with faults
• Order structure of good sets in hypercube
• Embedding the incomplete hypercube in books
• Improved book-embeddings of incomplete hypercubes
• Routing multiple paths in hypercubes
• Embedding cycles and meshes onto incomplete hypercubes

This page was built for publication: An effective routing algorithm in incomplete hypercubes

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