Skip to content
New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Improve depth sort #12

Open
jatentaki opened this issue Aug 30, 2023 · 1 comment
Open

Improve depth sort #12

jatentaki opened this issue Aug 30, 2023 · 1 comment
Labels
good first issue Good for newcomers help wanted Extra attention is needed

Comments

@jatentaki
Copy link
Collaborator

Current implementation uses bitonic sort which is less efficient (but simpler to implement) than alternatives like radix sort. Improvements can include both replacing bitonic sort with radix sort and perf improvements to bitonic itself:

  • Replacing the array of buffers with a simple buffer and using dynamic offsets
  • Using shared memory within the compute shader itself
  • Others
@jatentaki jatentaki added good first issue Good for newcomers help wanted Extra attention is needed labels Aug 30, 2023
@julien-blanchon
Copy link

Look like a task for the magic: @dakenf

Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment
Labels
good first issue Good for newcomers help wanted Extra attention is needed
Projects
None yet
Development

No branches or pull requests

2 participants