Optimal permutation routing for low-dimensional hypercubes
From MaRDI portal
Publication:3057142
DOI10.1002/NET.20325zbMATH Open1213.68088OpenAlexW4252455914MaRDI QIDQ3057142FDOQ3057142
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
Recommendations
Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Network design and communication in computer systems (68M10)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Randomized multipacket routing and sorting on meshes
- Routing Permutations on Graphs via Matchings
- The number of perfect matchings in a hypercube
- Packet routing in fixed-connection networks: A survey
- Congestion-free Optimal Routings of Hypercube Automorphisms
- Hypercube permutations routable under all dimension orderings
- Counterexample to a conjecture of Szymanski on hypercube routing
- Generalized Connection Networks for Parallel Processor Intercommunication
- Deterministic sorting in nearly logarithmic time on the hypercube and related computers
- A \(2n-2\) step algorithm for routing in an \(n \times n\) array with constant-size queues
- 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
- Some permutation routing algorithms for low-dimensional hypercubes
- A \(d\)-move local permutation routing for the \(d\)-cube
- Very efficient cyclic shifts on hypercubes.
- Tight bounds for oblivious routing in the hypercube
- Routing permutations on a graph
- Generalized shuffle permutations on Boolean cubes
- Title not available (Why is that?)
- Deterministic Permutation Routing on Meshes
- Title not available (Why is that?)
- Congestion-free Routings of Linear Complement Permutations
Cited In (13)
- 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
- Title not available (Why is that?)
- 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
- Oriented hypercubes
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)
