Dynamic Graphs on the GPU
summary
Claims a practical GPU stack: GPUs have 300,000 threads in flight, ~144 SMs, ~80 GB HBM and ~36 MB L2, and the PCIe/CPU link (~32 GB/s) often bottlenecks real pipelines. The group implements cuckoo hashing on GPU and per-vertex hash tables instead of CSR rewrites, shows a 1000x slowdown from contention when naively porting CPU b-tree latching, and reports hash-table and bulk-rebuild strategies that work well for large batched updates.
AI-written summary Β· about
chapters (19)
- 0:00Introduction and context
- 0:31Session welcome and speaker
- 1:05Bridging theory and systems
- 3:49Systems research perspective
- 6:51GPU programming model
- 12:41Hardware architecture
- 16:12GPU memory system
- 21:51Latency tolerance
- 25:00Performance challenges
- 28:20Memory coalescing
- 30:23GPU and CPU interaction
- 33:10The role of machine learning
- 35:58Graph processing on GPUs
- 38:48Graph work engineering
- 42:15Dynamic data structures
- 44:55Data structure design
- 48:00Hash tables and evaluation
- 52:30Future research directions
- 53:49Q&A and conclusion
