Hyksort: a new variant of hypercube quicksort on distributed memory architectures
In this paper, we present HykSort, an optimized comparison sort for distributed memory
architectures that attains more than 2× improvement over bitonic sort and samplesort. The
algorithm is based on the hypercube quicksort, but instead of a binary recursion, we perform
ak-way recursion in which the pivots are selected accurately with an iterative parallel select
algorithm. The single-node sort is performed using a vectorized and multithreaded merge
sort. The advantages of HykSort are lower communication costs, better load balancing, and …
architectures that attains more than 2× improvement over bitonic sort and samplesort. The
algorithm is based on the hypercube quicksort, but instead of a binary recursion, we perform
ak-way recursion in which the pivots are selected accurately with an iterative parallel select
algorithm. The single-node sort is performed using a vectorized and multithreaded merge
sort. The advantages of HykSort are lower communication costs, better load balancing, and …
HykSort: a new variant of hypercube quicksort on distributed memory architectures. In: ICS'13 Proceedings of the 27th international ACM conference on International …
In this paper, we present HykSort, an optimized comparison sort for distributed memory
architectures that attains more than 2× improvement over bitonic sort and samplesort. The
algorithm is based on the hypercube quicksort, but instead of a binary recursion, we perform
a k-way recursion in which the pivots are selected accurately with an iterative parallel select
algorithm. The single-node sort is performed using a vectorized and multithreaded merge
sort. The advantages of HykSort are lower communication costs, better load balancing, and …
architectures that attains more than 2× improvement over bitonic sort and samplesort. The
algorithm is based on the hypercube quicksort, but instead of a binary recursion, we perform
a k-way recursion in which the pivots are selected accurately with an iterative parallel select
algorithm. The single-node sort is performed using a vectorized and multithreaded merge
sort. The advantages of HykSort are lower communication costs, better load balancing, and …
Showing the best results for this search. See all results