Optimal permutation routing for low-dimensional hypercubes

DOI10.1002/NET.20325MaRDI QIDQ3057142zbMATH OpenOpenAlexFDO

Authors A. K. Laing, David Krumme

Publication date 24 November 2010

Published in Networks (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1002/net.20325

zbMATH Keywords

hypercubespermutation routinghypercube perfect matchingsqueueless communication

Mathematics Subject Classification ID

Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Network design and communication in computer systems (68M10)

Recommendations

• Some permutation routing algorithms for low-dimensional hypercubes
• Hypercube permutations routable under all dimension orderings
• scientific article; zbMATH DE number 5233147
• Almost optimal permutation routing on hypercubes
• Tight bounds for oblivious routing in the hypercube

Cites work

• scientific article; zbMATH DE number 42862 (Why is no real title available?)
• scientific article; zbMATH DE number 52113 (Why is no real title available?)
• scientific article; zbMATH DE number 1202980 (Why is no real title available?)
• scientific article; zbMATH DE number 6472620 (Why is no real title available?)
• A \(2n-2\) step algorithm for routing in an \(n \times n\) array with constant-size queues
• A d-move local permutation routing for the d-cube
• A unified framework for off-line permutation routing in parallel networks
• Algorithms for Matrix Transposition on Boolean N-Cube Configured Ensemble Architectures
• Almost optimal permutation routing on hypercubes
• Congestion-free Optimal Routings of Hypercube Automorphisms
• Congestion-free Routings of Linear Complement Permutations
• Counterexample to a conjecture of Szymanski on hypercube routing
• Deterministic Permutation Routing on Meshes
• Deterministic sorting in nearly logarithmic time on the hypercube and related computers
• Generalized Connection Networks for Parallel Processor Intercommunication
• Generalized shuffle permutations on Boolean cubes
• Hypercube permutations routable under all dimension orderings
• Packet routing in fixed-connection networks: A survey
• Randomized multipacket routing and sorting on meshes
• Routing Permutations on Graphs via Matchings
• Routing permutations on a graph
• Some permutation routing algorithms for low-dimensional hypercubes
• The number of perfect matchings in a hypercube
• Tight bounds for oblivious routing in the hypercube
• Very efficient cyclic shifts on hypercubes.

Cited in

(13)

• Oriented hypercubes
• Some permutation routing algorithms for low-dimensional hypercubes
• On the size of permutation networks and consequences for efficient simulation of hypercube algorithms on bounded-degree networks
• Oblivious routing for LC permutations on hypercubes.
• Congestion-free Routings of Linear Complement Permutations
• On the sizes of permutation networks and consequences for efficient simulation of hypercube algorithms on bounded-degree networks
• Fast permutation routing in a class of interconnection networks
• scientific article; zbMATH DE number 5233147 (Why is no real title available?)
• Conflict-free routing for BPC-permutations on synchronous hypercubes
• Almost optimal permutation routing on hypercubes
• Congestion-free Optimal Routings of Hypercube Automorphisms
• Routing linear permutations on Fibonacci and Lucas cubes
• A d-move local permutation routing for the d-cube

This page was built for publication: Optimal permutation routing for low-dimensional hypercubes

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