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.

Sign up for GitHub

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

Jump to bottom

Added a little more detail to the introduction. #36

Merged
merged 1 commit into from
Jan 30, 2024
Merged

Added a little more detail to the introduction. #36

Changes from all commits
Commits
Show all changes
1 commit
Select commit
File filter

Filter by extension

Filter by extension
Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
2 changes: 2 additions & 0 deletions content/wiki/gpu/sorting.md
View file
Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -3,6 +3,8 @@ title = "Sorting"
+++

Many rendering algorithms (including a proposed sparse strip technique for path rendering, and also Gaussian Splatting) rely on sorting.
Because the GPU has a different architecture to the CPU, programs running on the GPU have different performance characteristics, and this changes which sorting algorithms are optimal for a particular context.
In particular, sorting algorithms that exploit parallelism tend to be more suited to the GPU.
The literature on parallel sorting algorithms is extremely well developed, and there are many excellent implementations for CUDA.
In WebGPU, the situation is still evolving.
This page has pointers to the potentially useful resources for understanding existing implementations and developing new ones.
Expand Down
Loading