Jump to content
  • Advertisement

Algorithm [Unofficial] New Radix Sort for GPU (Turing supported)

Recommended Posts

Posted (edited)

I created this post due another radix sort post for CPU. This is Radix Sort for GPU. Able achieve 900 Mkeys/S, and sorting 8 million elements in 9.3ms (on RTX 2070). Written on C++ with Vulkan API and GLSL. Based on bitfield and warp hacks. For understand this shader code, need very good knowledge of bitfields and GPU subgroup. For NVIDIA, also need knowledge of subgroup partition extension. 

Github source code: https://github.com/world8th/RadX

Classification: Radix Sort (LSD)
Stable: yes
Parallel: yes, vector supported
Bit width: 8-bit (Turing), 2-bit (other), can be changed
Device type: GPU

Also, how to get fastest GPU radix sort ever?


Edited by elviras9t

Share this post

Link to post
Share on other sites

Create an account or sign in to comment

You need to be a member in order to leave a comment

Create an account

Sign up for a new account in our community. It's easy!

Register a new account

Sign in

Already have an account? Sign in here.

Sign In Now

  • Advertisement

Important Information

By using GameDev.net, you agree to our community Guidelines, Terms of Use, and Privacy Policy.

GameDev.net is your game development community. Create an account for your GameDev Portfolio and participate in the largest developer community in the games industry.

Sign me up!