CPL - Chalmers Publication Library
| Utbildning | Forskning | Styrkeområden | Om Chalmers | In English In English Ej inloggad.

Fast Parallel GPU-Sorting Using a Hybrid Algorithm

Erik Sintorn (Institutionen för data- och informationsteknik, Datorteknik (Chalmers)) ; Ulf Assarsson (Institutionen för data- och informationsteknik, Datorteknik (Chalmers))
Journal of Parallel and Distributed Computing Vol. 68 (2008), 10, p. 1381-1388 .
[Artikel, refereegranskad vetenskaplig]

This paper presents an algorithm for fast sorting of large lists using modern GPUs. The method achieves high speed by efficiently utilizing the parallelism of the GPU throughout the whole algorithm. Initially, GPU-based bucketsort or quicksort splits the list into enough sublists then to be sorted in parallel using merge-sort. The algorithm is of complexity nlogn, and for lists of 8 M elements and using a single Geforce 8800 GTS-512, it is 2.5 times as fast as the bitonic sort algorithms, with standard complexity of n(logn)2, which for a long time was considered to be the fastest for GPU sorting. It is 6 times faster than single CPU quicksort, and 10% faster than the recent GPU-based radix sort. Finally, the algorithm is further parallelized to utilize two graphics cards, resulting in yet another 1.8 times speedup.

Denna post skapades 2009-01-12. Senast ändrad 2017-10-03.
CPL Pubid: 85176


Institutioner (Chalmers)

Institutionen för data- och informationsteknik, Datorteknik (Chalmers)



Chalmers infrastruktur

Relaterade publikationer

Denna publikation ingår i:

Efficient rendering of semi-transparent geometry in real-time