Sciweavers

2 search results - page 1 / 1
» Matching the Bisection Bound for Routing and Sorting on the ...
Sort
View
SPAA
1992
ACM
13 years 8 months ago
Matching the Bisection Bound for Routing and Sorting on the Mesh
d abstract) Michael Kaufmann Sanguthevar Rajasekaran Jop F. Sibeyn In this paper we present randomized algorithms for kk routing, k-k sorting, and cut through routing on the mesh ...
Michael Kaufmann, Sanguthevar Rajasekaran, Jop F. ...
SPAA
1996
ACM
13 years 8 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