Deploying graph algorithms on GPUs: An adaptive solution

Proceedings - IEEE 27th International Parallel and Distributed Processing Symposium, IPDPS 2013

Volumn , Issue , 2013, Pages 1013-1024

  Li, Da ^a   Becchi, Michela ^a  

^a University of Missouri   (United States)

Author keywords

GPU; Graph algorithms; Runtime system

Indexed keywords

COMPUTATIONAL PATTERNS; ELECTRICAL CIRCUIT MODELS; GPU; GRAPH ALGORITHMS; GRAPHICS PROCESSING UNITS; IRREGULAR DATA STRUCTURES; RUNTIME SYSTEMS; SINGLE SOURCE SHORTEST PATHS;

BIOINFORMATICS; COMPUTER GRAPHICS; DISCRETE EVENT SIMULATION; DISTRIBUTED PARAMETER NETWORKS; IMAGE PROCESSING; LINEAR ALGEBRA; PROGRAM PROCESSORS;

HEURISTIC ALGORITHMS;

EID: 84884875169     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/IPDPS.2013.101     Document Type: Conference Paper

References (33)

1. M. Kulkarni, K. Pingali, B. Walter, et al, "Optimistic parallelism requres abstractions," in Proc. of PLDI 2007.
2. M. Kulkarni, M. Burtscher, et al, "How much parallelism is there in irregular applications," in Proc. of PPoPP 2009.
3. M. A. Hassaan, M. Burtscher, and K. Pingali, "Ordered vs. unordered: a comparison of parallelism and work-efficiency in irregular algorithms," in Proc. of PPoPP 2011.
4. D. Gregor and A. Lumsdaine, "The parallel BGL: A generic library for distributed graph computations," In Proc. of Parallel Object-Oriented Scientific Computing, 2005.
5. F. Hielscher and P. Gottschling. (2004). ParGraph. http://pargraph. sourceforge.net/
6. P. An, A. Jula, S. Rus, et al, "STAPL: an adaptive, generic parallel C++ library," in Proc. of LCPC 2003.
7. P. Harish and P. J. Narayanan, "Accelerating large graph algorithms on the GPU using CUDA," in Proc. of HiPC 2007.
8. L. Luo, M. Wong, and W.-M. Hwu, "An Effective GPU Implementation of Breadth-first Search," in Proc. of DAC 2010.
9. D. Merrill, M. Garland, and A. Grimshaw, "Scalable GPU graph traversal," in Proc. of PPoPP 2012.
10. M. Mendez-Lojo, M. Burtscher, and K. Pingali, "A GPU Implementation of Inclusion-based Points-to Analysis," in Proc. of PPoPP 2012.
11. J. Barnat, P. Bauch, L. Brim, and M. Ceska, "Computing Strongly Connected Components in Parallel on CUDA," in Proc. of IPDPS 2011.
12. S. Hong, S. K. Kim, T. Oguntebi, and K. Olukotun, "Accelerating CUDA Graph Algorithms at Maximum Warp," in Proc. of PPoPP 2011.
13. S. Hong, T. Oguntebi, and K. Olukotun, "Efficient Parallel Graph Exploration on Multi-Core CPU and GPU," in Proc. of PACT 2011.
14. S. Che, M. Boyer, J. Meng, et al, "Rodinia: A benchmark suite for heterogeneous computing," in Proc. of IISWC 2009.
15. V. W. Lee, C. Kim, J. Chhugani, et al, "Debunking the 100X GPU vs. CPU myth: an evaluation of throughput computing on CPU and GPU," in Proc. of ISCA 2010.
16. 9th DIMACS Implementation Challenge. www.dis.uniroma1.it/challenge9
17. 10th DIMACS Implementation Challenge. www.cc.gatech.edu/dimacs10/index. shtml
18. Stanford Large Network Dataset Collection. http://snap.stanford.edu/data
19. D. A. Bader and K. Madduri, "Designing Multithreaded Algorithms for Breadth-First Search and st-connectivity on the Cray MTA-2," in Proc. of ICPP 2006.
20. C. E. Leiserson and T. B. Schardl, "A work-efficient parallel breadth-first search algorithm (or how to cope with the nondeterminism of reducers)," in Proc of SPAA 2010.
21. V. Agarwal, F. Petrini, D. Pasetto, and D. A. Bader, "Scalable Graph Exploration on Multicore Processors," in Proc. of SC 2010.
22. A. Crauser, K. Mehlhorn, U. Meyer, and P. Sanders, "A Parallelization of Dijkstra's Shortest Path Algorithm," in Proc. of MFCS 1998.
23. G. Vaira and O. Kurasova, "Parallel Bidirectional Dijkstra's Shortest Path Algorithm," in Proc. of DB&IS 2010, 2011.
24. D. B. Johnson and P. Metaxas, "A parallel algorithm for computing minimum spanning trees," in Proc. of SPAA 1992.
25. F. Dehne and S. Gotz, "Practical Parallel Algorithms for Minimum Spanning Trees," in Proc. of SRDS 1998.
26. D. A. Bader and G. Cong, "Fast shared-memory algorithms for computing the minimum spanning forest of sparse graphs," J. Parallel Distrib. Comput., vol. 66, pp. 1366-1378, 2006. (Pubitemid 44528211)
27. V. Koubek and J. Krsnakova, "Parallel algorithms for connected components in a graph," in Fundamentals of Computation Theory, 1985.
28. H. Gazit, "An optimal randomized parallel algorithm for finding connected components in a graph," in Proc. of FOCS 1986.
29. I. William Mclendon, B. Hendrickson, et al, "Finding strongly connected components in parallel in particle transport sweeps," in Proc. of SPAA 2001.
30. 2n) reachability queries," in Proc. of SPAA 2008.
31. J. Nickolls, I. Buck, M. Garland, and K. Skadron, "Scalable Parallel Programming with CUDA," ACM Queue, 2008.
32. T. H. Cormen, C. E. Leiserson, R. L. Rivest, and C. Stein, Introduction to Algorithms: MIT Press, 2001.
33. J. Balfour. (Aug 5). CUDA Threads and Atomics. mc.stanford.edu/cgi-bin/ images/3/34/Darve-cme343-cuda-3.pdf