A Performance Comparison of Sort and Scan Libraries for GPUs
arXiv:1601.03144 · doi:10.1142/S0129626415500073
Abstract
Sorting and scanning are two fundamental primitives for constructing highly parallel algorithms. A number of libraries now provide implementations of these primitives for GPUs, but there is relatively little information about the performance of these implementations. We benchmark seven libraries for 32-bit integer scan and sort, and sorting 32-bit values by 32-bit integer keys. We show that there is a large variation in performance between the libraries, and that no one library has both optimal performance and portability.
Preprint of an article published in Parallel Processing Letters, 25, 4, 2015, 1550007 DOI: 10.1142/S0129626415500073 © copyright World Scientific Publishing Company <http://www.worldscientific.com/worldscinet/ppl>