7 search results - page 2 / 2 » Sorting-Based Selection Algorithms for Hypercubic Networks |
STOC
1993
ACM
13 years 10 months ago
1993
ACM
We consider a class of routing problems on connected graphs G. Initially, each vertex v of G is occupied by a “pebble” which has a unique destination π(v) in G (so that π is...
FOCS
2002
IEEE
13 years 11 months ago
2002
IEEE
A principle task in parallel and distributed systems is to reduce the communication load in the interconnection network, as this is usually the major bottleneck for the performanc...