A \(d\)-move local permutation routing for the \(d\)-cube
From MaRDI portal
Publication:674437
DOI10.1016/S0166-218X(96)00019-4zbMath0869.68018MaRDI QIDQ674437
Frank K. Hwang, Yi-Ching Yao, Miltos D. Grammatikakis
Publication date: 5 March 1997
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Full work available at URL: http://www.elsevier.com/locate/dam
68M99: Computer system organization
Related Items
Some permutation routing algorithms for low-dimensional hypercubes, Optimal permutation routing for low-dimensional hypercubes
Cites Work
- Counterexample to a conjecture of Szymanski on hypercube routing
- Invariant Properties of the Shuffle-Exchange and a Simplified Cost-Effective Version of the Omega Network
- Access and Alignment of Data in an Array Processor
- Parallel Permutations of Data: A Benes Network Control Algorithm for Frequently Used Permutations