Parallel Permutations of Data: A Benes Network Control Algorithm for Frequently Used Permutations

DOI10.1109/TC.1978.1675164zbMATH Open0377.94049OpenAlexW2093762724MaRDI QIDQ4156340FDOQ4156340

Jacques Lenfant

Publication date: 1978

Published in: IEEE Transactions on Computers (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1109/tc.1978.1675164

Mathematics Subject Classification ID

Algorithms in computer science (68W99) Software, source code, etc. for problems pertaining to information and communication theory (94-04)

Cited In (8)

• Hypercube permutations routable under all dimension orderings
• Rotator design
• Exploiting colored Petri nets to decide on permutation admissibility
• A generalization of the perfect shuffle
• Permutations on the block PRAM
• Permuting data with the Omega network
• A direct routing algorithm for the bit-reversal permutation on a shuffle- exchange 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)