Fast and efficient graph traversal algorithm for CPUs: Maximizing single-node efficiency

Proceedings of the 2012 IEEE 26th International Parallel and Distributed Processing Symposium, IPDPS 2012

Volumn , Issue , 2012, Pages 378-389

  Chhugani, Jatin ^a   Satish, Nadathur ^a   Kim, Changkyu ^a   Sewall, Jason ^a   Dubey, Pradeep ^a  

^a INTEL CORPORATION   (United States)

Author keywords

bandwidth; efficient; Graph traversal; multi socket; single node

Indexed keywords

AVAILABLE BANDWIDTH; BANDWIDTH RESOURCE; BREADTH-FIRST SEARCH; BUILDING BLOCKES; EFFICIENT; GRAPH ALGORITHMS; GRAPH DIAMETER; GRAPH MATCHINGS; GRAPH SIZES; GRAPH TRAVERSALS; GRAPH-BASED; LOAD-BALANCING; MAIN-MEMORY ACCESS; MICRO ARCHITECTURES; MODEL DATA; MODERN PROCESSORS; MULTI CORE; MULTI-SOCKET; OPTIMIZED ALGORITHMS; PERFORMANCE BOTTLENECKS; PROCESSING POWER; REAL-WORLD GRAPHS; SCALE-FREE; SINGLE NODE; TRAVERSAL ALGORITHMS; VERTEX DEGREE; WORK DISTRIBUTION;

ALGORITHMS; ANALYTICAL MODELS; BANDWIDTH; DISTRIBUTED PARAMETER NETWORKS; GRAPHIC METHODS; MICROPROCESSOR CHIPS; MODELS; PROGRAM PROCESSORS;

PATTERN MATCHING;

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

References (32)

1. R. C. Murphy, K. B. Wheeler, B. W. Barrett, and J. A. Ang, "Introducing the graph 500," Cray User's Group, May 2010.
2. C. Demetrescui, A. Goldberg, and D. Johnson, "The Ninth DIMACS Implementation Challenge: The Shortest Path Problem," http://dimacs. rutgers.edu /Workshops/Challenge9/.
3. H. Kwak, C. Lee, H. Park, and S. B. Moon, "What is twitter, a social network or a news media?" in WWW, 2010, pp. 591-600.
4. A. Mislove, M. Marcon, P. K. Gummadi, P. Druschel, and B. Bhattacharjee, "Measurement and analysis of online social networks," in Internet Measurement Conf., '07, pp. 29-42.
5. C.Wilson, B. Boe, A. Sala, K. P. N. Puttaswamy, and B. Y. Zhao, "User interactions in social networks and their implications," in EuroSys, 2009, pp. 205-218.
6. M. Anderson, "Better benchmarking for supercomputers," IEEE Spectrum, vol. 48, pp. 12-14, January 2011.
7. D. A. Bader and K. Madduri, "Designing multithreaded algorithms for breadth-first search and st-connectivity on the cray mta-2," in ICPP, 2006, pp. 523-530.
8. A. Yoo, E. Chow, K. W. Henderson, W. M. III, B. Hendrickson, and Ü. V. Çatalyürek, "A scalable distributed parallel breadth-first search algorithm on bluegene/l," in SC, 2005, p. 25.
9. "The Graph 500 List (Nov 2010)," http://www.graph500.org.
10. G. Malewicz, M. H. Austern, A. J. Bik, J. C. Dehnert, I. Horn, N. Leiser, and G. Czajkowski, "Pregel: a system for large-scale graph processing," in SIGMOD, 2010, pp. 135-146.
11. A. Buluç and K. Madduri, "Parallel breadth-first search on distributed memory systems," CoRR, vol. abs/1104.4518, 2011.
12. M. Berezecki, E. Frachtenberg, M. Paleczny, and K. Steele, "Many-Core Key-Value Store," in To Appear at Second Intl. Green Computing Conference (IGCC 2011).
13. W. Lang, J. M. Patel, and S. Shankar, "Wimpy node clusters: what about non-wimpy workloads?" in DaMon, '10, pp. 47-55.
14. D. G. Andersen, J. Franklin, M. Kaminsky, A. Phanishayee, L. Tan, and V. Vasudevan, "FAWN: a fast array of wimpy nodes," in SIGOPS, 2009, pp. 1-14.
15. "Intel 64 and IA-32 Architectures Software Developer's Manual, System Programming Guide, Part 1," Intel Press, vol. 3A, '11.
16. D. P. Scarpazza, O. Villa, and F. Petrini, "Efficient breadth-first search on the cell/be processor," IEEE Trans. Parallel Distrib. Syst., vol. 19, no. 10, pp. 1381-1395, 2008.
17. S. Edelkamp, D. Sulewski, and C. Yücel, "Perfect hashing for state space exploration on the gpu," in ICAPS, 2010, pp. 57-64.
18. V. Agarwal, F. Petrini, D. Pasetto, and D. A. Bader, "Scalable graph exploration on multicore processors," in SC, '10, pp. 1-11.
19. Y. Xia and V. K. Prasanna, "Topologically Adaptive Parallel Breadth-first Search on Multicore-Processors," in PDCS, 2009.
20. C. Kim, E. Sedlar et al., "Sort vs. Hash Revisited: Fast Join Implementation," PVLDB, vol. 2, no. 2, pp. 1378-1389, '09.
21. D. Molka, D. Hackenberg, R. Schöne, and M. S. Müller, "Memory performance and cache coherency effects on an intel nehalem multiprocessor system," in PACT, 2009, pp. 261-270.
22. D. Chakrabarti, Y. Zhan, and C. Faloutsos, "R-mat: A recursive model for graph mining," in SDM, 2004.
23. D. A. Bader and K. Madduri, "GTgraph: A Synthetic Graph Generator Suite," http://sdm.lbl.gov/ kamesh/software.
24. T. Davis, "The University of Florida Sparse Matrix Collection," http://www.cise.ufl.edu/research/sparse/matrices.
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 SPAA, 2010, pp. 303-314.
26. L. Luo, M. D. F. Wong, and W. mei Hwu, "An effective gpu implementation of breadth-first search," in DAC, '10, pp. 52-55.
27. F. Guerriero and R. Musmanno, "Parallel Asynchronous Algorithms for the K Shortest Paths Problem," Journal of Optimization Theory and Applications, vol. 104, no. 1, pp. 91-108, 2000.
28. M. A. Hassaan, M. Burtscher, and K. Pingali, "Ordered vs. unordered: a comparison of parallelism and work-efficiency in irregular algorithms," in PPOPP, 2011, pp. 3-12.
29. R. A. Pearce, M. Gokhale, and N. M. Amato, "Multithreaded asynchronous graph traversal for in-memory and semi-external memory," in SC, 2010.
30. S. Hong, S. K. Kim, T. Oguntebi, and K. Olukotun, "Acc. CUDA graph algorithms at max. warp," in PPOPP, '11, pp. 267-276.
31. S. Hong, T. Oguntebi, and K. Olukotun, "Efficient Parallel Graph Exploration on Multi-Core CPU and GPU," in PACT, '11, pp. 78-88.
32. D. Merrill, M. Garland, and A. Grimshaw, "High Performance and Scalable GPU Graph Traversal," Univ. of Virginia, Tech. Rep. UVA CS-2011-05, 2011.