Results

**1 - 2**of**2**### GRS -- GPU Radix Sort For Multifield Records

"... We develop a radix sort algorithm suitable to sort multifield records on a graphics processing unit (GPU). We assume the ByF ield layout for records to be sorted. Our radix sort algorithm, GRS, is benchmarked against the radix sort algorithm in NVIDIA’s CUDA SDK 3.0, which is the fastest known GPU s ..."

Abstract
- Add to MetaCart

We develop a radix sort algorithm suitable to sort multifield records on a graphics processing unit (GPU). We assume the ByF ield layout for records to be sorted. Our radix sort algorithm, GRS, is benchmarked against the radix sort algorithm in NVIDIA’s CUDA SDK 3.0, which is the fastest known GPU sorting algorithm for 32-bit integers. Our experiments show that GRS is 21 % faster than SDK sort while sorting 100M numbers and is faster by between 34 % and 55% when sorting 40M records with 1 to 9 32-bit fields. This makes GRS the fastest sort algorithm for GPUs.

### 2.2 Sorting Numbers on GPUs................................................ 48 2.2.1 SDK Radix Sort Algorithm....................................... 50 2.2.1.1 Step 1–Sorting tiles...................................... 51 2.2.1.2 Step 2–Calculating histog

"... 2.2.2.2 Step 2–Prefix sum of tile histograms.................... 59 2.2.2.3 Step 3–Positioning numbers in a tile.................... 59 2.2.3 SRTS Radix Sort.................................................. 2.2.3.1 Step 1–Bottom level reduce.............................. ..."

Abstract
- Add to MetaCart

2.2.2.2 Step 2–Prefix sum of tile histograms.................... 59 2.2.2.3 Step 3–Positioning numbers in a tile.................... 59 2.2.3 SRTS Radix Sort.................................................. 2.2.3.1 Step 1–Bottom level reduce..............................