Are you interested in working on parallel sorting algorithms in #WebGPU? If so, get in touch. I'm especially interested in segmented merge sort (https://moderngpu.github.io/segsort.html), but other classic parallel sort algorithms including bitonic and radix are on the table.
I would find this fascinating to work on myself (and that still might happen), but my time is pretty packed. Even so, I'm excited about the prospects to where I might be able to fund some work out of my own pocket. Let's discuss.
I got a bunch of responses to this, some private. Thanks for those!
I also did a bit of an exploration myself, including a bit of a fusion of FidelityFX sort and Onesweep ported to WebGPU, with the warp-local multi-split adapted to use shared memory instead of subgroups (warp operations). Details are in this Zulip thread: https://xi.zulipchat.com/#narrow/stream/197075-gpu/topic/Sorting.20revisited
This is a preliminary investigation, which shows that performant WebGPU sorting is likely feasible. I hope it gets that conversation started.
@raph it would be awesome to have a bunch of mostly adaptable demos of key algorithms.
Matrix multiply seems important.
And performance tuning across devices.
There is a nifty little project that does a few things like this for Vulkan compute.
Add comment