264 search results - page 1 / 53 » Sample Sort on Meshes |
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...
IPPS
1998
IEEE
13 years 9 months ago
1998
IEEE
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 ...
CORR
2010
Springer
13 years 5 months ago
2010
Springer
We present and evaluate GPU Bucket Sort, a parallel deterministic sample sort algorithm for many-core GPUs. Our method is considerably faster than Thrust Merge (Satish et.al., Pro...
IPPS
2000
IEEE
13 years 9 months ago
2000
IEEE
HeteroSort load balances and sorts within static or dynamic networks using a conceptual torus mesh. We ported HeteroSort to a 16-node Beowulf cluster with a central switch architec...
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...