Fast permutation routing in a class of interconnection networks
From MaRDI portal
Recommendations
- A fast parallel algorithm for routing in permutation networks
- PERMUTATION ROUTING AND SORTING ON THE RECONFIGURABLE MESH
- Permutation routing on reconfigurable meshes
- A unified framework for off-line permutation routing in parallel networks
- scientific article; zbMATH DE number 1202980
- Optimal permutation routing for low-dimensional hypercubes
- A new routing algorithm for the shuffle-exchange permutation network
- An efficient routing algorithm for realizing linear permutations on p/sup t/-shuffle-exchange networks
Cited in
(17)- Don't be too clever: Routing BMMC permutations on the MasPar MP-2
- A fast VLSI-efficient self-routing permutation network
- New self-routing permutation networks
- A new self-routing permutation network
- Serial array time slot interchangers and optical implementations
- An optimal algorithm for permutation admissibility to multistage interconnection networks
- An optimal O(NlgN) algorithm for permutation admissibility to extra-stage cube-type networks
- A fast parallel algorithm for routing in permutation networks
- Exploiting colored Petri nets to decide on permutation admissibility
- Routing Algorithms for Cellular Interconnection Arrays
- An application of an initialization protocol to permutation routing in a single-hop mobile ad hoc networks
- The complexity of routing in Clos permutation networks
- scientific article; zbMATH DE number 1512699 (Why is no real title available?)
- scientific article; zbMATH DE number 3904502 (Why is no real title available?)
- PERMUTATION ROUTING AND SORTING ON THE RECONFIGURABLE MESH
- Permutation routing on reconfigurable meshes
- Routing linear permutations on Fibonacci and Lucas cubes
This page was built for publication: Fast permutation routing in a class of interconnection networks
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4785223)
