Implement CUDA block- and warp-wide odd-even sort #347
Conversation
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
stephenswat
force-pushed
the
feat/cuda_sorting_utilities
branch
from
01cb554 to
d9dc7a0
Compare
krasznaa
requested changes
Mar 17, 2023
There was a problem hiding this comment.
Pretty much the same comments as in #346. With the addition that this code I'll really try to implement in a way so that it could be shared between CUDA and SYCL.
But that's not for this PR. Here we should just make sure that CUDA-specific code is not put into a public .hpp file.
Sorting small arrays is a relatively common problem in GPGPU programming. Many useful algorithms exist, and some are provided by libraries like CUB. An algorithm close to my heart is odd-even sort because it is exceedingly simply, relatively efficient for small arrays and, importantly, it uses O(1) space. This commit adds new implementations of this sorting algorithm for warp- and block-wide thread groups in CUDA.
stephenswat
force-pushed
the
feat/cuda_sorting_utilities
branch
from
d9dc7a0 to
2603fc0
Compare
|
Updated. |
|
Replaced by #632. |
Sign up for free
to join this conversation on GitHub.
Already have an account?
Sign in to comment
Add this suggestion to a batch that can be applied as a single commit.
This suggestion is invalid because no changes were made to the code.
Suggestions cannot be applied while the pull request is closed.
Suggestions cannot be applied while viewing a subset of changes.
Only one suggestion per line can be applied in a batch.
Add this suggestion to a batch that can be applied as a single commit.
Applying suggestions on deleted lines is not supported.
You must change the existing code in this line in order to create a valid suggestion.
Outdated suggestions cannot be applied.
This suggestion has been applied or marked resolved.
Suggestions cannot be applied from pending reviews.
Suggestions cannot be applied on multi-line comments.
Suggestions cannot be applied while the pull request is queued to merge.
Suggestion cannot be applied right now. Please check back later.
Sorting small arrays is a relatively common problem in GPGPU programming. Many useful algorithms exist, and some are provided by libraries like CUB. An algorithm close to my heart is odd-even sort because it is exceedingly simply, relatively efficient for small arrays and, importantly, it uses O(1) space. This commit adds new implementations of this sorting algorithm for warp- and block-wide thread groups in CUDA.