A d-move local permutation routing for the d-cube

DOI10.1016/S0166-218X(96)00019-4MaRDI QIDQ674437zbMATHOpenAlexFDO

Authors Frank K. Hwang, Miltos D. Grammatikakis, 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)

Recommendations

• Some permutation routing algorithms for low-dimensional hypercubes
• Optimal permutation routing for low-dimensional hypercubes
• Publication:4944978
• Almost optimal permutation routing on hypercubes
• Routing a permutation in the hypercube by two sets of edge disjoint paths
• Routing permutations and 2-1 routing requests in the hypercube
• Permutation routing and \((\ell , k)\)-routing on plane grids
• Oblivious routing for LC permutations on hypercubes.
• Optimally routing LC permutations on k-extra-stage cube-type networks
• Fault-tolerant permutation routing in hypercubes

Cites work

• Access and Alignment of Data in an Array Processor
• 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
• Parallel Permutations of Data: A Benes Network Control Algorithm for Frequently Used Permutations

Cited in

(2)

• Some permutation routing algorithms for low-dimensional hypercubes
• Optimal permutation routing for low-dimensional hypercubes

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q674437)