Build a fully parallel LSD radix sort on the GPU. Implement digit histogram, exclusive scan for scatter addresses, and the scatter kernel.
// PREREQUISITES
// PROJECT PHASES
Single-bit split
Sort by one bit at a time.
4-bit digit histogram and scan
16-bucket histogram per block.
Scatter pass
Write keys to their sorted positions.
Full 32-bit sort (8 passes)
Chain 8 passes, ping-pong buffers.
// SANDBOX
GPU execution// EXPECTED OUTPUT
Radix sort (1M keys): 4.2 ms Result sorted correctly: YES
// YOUR PROGRESS
Log in to save progress
// DETAILS
// MORE IN ALGORITHMS
// LEARN THE THEORY
Algorithms concepts