Duane Merrill (NVIDIA) - GPU Technology Conference

More documents

Recommendations

Info

AgendaSparse graphsBreadth-first search (BFS)Maximal independent set (MIS)∞∞2∞22122101 211231223151069872 34BFSMIS2
Page 1: Duane Merrill (NVIDIA)Michael Garla
Page 5 and 6: Graph sparsityAdjacency matrixof gr
Page 8 and 9: Breadth-first search (BFS)1. Pick a
Page 14 and 15: The sequential algorithmCycles newl
Page 16 and 17: Quadratic-work approach1. Inspect e
Page 18 and 19: Quadratic-work approach1. Inspect e
Page 20 and 21: Quadratic-work approach• Input: V
Page 22 and 23: Active vertex identifiersLinear-wor
Page 24 and 25: Linear-work challenges for parallel
Page 26 and 27: Available bandwidth (GB/s)1) Cooper
Page 28 and 29: Prefix sum for edge expansionAdjace
Page 30 and 31: 2) Poor load balancing within SIMD
Page 32 and 33: 3) Poor locality within SIMD lanesP
Page 34 and 35: Vertices (millions)4) SIMD simultan
Page 36: Single-socket comparisonGraphSpy Pl
Page 39 and 40: Maximal independent setA vertex sub
Page 41 and 42: Example: MIS(2) for mesh refinement
Page 43 and 44: The parallel algorithm (Luby85)•
Page 45 and 46: Future work: actually remove vertic
Page 47 and 48: dumerrill@nvidia.com
Page 49 and 50: Experimental corpusGraph Spy Plot D
Page 51 and 52: Coupling of expansion & contraction
Page 53 and 54:
Redundant expansionfactor (log)Loca
show all

Duane Merrill (NVIDIA) - GPU Technology Conference

Create successful ePaper yourself

Delete template?

Save as template?