Istituto di Scienza e Tecnologie dell'Informazione     
Capannini G., Silvestri F., Baraglia R. Sorting on GPUs for large scale datasets: a thorough comparison. In: Information Processing & Management, vol. 48 (5) pp. 903 - 917. Elsevier, 2012.
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 O(1). We experimentally compare our solution with state-of-the-art ones (namely, quick-sort and radix-sort) 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 quick-sort and slightly slower than radix, yet being an in-place solution it consumes less memory than both algorithms.
URL: http://www.sciencedirect.com/science/article/pii/S0306457310001007
DOI: 10.1016/j.ipm.2010.11.010
Subject Algorithms performance sorting
Algorithms performance sorting

Icona documento 1) Download Document PDF
Icona documento 2) Download Document PDF
Icona documento 3) Download Document PDF

Icona documento Open access Icona documento Restricted Icona documento Private


Per ulteriori informazioni, contattare: Librarian http://puma.isti.cnr.it

Valid HTML 4.0 Transitional