Parallel Permutations of Data: A Benes Network Control Algorithm for Frequently Used Permutations
From MaRDI portal
Publication:4156340
Cited in
(8)- Exploiting colored Petri nets to decide on permutation admissibility
- A generalization of the perfect shuffle
- Permutations on the block PRAM
- A direct routing algorithm for the bit-reversal permutation on a shuffle- exchange network
- Rotator design
- Hypercube permutations routable under all dimension orderings
- Permuting data with the Omega network
- A \(d\)-move local permutation routing for the \(d\)-cube
This page was built for publication: Parallel Permutations of Data: A Benes Network Control Algorithm for Frequently Used Permutations
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4156340)