Parallel distributed breadth first search on GPU

20th Annual International Conference on High Performance Computing, HiPC 2013

Volumn , Issue , 2013, Pages 314-323

  Ueno, Koji ^a   Suzumura, Toyotaro ^a  

^a IBM RESEARCH TOKYO   (Japan)

Author keywords

BFS; GPU; Graph500; Supercomputer

Indexed keywords

COMMUNICATION; DATA COMPRESSION; PROGRAM PROCESSORS;

BFS; BREADTH-FIRST SEARCH; COMMUNICATION DATA; GPU; GPU IMPLEMENTATION; GRAPH500; INTER-NODE COMMUNICATION; RANKING LISTS;

SUPERCOMPUTERS;

EID: 84900337041     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/HiPC.2013.6799136     Document Type: Conference Paper

References (21)

1. Graph500: http://www.graph500.org/
2. J. Leskovec, D. Chakrabarti, J. Kleinberg, and C. Faloutsos, Realistic, mathematically tractable graph generation and evolution, using kronecker multiplication, in Conf. on Principles and Practice of Knowledge Discovery in Databases, 2005.
3. Virat Agarwal, Fabrizio Petrini, Davide Pasetto, and David A. Bader. 2010. Scalable Graph Exploration on Multicore Processors. In Proceedings of the 2010 ACM/IEEE International Conference for High Performance Computing, Networking, Storage and Analysis (SC '10). IEEE Computer Society, Washington, DC, USA, 1-11
4. David A. Bader and Kamesh Madduri. 2006. Designing Multithreaded Algorithms for Breadth-First Search and st-connectivity on the Cray MTA-2. In Proceedings of the 2006 International Conference on Parallel Processing (ICPP '06). IEEE Computer Society, Washington, DC, USA, 523-530
5. Andy Yoo, Edmond Chow, Keith Henderson, William McLendon, Bruce Hendrickson, and Umit Catalyurek. 2005. A Scalable Distributed Parallel Breadth-First Search Algorithm on BlueGene/L. In Proceedings of the 2005 ACM/IEEE conference on Supercomputing (SC '05). IEEE Computer Society, Washington, DC, USA, 25.
6. Aydin Buluç and Kamesh Madduri. 2011. Parallel breadth-first search on distributed memory systems. In Proceedings of 2011 International Conference for High Performance Computing, Networking, Storage and Analysis (SC '11). ACM, New York, NY, USA, Article 65, 12 pages. DOI=10.1145/2063384.2063471 http://doi.acm.org/10.1145/2063384.2063471
7. P. Harish and P. J. Narayanan, Accelerating large graph algorithms on the GPU using CUDA, in Proceedings of the 14th international conference on High performance computing, Berlin, Heidelberg, 2007, pp. 197-208.
8. M. Hussein, A. Varshney, and L. Davis, On Implementing Graph Cuts on CUDA, in First Workshop on General Purpose Processing on Graphics Processing Units, Boston, MA, 2007.
9. L. Luo, M. Wong, and W.-mei Hwu, An effective GPU implementation of breadth-first search, in Proceedings of the 47th Design Automation Conference, New York, NY, USA, 2010, pp. 52-55.
10. S. Hong, S. K. Kim, T. Oguntebi, and K. Olukotun, Accelerating CUDA graph algorithms at maximum warp, in Proceedings of the 16th ACM symposium on Principles and practice of parallel programming, New York, NY, USA, 2011, pp. 267-276.
11. Sungpack Hong, Tayo Oguntebi, and Kunle Olukotun. 2011. Efficient Parallel Graph Exploration on Multi-Core CPU and GPU. In Proceedings of the 2011 International Conference on Parallel Architectures and Compilation Techniques (PACT '11). IEEE Computer Society, Washington, DC, USA, 78-88. DOI=10.1109/PACT.2011.14 http://dx.doi.org/10.1109/PACT.2011.14
12. Duane Merrill, Michael Garland, and Andrew Grimshaw. 2012. Scalable GPU graph traversal. In Proceedings of the 17th ACM SIGPLAN symposium on Principles and Practice of Parallel Programming (PPoPP '12). ACM, New York, NY, USA, 117-128.
13. D. P. Scarpazza, O. Villa, and F. Petrini, Efficient Breadth-First Search on the Cell/BE Processor, IEEE Transactions on Parallel and Distributed Systems, vol. 19, no. 10, pp. 1381-1395, Oct. 2008.
14. Koji Ueno and Toyotaro Suzumura Highly Scalable Graph Search for the Graph500 Benchmark, HPDC 2012 (The 21st International ACM Symposium on High-Performance Parallel and Distributed Computing) June, 2012, Delft, Netherlands, To appear.
15. Merrill, D. and Grimshaw, A. 2009. Parallel Scan for Stream Architectures. Technical Report #CS2009-14. Department of Computer Science, University of Virginia.
16. Toshio Endo, Akira Nukada, Satoshi Matsuoka, and Naoya Maruyama. Linpack Evaluation on a Supercomputer with Heterogeneous Accelerators. In IEEE International Parallel & Distributed Processing Symposium (IPDPS 2010)
17. MVAPICH2: http://mvapich.cse.ohio-state.edu/
18. Ana Balevic. Parallel variable-length encoding on GPGPUs. Euro-Par'09 Proceedings of the 2009 international conference on Parallel processing, pp. 26-35.
19. Jeffrey Dean. Challenges in building large-scale information retrieval systems: invited talk, WSDM '09.
20. Satish, Nadathur and Kim, Changkyu and Chhugani, Jatin and Dubey, Pradeep. Large-scale energy-efficient graph traversal: a path to efficient data-intensive supercomputing. SC '12, 2012.
21. Fabio Checconi, Fabrizio Petrini, Jeremiah Willcock, Andrew Lumsdaine, Anamitra Roy Choudhury, Yogish Sabharwal. Breaking the speed and scalability barriers for graph exploration on distributed-memory machines. SC '12, 2012. 323