Idioma:

GRS - GPU radix sort for multifield records

Bandyopadhyay, S ; Sahni, S

2010 International Conference on High Performance Computing, 2010, p.1-10

Texto completo disponível

Citações Citado por

Título:
GRS - GPU radix sort for multifield records
Autor: Bandyopadhyay, S ; Sahni, S
Assuntos: Graphics processing unit ; Graphics Processing Units ; Histograms ; Instruction sets ; Kernel ; Layout ; radix sort ; Registers ; sorting multifield records ; Tiles
É parte de: 2010 International Conference on High Performance Computing, 2010, p.1-10
Descrição: We develop a radix sort algorithm, GRS, suitable to sort multifield records on a graphics processing unit (GPU). We assume the ByField layout for records to be sorted. GRS is benchmarked against the radix sort algorithm, SDK, in NVIDIA's CUDA SDK 3.0 as well as the radix sort algorithm, SRTS, of Merrill and Grimshaw. Although SRTS is faster than both GRS and SDK when sorting numbers as well as records that have a key and an additional 32-bit field, both GRS and SDK outperform SRTS on records with 2 or more fields (in addition to the key). GRS is consistently faster than SDK on numbers as well as records with 1 or more fields. When sorting records with 9 32-bit fields, GRS is up to 74% faster than SRTS and up to 55% faster than SDK. Thus, GRS is the fastest way to radix sort records with more than 1 32-bit field on a GPU.
Editor: IEEE
Idioma: Inglês

Links

Voltar para lista de resultados

Anterior Resultado 20 Avançar Ir para próxima página