A \(d\)-move local permutation routing for the \(d\)-cube

DOI10.1016/S0166-218X(96)00019-4zbMath0869.68018OpenAlexW2003009680MaRDI QIDQ674437

Miltos D. Grammatikakis, Frank K. Hwang, Yi-Ching Yao

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

zbMATH Keywords

interconnection networks\(d\)-cubespacket routing algorithms

Mathematics Subject Classification ID

Computer system organization (68M99)

Related Items (2)

Optimal permutation routing for low-dimensional hypercubes ⋮ Some permutation routing algorithms 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

This page was built for publication: A \(d\)-move local permutation routing for the \(d\)-cube