GPU Sparse Graph Traversal

More documents

Recommendations

Info

Coupling of expansion & contraction phases Alternatives: a) Expand-contract (vertex-frontier in DRAM) Duane Merrill, University of Virginia Suitable for all types of BFS iterations b) Contract-expand (edge-frontier in DRAM) Even better for small, fleeting BFS iterations c) Two-phase (both frontiers in DRAM) Even better for large, saturating BFS iterations (surprising!!) The two “fused” strategies (a & b above) suffer the interaction between: – TLB misses during expansion (neighbor gathering) – Uncoalesced reads during contraction (status lookup) 26
Comparison of expansion techniques Duane Merrill, University of Virginia 27
Page 1 and 2: GPU Sparse Graph Traversal Duane Me
Page 3 and 4: The punchline “Conventional wisdo
Page 5 and 6: Level-synchronous BFS parallelizati
Page 7 and 8: Linear-work approach 1. Expand neig
Page 9 and 10: Vertices (millions) Goal: Demonstra
Page 11 and 12: Linear-work challenges for parallel
Page 13 and 14: Prefix sum for allocation Input (e.
Page 15 and 16: (3) Poor locality within SIMD lanes
Page 17 and 18: Simultaneous discovery Normally not
Page 19 and 20: Single-socket performance compariso
Page 21 and 22: Questions? Merrill, D., Garland, M.
Page 23 and 24: Experimental corpus Graph Spy Plot
Page 25: Coupling of expansion & contraction
Page 29 and 30: Comparison of coupling approaches 1
Page 31 and 32: CTA local prefix sum Duane Merrill,

GPU Sparse Graph Traversal

Create successful ePaper yourself

Delete template?

Save as template?