19 search results - page 1 / 4 » Optimal Many-to-One Routing on the Mesh with Constant Queues |
EUROPAR
2001
Springer
13 years 9 months ago
2001
Springer
We present randomized and deterministic algorithms for many-to-one routing on an n-node two-dimensional mesh under the store-and-forward model of packet routing. We consider the g...
SPDP
1991
IEEE
13 years 8 months ago
1991
IEEE
In this paper, we present a randomized algorithm for the multipacket (i.e., k − k) routing problem on an n × n mesh. The algorithm completes with high probability in at the mos...
STACS
1991
Springer
13 years 8 months ago
1991
Springer
SODA
1994
ACM
13 years 6 months ago
1994
ACM
We describe a new technique that can be used to derandomize a number of randomized algorithms for routing and sorting on meshes. We demonstrate the power of this technique by deri...
IICS
2009
Springer
13 years 11 months ago
2009
Springer
: This paper introduces an adaptive routing approach based on buffer status and distance in a mesh overlay network: Thermal Field is used for considering buffer stage and distance ...