Sciweavers

7 search results - page 2 / 2
» Derandomizing Algorithms for Routing and Sorting on Meshes
Sort
View
IPPS
1998
IEEE
13 years 10 months ago
On Randomized and Deterministic Schemes for Routing and Sorting on Fixed-Connection Networks
Abstract. We give a high-level description of some fundamental randomized and deterministic techniques for routing and sorting on xedconnection networks such as meshes, hypercubes ...
Torsten Suel
SPAA
1996
ACM
13 years 10 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