%0 Journal Article %1 capannini12 %A Capannini, Gabriele %A Silvestri, Fabrizio %A Baraglia, Ranieri %D 2012 %J Information Processing & Management %K algorithm gpu parallel sorting %N 5 %P 903--917 %R 10.1016/j.ipm.2010.11.010 %T Sorting on GPUs for Large Scale Datasets: a Thorough Comparison %V 48 %X Although sort has been extensively studied in many research works, it still remains a challenge in particular if we consider the implications of novel processor technologies such as manycores (i.e. GPUs, Cell/BE, multicore, etc.). In this paper, we compare different algorithms for sorting integers on stream multiprocessors and we discuss their viability on large datasets (such as those managed by search engines). In order to fully exploit the potentiality of the underlying architecture, we designed an optimized version of sorting network in the K-model, a novel computational model designed to consider all the important features of many-core architectures. According to K-model, our bitonic sorting network mapping improves the three main aspects of many-core architectures, i.e. the processors exploitation, and the on-chip/off-chip memory bandwidth utilization. Furthermore we are able to attain a space complexity of Θ(1). We experimentally compare our solution with state-of-the-art ones (namely, Quicksort and Radixsort) on GPUs. We also compute the complexity in the K-model for such algorithms. The conducted evaluation highlight that our bitonic sorting network is faster than Quicksort and slightly slower than radix, yet being an in-place solution it consumes less memory than both algorithms.

@article{capannini12, abstract = {Although sort has been extensively studied in many research works, it still remains a challenge in particular if we consider the implications of novel processor technologies such as manycores (i.e. GPUs, Cell/BE, multicore, etc.). In this paper, we compare different algorithms for sorting integers on stream multiprocessors and we discuss their viability on large datasets (such as those managed by search engines). In order to fully exploit the potentiality of the underlying architecture, we designed an optimized version of sorting network in the K-model, a novel computational model designed to consider all the important features of many-core architectures. According to K-model, our bitonic sorting network mapping improves the three main aspects of many-core architectures, i.e. the processors exploitation, and the on-chip/off-chip memory bandwidth utilization. Furthermore we are able to attain a space complexity of Θ(1). We experimentally compare our solution with state-of-the-art ones (namely, Quicksort and Radixsort) on GPUs. We also compute the complexity in the K-model for such algorithms. The conducted evaluation highlight that our bitonic sorting network is faster than Quicksort and slightly slower than radix, yet being an in-place solution it consumes less memory than both algorithms. }, added-at = {2016-11-08T10:03:55.000+0100}, author = {Capannini, Gabriele and Silvestri, Fabrizio and Baraglia, Ranieri}, biburl = {https://www.bibsonomy.org/bibtex/28476074f395ce0952e271b38125621c6/ytyoun}, doi = {10.1016/j.ipm.2010.11.010}, interhash = {76d7347648f405c058033e142f24c0b1}, intrahash = {8476074f395ce0952e271b38125621c6}, issn = {0306-4573}, journal = {Information Processing \& Management }, keywords = {algorithm gpu parallel sorting}, note = {Large-Scale and Distributed Systems for Information Retrieval }, number = 5, pages = {903--917}, timestamp = {2016-12-29T04:53:34.000+0100}, title = {Sorting on {GPUs} for Large Scale Datasets: a Thorough Comparison }, volume = 48, year = 2012 }