Results

**1 - 4**of**4**### 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

(Show Context)
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..............................

### Sorting Large Multifield Records on a GPU*

"... Abstract—We extend the fastest comparison based (sample sort) and non-comparison based (radix sort) number sorting algorithms on a GPU to sort large multifield records. Two extensions- direct (the entire record is moved whenever its key is to be moved) and indirect ((key,index) pairs are sorted usin ..."

Abstract
- Add to MetaCart

(Show Context)
Abstract—We extend the fastest comparison based (sample sort) and non-comparison based (radix sort) number sorting algorithms on a GPU to sort large multifield records. Two extensions- direct (the entire record is moved whenever its key is to be moved) and indirect ((key,index) pairs are sorted using the direct extension and then records are ordered according to the obtained index permutation) are discussed. Our results show that for the ByField layout, the direct extension of the radix sort algorithm GRS [1] is the fastest for 32-bit keys when records have at least 12 fields; otherwise, the direct extension of the radix sort algorithm SRTS [13] is the fastest. For the Hybrid layout, the indirect extension of SRTS is the fastest. Index Terms—Graphics Processing Units, sorting multifield records, radix sort, sample sort. I.

### GRS- GPU Radix Sort For Multifield Records*

"... Abstract—We extend the number sorting algorithms on the GPU to sort large multi-field records. We notice that traditional way of sorting the records by first sorting a (key, index) pair to obtain the sorted permutation of the records followed by actually rearranging the entire records to their final ..."

Abstract
- Add to MetaCart

(Show Context)
Abstract—We extend the number sorting algorithms on the GPU to sort large multi-field records. We notice that traditional way of sorting the records by first sorting a (key, index) pair to obtain the sorted permutation of the records followed by actually rearranging the entire records to their final position might not actually be the most efficient way to sort them depending on the type of sorting algorithm used and the layouts of the records in the memory. Index Terms—Graphics Processing Units, sorting multifield records, radix sort, merge sort, sample sort. I.