GPU Sparse Graph Traversal
GPU Sparse Graph Traversal
GPU Sparse Graph Traversal
You also want an ePaper? Increase the reach of your titles
YUMPU automatically turns print PDFs into web optimized ePapers that Google loves.
The punchline<br />
“Conventional wisdom”<br />
<strong>GPU</strong>s are poorly suited for dynamic problems like BFS<br />
Duane Merrill, University of Virginia<br />
Dynamic work distribution seems hard to implement<br />
Requires cooperation<br />
We show <strong>GPU</strong>s provide exceptional performance<br />
Billions of traversed-edges / second / socket<br />
vs. hundreds-of-millions for multi-core (SC’10, SPAA’10)<br />
For diverse synthetic and real-world datasets<br />
Small-diameter (e.g., RMAT and social networks)<br />
Large-diameter (e.g., road-network & spatial lattices)<br />
3
Change language