Fast parallel GPU-sorting using a hybrid algorithm
From MaRDI portal
Publication:436896
DOI10.1016/J.JPDC.2008.05.012zbMATH Open1243.68317OpenAlexW1995596660MaRDI QIDQ436896FDOQ436896
Authors: Erik Sintorn, Ulf Assarsson 
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
Recommendations
Searching and sorting (68P10) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Parallel algorithms in computer science (68W10)
Cites Work
Cited In (11)
- Sorting and Permuting without Bank Conflicts on GPUs
- Fast parallel GPU-sorting using a hybrid algorithm
- An efficient parallel sorting compatible with the standard qsort
- Fast sort of floating-point data for data engineering
- Efficient random walks for generating random fuzzy measures in Möbius representation in large universe
- Fast <it>k</it>-selection algorithms for graphics processing units
- Efficient neighbor search for particle methods on GPUs
- Derivative-free optimization and neural networks for robust regression
- Parallel sorting for GPUs
- GPU-quicksort, a practical quicksort algorithm for graphics processors
- Parallel bucket sorting on graphics processing units based on convex optimization
Uses Software
This page was built for publication: Fast parallel GPU-sorting using a hybrid algorithm
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q436896)
