GPU Sparse Graph Traversal
GPU Sparse Graph Traversal
GPU Sparse Graph Traversal
Create successful ePaper yourself
Turn your PDF publications into a flip-book with our unique Google optimized e-Paper software.
Redundant expansion<br />
factor (log)<br />
Local duplicate culling<br />
Contraction uses local collision hashes in<br />
smem scratch space:<br />
10<br />
1<br />
1. Hash per warp (instantaneous coverage)<br />
2. Hash per CTA (recent history coverage)<br />
1.1x<br />
4.2x<br />
Duane Merrill, University of Virginia<br />
2.4x<br />
2.6x<br />
1.7x<br />
1.2x 1.1x<br />
1.4x<br />
Redundant work reduced < 10% in all<br />
datasets<br />
No atomics needed<br />
Simple Local duplicate culling<br />
1.1x<br />
n/a<br />
1.3x<br />
30
Change language