| | |
Summary: Fast Parallel GPU-Sorting Using a Hybrid
Algorithm
Erik Sintorn
Department of Computer Science and Engineering
Chalmers University Of Technology
Gothenburg, Sweden
Email: erik.sintorn@chalmers.se
Ulf Assarsson
Department of Computer Science and Engineering
Chalmers University Of Technology
Gothenburg, Sweden
Email: uffe at chalmers dot se
Abstract-- 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, a parallel bucketsort splits the list into
enough sublists then to be sorted in parallel using merge-sort. The
parallel bucketsort, implemented in NVIDIA's CUDA, utilizes the
synchronization mechanisms, such as atomic increment, that is
available on modern GPUs. The mergesort requires scattered
|
