|
|
|
|
|
|
by shwestrick
1051 days ago
|
|
|
Tons and tons of parallel algorithms use prefix sums. Typically the most common use is to compute a collection of offsets in parallel. Some examples: - compact a hash table (i.e., remove the empty slots) - flatten a jagged 2D array - rewrite a dense matrix in compressed-sparse-row (CSR) format |
|
|