Accelerating CUDA graph algorithms at maximum warp

Proceedings of the ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming, PPOPP

Volumn , Issue , 2011, Pages 267-276

  Hong, Sungpack ^a   Kim, Sang Kyun ^a   Oguntebi, Tayo ^a   Olukotun, Kunle ^a  

^a STANFORD UNIVERSITY   (United States)

Author keywords

CUDA; GPGPU; Parallel graph algorithms

Indexed keywords

BENCHMARK APPLICATIONS; COMPUTATIONAL DOMAINS; CUDA; DATA REPRESENTATIONS; GPGPU; GPU ALGORITHMS; GPU PROGRAMMING; GRAPH ALGORITHMS; GRAPH PROBLEMS; GRAPH STRUCTURES; MEMORY BANDWIDTHS; MULTITHREADED; PARALLEL GRAPH ALGORITHMS; PERFORMANCE GAIN; POOR PERFORMANCE; REAL-WORLD GRAPHS; REGULAR GRAPHS;

ALGORITHMS; BENCHMARKING; COMPUTER PROGRAMMING LANGUAGES; GRAPHIC METHODS; PROGRAM PROCESSORS;

PARALLEL PROGRAMMING;

EID: 79952811127     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1941553.1941590     Document Type: Conference Paper

References (25)

1. Stanford large network dataset collection. http://snap.stanford.edu/data/ index.html, 2009.
2. http://en.wikipedia.org/wiki/GeForce-200-Series, 2010.
3. V. Agarwal, F. Petrini, D. Pasetto, and D. Bada. Scalable Graph Exploration on Multicore Processors. In ACM/IEEE SC, 2010.
4. D. Ajwani, R. Dementiev, and U. Meyer. A computational study of external-memory bfs algorithms. In ACM-SIAM SODA, 2006.
5. D. Bader and K. Madduri. Designing multithreaded algorithms for breadth-first search and st-connectivity on the cray mta-2. In IEEE ICPP, 2006.
6. D. Bader and K. Madduri. Snap, small-world network analysis and partitioning: An open-source parallel graph framework for the exploration of large-scale networks. In IEEE IPDPS, 2008.
7. D. A. Bader and K. Madduri. Gtgraph: A synthetic graph generator suite. http://www.cc.gatech/edu/∼kamesh/GTgraph/, 2006.
8. A. Bakhoda, G. L. Yuan, W.W. L. Fung, H.Wong, and T. M. Aamodt. Analyzing cuda workloads using a detailed gpu simulator. In IEEE ISPASS, 2009.
9. N. Bell and M. Garland. Efficient sparse matrix-vector multiplication on CUDA. In Proc. Conf. Supercomputing (SC'09).
10. H. Chafi, Z. DeVito, A. Moors, T. Rompf, A. K. Sujeeth, P. Hanrahan, M. Odersky, and K. Olukotun. Language virtualization for heterogeneous parallel computing. In Proc. Conf. OOPSLA'10, 2010.
11. D. Chakrabarti, Y. Zhan, and C. Faloutsos. R-mat: A recursive model for graph mining. In SDM, 2004.
12. S. Che, M. Boyer, J. Meng, D. Tarjan, J. Sheaffer, S.-H. Lee, and K. Skadron. Rodinia: A benchmark suite for heterogeneous computing. In IEEE IISWC, 2009.
13. Cray, Inc. Cray xmt. http://www.cray.com/products/xmt/.
14. K. Fatahalian, D. R. Horn, T. J. Knight, L. Leem, M. Houston, J. Y. Park, M. Erez, M. Ren, A. Aiken, W. J. Dally, and P. Hanrahan. Sequoia: programming the memory hierarchy. In SC, 2006.
15. P. Harish and P. J. Narayanan. Accelerating large graph algorithms on the gpu using cuda. In HiPC, 2007.
16. P. harish, V. Vineet, and P. Narayanan. Large graph algorithms for massively multithreaded architectures. Technical Report IIIT/TR/2009/74, International Institute of Information Technology Hyderabad, India, 2009.
17. B. Hendrickson and J. Berry. Graph analysis with high-performance computing. Computing in Science Engineering, 10(2), march 2008.
18. J. JáJá. An introduction to parallel algorithms. Addison Wesley, 1992.
19. V. W. Lee, C. Kim, J. Chhugani, M. Deisher, D. Kim, A. D. Nguyen, N. Satish, M. Smelyanskiy, S. Chennupaty, P. Hammarlund, R. Singhal, and P. Dubey. Debunking the 100x gpu vs. cpu myth: an evaluation of throughput computing on cpu and gpu. In ISCA, 2010.
20. J. Meng, D. Tarjan, and K. Skadron. Dynamic warp subdivision for integrated branch and memory divergence tolerance. In ISCA, 2010.
21. J. Nickolls and W. J. Dally. The gpu computing era. IEEE Micro, 30(2), 2010.
22. R. Niewiadomski, J. Amaral, and R. Holte. A parallel external-memory frontier breadth-first traversal algorithm for clusters of workstations. In IEEE ICPP, 2006.
23. Nvidia. Cuda. http://www.nvidia.com/cuda/.
24. D. J. Watts. Small Worlds: the dynamics of Networks between Order and Randomness, chapter 1-2. Princeton University Press, 1999.
25. A. Yoo, E. Chow, K. Henderson, W. McLendon, B. Hendrickson, and U. Catalyurek. A scalable distributed parallel breadth-first search algorithm on bluegene/l. In ACM/IEEE SC, 2005.