Parallel breadth-first search on distributed memory systems

Proceedings of 2011 SC - International Conference for High Performance Computing, Networking, Storage and Analysis

Volumn , Issue , 2011, Pages

  Buluç, Aydin ^a   Madduri, Kamesh ^a  

^a LAWRENCE BERKELEY NATIONAL LABORATORY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

BREADTH-FIRST SEARCH; DESIGN SPACES; DISTRIBUTED MEMORY PARALLEL SYSTEMS; DISTRIBUTED MEMORY SYSTEMS; EXPERIMENTAL STUDIES; GRAPH ALGORITHMS; GRAPH-BASED; MULTI-THREADING; PARALLEL COMMUNICATION; PARALLEL EXECUTIONS; PARALLEL SYSTEM; SCIENTIFIC APPLICATIONS; SKEWED DEGREE DISTRIBUTION; SPARSE MATRICES; TWO-DIMENSIONAL ALGORITHMS; UNDIRECTED GRAPH;

ALGORITHMS; COMMUNICATION; COMPUTER SOFTWARE SELECTION AND EVALUATION; GRAPH THEORY; MULTITASKING; SEARCH ENGINES; TWO DIMENSIONAL;

DISTRIBUTED COMPUTER SYSTEMS;

EID: 83155193230     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/2063384.2063471     Document Type: Conference Paper

References (39)

1. V. Agarwal, F. Petrini, D. Pasetto, and D.A. Bader. Scalable graph exploration on multicore processors. In Proc. ACM/IEEE Conference on Supercomputing (SC10), November 2010.
2. D. Ajwani, R. Dementiev, and U. Meyer. A computational study of external-memory BFS algorithms. In Proc. 17th annual ACM-SIAM Symposium on Discrete Algorithms (SODA'06), pages 601-610, January 2006. (Pubitemid 43275281)
3. D. Ajwani and U. Meyer. Design and engineering of external memory traversal algorithms for general graphs. In J. Lerner, D. Wagner, and K.A. Zweig, editors, Algorithmics of Large and Complex Networks: Design, Analysis, and Simulation, pages 1-33. Springer, 2009.
4. D.A. Bader and K. Madduri. Designing multithreaded algorithms for breadth-first search and st-connectivity on the Cray MTA-2. In Proc. 35th Int'l. Conf. on Parallel Processing (ICPP 2006), pages 523-530, August 2006. (Pubitemid 47159081)
5. J. Barnat, L. Brim, and J. Chaloupka. Parallel breadth-first search LTL model-checking. In Proc. 18th IEEE Int'l. Conf. on Automated Software Engineering, pages 106-115, October 2003.
6. P. Boldi and S. Vigna. The WebGraph framework I: Compression techniques. In Proc. 13th Int'l. World Wide Web Conference (WWW 2004), pages 595-601, 2004.
7. A. Buluç and J.R. Gilbert. On the representation and multiplication of hypersparse matrices. In Proc. Int'l Parallel and Distributed Processing Symp. (IPDPS 2008), pages 1-11. IEEE Computer Society, 2008.
8. A. Buluç and J.R. Gilbert. The Combinatorial BLAS: Design, implementation, and applications. The International Journal of High Performance Computing Applications, Online first, 2011.
9. A. Buluç and K. Madduri. Parallel breadth-first search on distributed memory systems. Technical Report LBNL-4769E, Lawrence Berkeley National Laboratory, 2011.
10. D. Chakrabarti, Y. Zhan, and C. Faloutsos. R-MAT: A recursive model for graph mining. In Proc. 4th SIAM Intl. Conf. on Data Mining (SDM), Orlando, FL, April 2004. SIAM.
11. A. Chan, F. Dehne, and R. Taylor. CGMGRAPH/CGMLIB: Implementing and testing CGM graph algorithms on PC clusters and shared memory machines. Int'l. Journal of High Performance Comput. Appl., 19(1):81-97, 2005. (Pubitemid 40329108)
12. G. Cong, G. Almasi, and V. Saraswat. Fast PGAS implementation of distributed graph algorithms. In Proc. ACM/IEEE Conference on Supercomputing (SC10), November 2010.
13. G. Cong and K. Makarychev. Improving memory access locality for large-scale graph analysis applications. In Proc. 22nd Intl. Parallel and Distributed Computing and Communication Systems (PDCCS 2009), pages 121-127, September 2009.
14. T. H. Cormen, C. E. Leiserson, and R. L. Rivest. Introduction to Algorithms. MIT Press, Inc., Cambridge, MA, 1990.
15. E. Cuthill and J. McKee. Reducing the bandwidth of sparse symmetric matrices. In Proc. 24th ACM Annual Conf./Annual Meeting, pages 157-172, 1969.
16. N. Edmonds, J. Willcock, T. Hoeer, and A. Lumsdaine. Design of a large-scale hybrid-parallel graph library. In International Conference on High Performance Computing, Student Research Symposium, Goa, India, December 2010. To appear.
17. H. Gazit and G.L. Miller. An improved parallel algorithm that computes the BFS numbering of a directed graph. Information Processing Letters, 28(2):61-65, 1988. (Pubitemid 18649084)
18. J.R. Gilbert, C. Moler, and R. Schreiber. Sparse matrices in Matlab: Design and implementation. SIAM Journal of Matrix Analysis and Applications, 13(1):333-356, 1992.
19. J.R. Gilbert, S. Reinhardt, and V.B. Shah. A unified framework for numerical and combinatorial computing. Computing in Science and Engineering, 10(2):20-25, 2008. (Pubitemid 351305834)
20. The Graph 500 List. http://www.graph500.org, last accessed April 2011.
21. D. Gregor and A. Lumsdaine. Lifting sequential graph algorithms for distributed-memory parallel computation. In Proc. 20th ACM SIGPLAN Conf. on Object Oriented Programming, Systems, Languages, and Applications (OOPSLA), pages 423-437, October 2005.
22. P. Harish and P.J. Narayanan. Accelerating large graph algorithms on the GPU using CUDA. In Proc. 14th Int'l. Conf. on High-Performance Computing (HiPC), pages 197-208, dec 2007.
23. B. Hendrickson, R.W. Leland, and S. Plimpton. An efficient parallel algorithm for matrix-vector multiplication. International Journal of High Speed Computing, 7(1):73-88, 1995.
24. R.E. Korf and P. Schultze. Large-scale parallel breadth-first search. In Proc. 20th National Conf. on Artificial Intelligence (AAAI'05), pages 1380-1385, July 2005. (Pubitemid 43006627)
25. 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. 22nd ACM Symp. on Parallism in Algorithms and Architectures (SPAA'10), pages 303-314, June 2010.
26. A. Lumsdaine, D. Gregor, B. Hendrickson, and J.W. Berry. Challenges in parallel graph processing. Parallel Processing Letters, 17:5-20, 2007. (Pubitemid 46573923)
27. L. Luo, M. Wong, and W m. Hwu. An effective GPU implementation of breadth-first search. In Proc. 47th Design Automation Conference (DAC'10), pages 52-55, June 2010.
28. G. Malewicz, M.H. Austern, A.J.C. Bik, J.C. Dehnert, I. Horn, N. Leiser, and G. Czajkowski. Pregel: a system for large-scale graph processing. In Proc. Int'l. Conf. on Management of Data (SIGMOD'10), pages 135-146, June 2010.
29. D. Mizell and K. Maschhoff. Early experiences with large-scale XMT systems. In Proc. Workshop on Multithreaded Architectures and Applications (MTAAP'09), May 2009.
30. R. Pearce, M. Gokhale, and N.M. Amato. Multithreaded asynchronous graph traversal for in-memory and semi-external memory. In Proc. 2010 ACM/IEEE Int'l. Conf. for High Performance Computing, Networking, Storage and Analysis (SC'10), pages 1-11, 2010.
31. M.J. Quinn and N. Deo. Parallel graph algorithms. ACM Comput. Surv., 16(3):319-348, 1984.
32. A.E. Reghbati and D.G. Corneil. Parallel computations in graph theory. SIAM Journal of Computing, 2(2):230-237, 1978.
33. D.P. Scarpazza, O. Villa, and F. Petrini. Efficient Breadth-First Search on the Cell/BE processor. IEEE Transactions on Parallel and Distributed Systems, 19(10):1381-1395, 2008.
34. G.R. Schreiber and O.C. Martin. Cut size statistics of graph bisection heuristics. SIAM Journal on Optimization, 10(1):231-251, 1999.
35. J. Ullman and M. Yannakakis. High-probability parallel transitive closure algorithms. In Proc. 2nd Annual Symp. on Parallel Algorithms and Architectures (SPAA 1990), pages 200-209, July 1990.
36. S. Williams, L. Oliker, R. Vuduc, J. Shalf, K. Yelick, and J. Demmel. Optimization of sparse matrix-vector multiplication on emerging multicore platforms. Parallel Computing, 35(3):178-194, 2009.
37. Y. Xia and V.K. Prasanna. Topologically adaptive parallel breadth-first search on multicore processors. In Proc. 21st Int'l. Conf. on Parallel and Distributed Computing Systems (PDCS'09), November 2009.
38. A. Yoo, E. Chow, K. Henderson, W. McLendon, B. Hendrickson, and Ú. V. Çatalyúrek. A scalable distributed parallel breadthfirst search algorithm on BlueGene/L. In Proc. ACM/IEEE Conf. on High Performance Computing (SC2005), November 2005.
39. K. You, J. Chong, Y. Yi, E. Gonina, C. Hughes, Y-K. Chen, W. Sung, and K. Kuetzer. Parallel scalability in speech recognition: Inference engine in large vocabulary continuous speech recognition. IEEE Signal Processing Magazine, 26(6):124-135, 2009.