Some permutation routing algorithms for low-dimensional hypercubes

DOI10.1016/S0304-3975(00)00279-6MaRDI QIDQ5958304zbMATH OpenOpenAlexFDO

Authors Frank K. Hwang, Yi-Ching Yao, Bhaskar Dasgupta

Publication date 3 March 2002

Published in Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/s0304-3975(00)00279-6

zbMATH Keywords

hypercubeoblivious routingpermutation routingdestination graph

Mathematics Subject Classification ID

Combinatorics in computer science (68R05) Nonnumerical algorithms (68W05)

Recommendations

• Optimal permutation routing for low-dimensional hypercubes
• A d-move local permutation routing for the d-cube
• Almost optimal permutation routing on hypercubes
• Tight bounds for oblivious routing in the hypercube
• Oblivious routing for LC permutations on hypercubes.

Cites work

• scientific article; zbMATH DE number 52113 (Why is no real title available?)
• A Scheme for Fast Parallel Communication
• A d-move local permutation routing for the d-cube
• Comments on the oblivious routing algorithm of Kaklamanis, Krizanc, and Tsantilas in the hypercube
• How much can hardware help routing?
• Routing, merging, and sorting on parallel models of computation
• Tight bounds for oblivious routing in the hypercube

Cited in

(13)

• Oriented hypercubes
• Routing permutations and 2-1 routing requests in the hypercube
• Load balancing and routing on the hypercube and related networks
• Routing automorphisms of the hypercube
• The generalized folding-cube network
• Oblivious routing for LC permutations on hypercubes.
• Optimal permutation routing for low-dimensional hypercubes
• A new routing algorithm for cyclic shifts on BRGC hypercubes
• scientific article; zbMATH DE number 5233147 (Why is no real title available?)
• scientific article; zbMATH DE number 1420909 (Why is no real title available?)
• Almost optimal permutation routing on hypercubes
• Routing linear permutations on Fibonacci and Lucas cubes
• A d-move local permutation routing for the d-cube

This page was built for publication: Some permutation routing algorithms for low-dimensional hypercubes

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