85 search results - page 5 / 17 » Distribution sort with randomized cycling |
CORR
2000
Springer
14 years 11 months ago
2000
Springer
The weak limit of the normalized number of comparisons needed by the Quicksort algorithm to sort n randomly permuted items is known to be determined implicitly by a distributional...
101
Voted
IPPS
1998
IEEE
15 years 3 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 ...
CCGRID
2005
IEEE
15 years 5 months ago
2005
IEEE
— The global internet is rich in commodity resources but scarce in specialized resources. We argue that a grid framework can achieve better performance if it separates management...
SPAA
2009
ACM
15 years 8 months ago
2009
ACM
A K-smoothing network is a distributed, low-contention data structure where tokens arrive arbitrarily on w input wires and reach w output wires via their completely asynchronous p...
85
Voted
JEA
1998
14 years 11 months ago
1998
We introduce a new deterministic parallel sorting algorithm based on the regular sampling approach. The algorithm uses only two rounds of regular all-to-all personalized communica...