Solutions to the st-connectivity problem using a GPU-based distributed BFS

Journal of Parallel and Distributed Computing

Volumn 76, Issue , 2015, Pages 145-153

  Bernaschi, Massimo ^b   Carbone, Giancarlo ^a   Mastrostefano, Enrico ^b   Vella, Flavio ^a  

^a SAPIENZA UNIVERSITY OF ROME   (Italy)

^b CNR   (Italy)

Author keywords

CUDA; Distributed algorithms; GPU; Graph algorithms; Large graphs

Indexed keywords

COMPUTER GRAPHICS; DIRECTED GRAPHS; GRAPH ALGORITHMS; GRAPHIC METHODS; PARALLEL ALGORITHMS; PROGRAM PROCESSORS;

ATOMIC OPERATION; BREADTH-FIRST SEARCH; BUILDING BLOCKES; CONNECTIVITY PROBLEMS; CUDA; DECISION PROBLEMS; LARGE GRAPHS; UNDIRECTED GRAPH;

GRAPHICS PROCESSING UNIT;

EID: 84924264587     PISSN: 07437315     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.jpdc.2014.09.013     Document Type: Article

References (23)

1. V. Agarwal, F. Petrini, D. Pasetto, D. Bader, Scalable graph exploration on multicore processors, in: High Performance Computing, Networking, Storage and Analysis (SC), 2010 International Conference for, November 2010, pp. 1-11.
2. D.A. Bader, and K. Madduri Designing multithreaded algorithms for breadth-first search and st-connectivity on the Cray MTA-2 Proceedings of the 2006 International Conference on Parallel Processing, ICPP '06 2006 IEEE Computer Society Washington, DC, USA 523 530
3. S. Beamer, K. Asanović, and D. Patterson Direction-optimizing breadth-first search Proceedings of the International Conference on High Performance Computing, Networking, Storage and Analysis SC'12 2012 IEEE Computer Society Press Los Alamitos, CA, USA 12:1 12:10
4. S. Beamer, A. Buluç, K. Asanovic, and D. Patterson Distributed Memory Breadth-First Search Revisited: Enabling Bottom-Up Search. Tech. Rep. UCB/EECS-2013-2 2013 EECS Department, University of California Berkeley
5. M. Bernaschi, G. Carbone, M. Fatica, and E. Mastrostefano Enhanced GPU-based distributed breadth first search Parallel Comput. 2013 (submitted for publication)
6. M. Bernaschi, Fantozzi, M. Ferronato, G. Gambolati, and C. Janna Factorized sparse approximate inverses on GPUs SIAM Conference on Parallel Processing for Scientific Computing 2014 SIAM
7. M. Bernaschi, and E. Mastrostefano Efficient breadth first search on multi-GPU systems J. Parallel Distrib. Comput. 73 2013 1292 1305
8. A. Buluc, K. Madduri, Parallel breadth-first search on distributed memory systems, in: SC'11 Proceedings of 2011 International Conference for High Performance Computing, Networking, Storage and Analysis, 2011.
9. F. Checconi, F. Petrini, J. Willcock, A. Lumsdaine, A.R. Choudhury, and Y. Sabharwal Breaking the speed and scalability barriers for graph exploration on distributed-memory machines 2012 International Conference for High Performance Computing, Networking, Storage and Analysis (SC) 2012 IEEE 1 12
10. A.G. Duane Merrill, and Michael Garland High Performance and Scalable GPU Graph Traversal. Technical Report 2011 Nvidia
11. Graph 500 benchmark. www.graph500.org.
12. P. Harish, and P. Narayanan Accelerating large graph algorithms on the GPU using CUDA S. Aluru, M. Parashar, R. Badrinath, V. Prasanna, High Performance Computing - HiPC 2007 Lecture Notes in Computer Science vol. 4873 2007 Springer Berlin, Heidelberg 197 208
13. T.O.S. Hong, S.K. Kim, K. Olukotun, Accelerating cuda graph algorithms at maximum warp, in: Proceedings of the 16th ACM Symposium on Principles and Practice of Parallel Programming, 2011.
14. G.J. Katz, and J.T. Kider Jr. All-pairs shortest-paths for large graphs on the GPU Proceedings of the 23rd ACM SIGGRAPH/EUROGRAPHICS Symposium on Graphics Hardware GH'08 2008 Eurographics Association Aire-la-Ville, Switzerland, Switzerland 47 55
15. J. Leskovec, Stanford large network dataset collection. http://snap.stanford.edu/data/index.html.
16. H. Lv, G. Tan, M. Chen, N. Sun, Compression and sieve: reducing communication in parallel breadth first search on distributed memory systems. CoRR, abs/1208.5542, 2012.
17. K. Madduri, D.A. Bader, J.W. Berry, J.R. Crobak, An experimental study of a parallel shortest path algorithm for solving large-scale graph instances, 2007.
18. D. Merrill, M. Garland, and A. Grimshaw Scalable GPU graph traversal Proceedings of the 17th ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming PPoPP'12 2012 ACM New York, NY, USA 117 128
19. A.E. Sariyüce, K. Kaya, E. Saule, and U.V. Çatalyürek Betweenness centrality on GPUs and heterogeneous architectures Proceedings of the 6th Workshop on General Purpose Processor Using Graphics Processing Units GPGPU-6 2013 ACM New York, NY, USA 76 85
20. N. Satish, C. Kim, J. Chhugani, and P. Dubey Large-scale energy-efficient graph traversal: A path to efficient data-intensive supercomputing Proceedings of the International Conference on High Performance Computing, Networking, Storage and Analysis SC'12 2012 IEEE Computer Society Press Los Alamitos, CA, USA 14:1 14:11
21. K. Ueno, and T. Suzumura Highly scalable graph search for the graph500 benchmark Proceedings of the 21st International Symposium on High-Performance Parallel and Distributed Computing HPDC'12 2012 ACM New York, NY, USA 149 160
22. K. Ueno, T. Suzumura, Parallel distributed breadth first search on GPU, in: HiPC 2013, IEEE International Conference on High Performance Computing, 2013/12, 2013.
23. A. Yoo, E. Chow, K. Henderson, W. McLendon, B. Hendrickson, and U. Catalyurek A scalable distributed parallel breadth-first search algorithm on bluegene/l Supercomputing, 2005. Proceedings of the ACM/IEEE SC 2005 Conference 2005 IEEE 25