7 search results - page 1 / 2 » Derandomizing Algorithms for Routing and Sorting on Meshes |
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...
EUROPAR
1997
Springer
13 years 9 months ago
1997
Springer
In this paper various algorithms for sorting on processor networks are considered. We focus on meshes, but the results can be generalized easily to other decomposable architecture...
STACS
1995
Springer
13 years 8 months ago
1995
Springer
Abstract. We present algorithms for sorting and routing on two-dimensional mesh-connected parallel architectures that are optimal on average. If one processor has many packets then...
SPAA
1992
ACM
13 years 9 months ago
1992
ACM
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 ...
IPPS
1998
IEEE
13 years 9 months ago
1998
IEEE
The mesh-connected array is an attractive architecture for parallel machines, and a number of existing parallel machines are based on a mesh topology. In this paper, we survey the ...