Fast parallel GPU-sorting using a hybrid algorithm

DOI10.1016/j.jpdc.2008.05.012zbMath1243.68317OpenAlexW1995596660MaRDI QIDQ436896

Ulf Assarsson, Erik Sintorn

Publication date: 26 July 2012

Published in: Journal of Parallel and Distributed Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.jpdc.2008.05.012

zbMATH Keywords

sortingparallelismGPU-algorithms

Mathematics Subject Classification ID

Searching and sorting (68P10) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Parallel algorithms in computer science (68W10)

Related Items (7)

AN EFFICIENT PARALLEL SORTING COMPATIBLE WITH THE STANDARD QSORT ⋮ Fast sort of floating-point data for data engineering ⋮ Fast parallel GPU-sorting using a hybrid algorithm ⋮ Efficient Neighbor Search for Particle Methods on GPUs ⋮ Parallel Sorting for GPUs ⋮ Parallel bucket sorting on graphics processing units based on convex optimization ⋮ Derivative-free optimization and neural networks for robust regression

Uses Software

• CUDA
• GPUTeraSort
• GPUSort
• GPU-ABiSort
• Quicksort
• Find

Cites Work

• Fast parallel GPU-sorting using a hybrid algorithm
• Adaptive Bitonic Sorting: An Optimal Parallel Algorithm for Shared-Memory Machines

This page was built for publication: Fast parallel GPU-sorting using a hybrid algorithm