the peformance of radix sort is lower than cub or hipPRIM
Open
performance
- Dominant language
- C++
- Stars
- 1.7k
- Forks
- 340
- PR merge metrics
- No merged PRs in 30d
Description
if we have do some work to improve the performance of radix_sort_by_key( ), as i tested , the perf is 11ms per 1m element size. while ~1.15ms in rocmPRIM(OpenCL) and CUB(cuda) per 1M elements
Contributor guide
Assessment
This issue has not been assessed yet.