Distributed memory breadth-first search revisited: Enabling bottom-up search

Proceedings - IEEE 27th International Parallel and Distributed Processing Symposium Workshops and PhD Forum, IPDPSW 2013

Volumn , Issue , 2013, Pages 1618-1627

  Beamer, Scott ^a   Buluc, Aydin ^b   Asanovic, Krste ^a   Patterson, David ^a  

^a UNIVERSITY OF CALIFORNIA   (United States)

^b LAWRENCE BERKELEY NATIONAL LABORATORY   (United States)

Author keywords

breadth first search; direction optimizing; distributed

Indexed keywords

BENCHMARKING;

BOTTOM UP APPROACH; BREADTH-FIRST SEARCH; DEFAULT PARAMETERS; DIRECTION-OPTIMIZING; DISTRIBUTED; DISTRIBUTED MEMORY; OPTIMIZING ALGORITHM; TOP DOWN APPROACHES;

MEMORY ARCHITECTURE;

EID: 84899739505     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/IPDPSW.2013.159     Document Type: Conference Paper

References (27)

1. R. E. Tarjan, "Depth-first search and linear graph algorithms," SIAM Journal on Computing, vol. 1, no. 2, pp. 146-160, Jun. 1972.
2. W. McLendon III, B. Hendrickson, S. J. Plimpton, and L. Rauchwerger, "Finding strongly connected components in distributed graphs," Journal Parallel Distributed Computing, vol. 65, no. 8, pp. 901-910, Aug. 2005.
3. D. J. Watts, "Networks, dynamics and the small-world phenomenon," American Journal of Sociology, vol. 105, no. 2, pp. 493-527, 1999.
4. D. S. Bassett and E. Bullmore, "Small-world brain networks," The Neuroscientist, vol. 12, no. 6, pp. 512-23, 2006.
5. S. Beamer, K. Asanovi?c, and D. A. Patterson, "Direction-optimizing breadth-first search," Proceedings of the International Conference for High Performance Computing, Networking, Storage and Analysis (SC), 2012.
6. A. Buluc? and K. Madduri, "Parallel breadth-first search on distributed memory systems," in International Conference for High Performance Computing, Networking, Storage and Analysis (SC), 2011.
7. A. Yoo, E. Chow, K. Henderson, W. McLendon, B. Hendrickson, and U?. V. C? atalyu?rek, "A scalable distributed parallel breadth-first search algorithm on BlueGene/L," in Conference on High Performance Computing (SC), 2005.
8. S. Beamer, K. Asanovi?c, and D. A. Patterson, "Searching for a parent instead of fighting over children: A fast breadth-first search implementation for graph500," EECS Department, University of California, Berkeley, Tech. Rep. UCB/EECS-2011-117, 2011.
9. S. Hong, T. Oguntebi, and K. Olukotun, "Efficient parallel graph exploration on multi-core CPU and GPU," Parallel Architectures and Compilation Techniques (PACT), 2011.
10. D. Chakrabarti, Y. Zhan, and C. Faloutsos, "R-MAT: A recursive model for graph mining," in International Conference on Data Mining (SDM). Orlando, FL: SIAM, Apr. 2004.
11. H. Kwak, C. Lee, H. Park, and S. Moon, "What is twitter, a social network or a news media?" International World Wide Web Conference (WWW), 2010.
12. "Graph500 benchmark." www.graph500.org.
13. A. Buluc? and J. Gilbert, "The Combinatorial BLAS: Design, implementation, and applications," International Journal of High Performance Computing Applications (IJHPCA), vol. 25, no. 4, pp. 496-509, 2011.
14. 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," International Conference for High Performance Computing, Networking, Storage and Analysis (SC), 2012.
15. J. D. Ullman and M. Yannakakis, "High-probability parallel transitiveclosure algorithms," SIAM J. Comput., vol. 20, no. 1, pp. 100-125, 1991.
16. V. Agarwal, F. Petrini, D. Pasetto, and D. Bader, "Scalable graph exploration on multicore processors," in International Conference for High Performance Computing, Networking, Storage and Analysis (SC), Nov. 2010.
17. C. Leiserson and T. Schardl, "A work-efficient parallel breadth-first search algorithm (or how to cope with the nondeterminism of reducers)," in Symposium on Parallelism in Algorithms and Architectures (SPAA), Jun. 2010, pp. 303-314.
18. Y. Xia and V. Prasanna, "Topologically adaptive parallel breadth-first search on multicore processors," in International Conference on Parallel and Distributed Computing Systems (PDCS), Nov. 2009.
19. P. Harish and P. Narayanan, "Accelerating large graph algorithms on the GPU using CUDA," in International Conference on High-Performance Computing (HiPC), dec 2007, pp. 197-208.
20. S. Hong, S. Kim, T. Oguntebi, and K. Olukotun, "Accelerating cuda graph algorithms at maximum warp," Symposium on Principles and Practice of Parallel Programming (PPoPP), 2011.
21. D. Merrill, M. Garland, and A. Grimshaw, "Scalable GPU graph traversal," Principles and Practice of Parallel Programming (PPoPP), 2012.
22. D. Bader and K. Madduri, "Designing multithreaded algorithms for breadth-first search and st-connectivity on the Cray MTA-2," in Proc. 35th International Conference on Parallel Processing (ICPP), Aug. 2006, pp. 523-530.
23. D. Mizell and K. Maschhoff, "Early experiences with large-scale XMT systems," in Workshop on Multithreaded Architectures and Applications (MTAAP), 2009.
24. N. Edmonds, J. Willcock, T. Hoefler, and A. Lumsdaine, "Design of a large-scale hybrid-parallel graph library," in International Conference on High Performance Computing, Student Research Symposium, Goa, India, 2010.
25. G. Cong, G. Almasi, and V. Saraswat, "Fast PGAS implementation of distributed graph algorithms," in International Conference for High Performance Computing, Networking, Storage and Analysis (SC), Nov. 2010.
26. R. Pearce, M. Gokhale, and N. Amato, "Multithreaded asynchronous graph traversal for in-memory and semi-external memory," in International Conference for High Performance Computing, Networking, Storage and Analysis (SC), 2010, pp. 1-11.
27. N. Satish, C. Kim, J. Chhugani, and P. Dubey, "Large-scale energyefficient graph traversal: A path to efficient data-intensive supercomputing," International Conference for High Performance Computing, Networking, Storage and Analysis (SC), 2012.