Parallel bucket sorting on graphics processing units based on convex optimization
- Publication Type:
- Journal Article
- Optimization, 2015, 64 (4), pp. 1033 - 1055
- Issue Date:
Files in This Item:
|Parallel bucket sorting on graphics processing units based on convex optimization.pdf||Published Version||1.16 MB|
Copyright Clearance Process
- Recently Added
- In Progress
- Closed Access
This item is closed access and not available.
© 2013, © 2013 Taylor & Francis. We found an interesting relation between convex optimization and sorting problem. We present a parallel algorithm to compute multiple order statistics of the data by minimizing a number of related convex functions. The computed order statistics serve as splitters that group the data into buckets suitable for parallel bitonic sorting. This led us to a parallel bucket sort algorithm, which we implemented for many-core architecture of graphics processing units (GPUs). The proposed sorting method is competitive to the state-of-the-art GPU sorting algorithms and is superior to most of them for long sorting keys.
Please use this identifier to cite or link to this item: