Sciweavers

4 search results - page 1 / 1
» Optimal permutation routing for low-dimensional hypercubes
Sort
View
30
Voted
NETWORKS
2010
13 years 9 months ago
Optimal permutation routing for low-dimensional hypercubes
Ambrose Kofi Laing, David W. Krumme
TCS
2002
13 years 10 months ago
Some permutation routing algorithms for low-dimensional hypercubes
Oblivious permutation routing in binary d-cubes has been well studied in the literature. In a permutation routing, each node initially contains a packet with a destination such th...
Frank K. Hwang, Y. C. Yao, Bhaskar DasGupta
SPAA
1996
ACM
14 years 3 months ago
From AAPC Algorithms to High Performance Permutation Routing and Sorting
Several recent papers have proposed or analyzed optimal algorithms to route all-to-all personalizedcommunication (AAPC) over communication networks such as meshes, hypercubes and ...
Thomas Stricker, Jonathan C. Hardwick