Segmented Scan - Nvidia

More documents

Recommendations

Info

<strong>Scan</strong> Literature (1) Pre-GPU • First proposed in APL by Iverson (1962) • Used as a data parallel primitive in the Connection Machine (1990) — Feature of C* and CM-Lisp • Guy Blelloch popularized scan as a primitive for various parallel algorithms — Blelloch, 1990, “Prefix Sums and Their Applications” Post-GPU • O(n log n) work GPU implementation by Daniel Horn (GPU Gems 2) — Applied to Summed Area Tables by Hensley et al. (EG05) • O(n) work GPU scan by Sengupta et al. (EDGE06) and Greß et al. (EG06) • O(n) work & space GPU implementation by Harris et al. (2007)
<strong>Scan</strong> Literature (2) • Sengupta et al. segmented scan, radix sort, quicksort (Graphics Hardware 2007) • Sengupta et al. warp scan (NV Tech report 2008) — Extended in Scientic Computing with Multicore and Accelerators, Ch. 19. 2011 • Dotsenko et al. reduce-then-scan (ICS 2008) • Billeter et al. efficient compact (HPG 2009) • Satish et al. radix sort (IPDPS 2009) • Merrill & Grimshaw, efficient GPU scan (UVA Tech Rep. 2009) • Merrill & Grimshaw, efficient radix sort (UVA Tech Rep. 2010) • Harris & Garland, binary scan (GPU Computing Gems 2, 2011)
Page 1 and 2:
State of the Art in GPU Data-Parall
Page 3 and 4:
Stream Parallelism Input Thread Thr
Page 5 and 6:
Beyond streaming • GPUs are obvio
Page 7 and 8:
Parallel Patterns • Many parallel
Page 9 and 10:
Parallel Reduction: Easy 3 1 7 0 4
Page 11 and 12:
Split Input Output • Example: rad
Page 13 and 14:
Compact • Remove unneeded or inva
Page 15 and 16:
“Where do I write my output?”
Page 17 and 18: Segmented Scan Segment Head Flags I
Page 19 and 20: Scan Applications
Page 21 and 22: Compact using Scan • Flag unneede
Page 23 and 24: Radix Sort / Split using Scan i = i
Page 25 and 26: CUDA Radix Sort • Sort blocks in
Page 27 and 28: Designing Sorting Algorithms for GP
Page 29 and 30: Building Trees • The split primit
Page 31 and 32: HLBVH • Improvement over LBVH —
Page 33 and 34: Breadth-First Search Order • BFS
Page 35 and 36: Parallel Hashing • Dense data str
Page 37 and 38: Cuckoo Hashing • Sequential inser
Page 39 and 40: GPU Parallel Hash Performance D. A.
Page 41 and 42: Implementing Scan: Strategies
Page 43 and 44: 1. Scan All Sub-blocks 3 3 3 3 3 5
Page 45 and 46: + + + + + + 1. Reduce All Sub-Block
Page 47 and 48: Implementing Scan In CUDA
Page 49 and 50: Sequential Inclusive Scan Code int
Page 51 and 52: Warp Speed • Warp is physical uni
Page 53 and 54: Intra-block Scan using Intra-warp S
Page 55 and 56: Binary Warp Scan Code __device__ un
Page 57 and 58: Binary Reduction • Count the numb
Page 59 and 60: No need to re-implement • Open so
Page 61 and 62: CUDPP Example CUDPPConfiguration co
Page 63 and 64: Thrust Example // generate 16M rand
Page 65 and 66: “In general, the problem of defin
Page 67: Thank You! • Duane Merrill, David
show all

Segmented Scan - Nvidia

Create successful ePaper yourself

Delete template?

Save as template?