A unified framework for off-line permutation routing in parallel networks

DOI10.1007/BF02090401zbMath0731.68010OpenAlexW2066732775MaRDI QIDQ3357514

Marc Baumslag, Fred S. Annexstein

Publication date: 1991

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

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

zbMATH Keywords

Cayley graphsfaulty networksinterprocessor communicationproduct network

Mathematics Subject Classification ID

Parallel algorithms in computer science (68W10) Mathematical problems of computer architecture (68M07)

Related Items

Solving fundamental problems on sparse-meshes ⋮ An approach to emulating separable graphs ⋮ Many-to-many routing on trees via matchings ⋮ Routing on trees ⋮ Product-shuffle networks: Toward reconciling shuffles and butterflies ⋮ Optimal permutation routing for low-dimensional hypercubes ⋮ Routing multiple paths in hypercubes ⋮ On-line matching routing on trees ⋮ Separator-based graph embedding into multidimensional grids with small edge-congestion ⋮ A finite automata approach to modeling the cross product of interconnection networks.

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Ramanujan graphs
• Bounds for sorting by prefix reversal
• The Gamma Network
• Fast algorithms for bit-serial routing on a hypercube
• Group Action Graphs and Parallel Architectures
• Interconnection Networks Based on a Generalization of Cube-Connected Cycles
• A group-theoretic model for symmetric interconnection networks
• An optimal routing algorithm for mesh-connected Parallel computers
• Notes on Shuffle/Exchange-Type Switching Networks
• The Extra Stage Cube: A Fault-Tolerant Interconnection Network for Supersystems
• Parallel Algorithms to Set Up the Benes Permutation Network
• Minimal diameter double-loop networks. I. Large infinite optimal families
• Deadlock-Free Message Routing in Multiprocessor Interconnection Networks