Routing multiple paths in hypercubes

DOI10.1007/BF02090404MaRDI QIDQ3358210zbMATH OpenOpenAlexFDO

Authors David S. Greenberg, Sandeep Bhatt

Publication date 1991

Published in Mathematical Systems Theory (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/bf02090404

zbMATH Keywords

hypercuberoutingcube-connected cyclesgrid-based scientific computationsmultiple-path embeddings

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Parallel algorithms in computer science (68W10) Mathematical problems of computer architecture (68M07)

Recommendations

• scientific article; zbMATH DE number 1420909
• Spanning multi-paths in hypercubes
• Multicolor routing in the undirected hypercube
• Routings for involutions of a hypercube
• Routing and path multicoloring
• On Disjoint Shortest Paths Routing on the Hypercube
• Routing a permutation in the hypercube by two sets of edge disjoint paths
• An effective routing algorithm in incomplete hypercubes
• Spanning paths in hypercubes

Cites work

• scientific article; zbMATH DE number 4173021 (Why is no real title available?)
• scientific article; zbMATH DE number 4064518 (Why is no real title available?)
• scientific article; zbMATH DE number 3573250 (Why is no real title available?)
• A unified framework for off-line permutation routing in parallel networks
• Deadlock-Free Message Routing in Multiprocessor Interconnection Networks
• Efficient dispersal of information for security, load balancing, and fault tolerance
• Embedding the polytomic tree into the $n$-cube
• Fast algorithms for bit-serial routing on a hypercube
• How to emulate shared memory
• On Embedding Rectangular Grids in Square Grids
• Optimal embeddings of butterfly-like graphs in the hypercube
• Parallel hashing
• Spanning Balanced Trees in Boolean Cubes
• Universal Graphs for Bounded-Degree Trees and Planar Graphs

Cited in

(9)

• Hypercube multiprocessors with bus connections for improving communication performance
• About message routing in different hypercube interconnection network types.
• Routing properties of supercubes
• Multiple network embeddings into hypercubes
• Mapping rings and grids onto the FPS T-series hypercube
• Multiple regular graph embeddings into a hypercube with unbounded expansion
• Hypercube embedding heuristics: An evaluation
• Hypercomplete: A pancyclic recursive topology for large-scale distributed multicomputer systems
• On constructing multiple spanning trees in a hypercube

This page was built for publication: Routing multiple paths in hypercubes

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