Parallel routing algorithms for incomplete hypercube interconnection networks

DOI10.1016/0167-8191(94)90129-5MaRDI QIDQ1349985zbMATH OpenOpenAlexFDO

Authors M. S. Horng, Kuo-Lung Ku, Deng-Jyi 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)90129-5

zbMATH Keywords

Interconnection networksHypercubeParallel routing algorithm

Mathematics Subject Classification ID

Distributed algorithms (68W15) Network design and communication in computer systems (68M10) Computer system organization (68M99)

Recommendations

• An effective routing algorithm in incomplete hypercubes
• An algorithm paradigm for incomplete hypercubes
• Embedding cycles and meshes onto incomplete hypercubes
• Routing multiple paths in hypercubes
• A parallel routing algorithm on recursive cube of rings networks employing Hamiltonian circuit Latin square

Cited in

(12)

• On linear layout of bicube and construction of optimal incomplete bicube
• Order structure of good sets in hypercube
• Computational and Information Science
• A parallel routing algorithm on recursive cube of rings networks employing Hamiltonian circuit Latin square
• Embedding the incomplete hypercube in books
• Improved book-embeddings of incomplete hypercubes
• On the problem of expanding hypercube-based systems
• Parity conditions in homotopic knock-knee routing
• A parallel routing algorithm on circulant networks employing the Hamiltonian circuit Latin square
• Bluecube: constructing a hypercube parallel computing and communication environment over Bluetooth radio systems
• Embedding cycles and meshes onto incomplete hypercubes
• Efficient Parallel Routing Algorithms for Cartesian and Composition Networks

This page was built for publication: Parallel routing algorithms for incomplete hypercube interconnection networks

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