Parallel Permutations of Data: A Benes Network Control Algorithm for Frequently Used Permutations
From MaRDI portal
Publication:4156340
DOI10.1109/TC.1978.1675164zbMath0377.94049OpenAlexW2093762724MaRDI QIDQ4156340
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
Algorithms in computer science (68W99) Software, source code, etc. for problems pertaining to information and communication theory (94-04)
Related Items
Hypercube permutations routable under all dimension orderings ⋮ A \(d\)-move local permutation routing for the \(d\)-cube ⋮ Permutations on the block PRAM ⋮ Permuting data with the Omega network ⋮ Rotator design ⋮ Exploiting colored Petri nets to decide on permutation admissibility ⋮ A generalization of the perfect shuffle ⋮ A direct routing algorithm for the bit-reversal permutation on a shuffle- exchange network