Locality exists in graph processing: Workload characterization on an ivy bridge server

Proceedings - 2015 IEEE International Symposium on Workload Characterization, IISWC 2015

Volumn , Issue , 2015, Pages 56-65

  Beamer, Scott ^a   Asanović, Krste ^a   Patterson, David ^a  

^a UNIVERSITY OF CALIFORNIA   (United States)

Author keywords

Graph algorithms; Graph processing; Performance counters

Indexed keywords

BANDWIDTH;

BAND-WIDTH UTILIZATION; GRAPH ALGORITHMS; GRAPH PROCESSING; HARDWARE PERFORMANCE COUNTERS; PERFORMANCE CHARACTERISTICS; PERFORMANCE COUNTERS; PROCESSOR ARCHITECTURES; WORKLOAD CHARACTERIZATION;

CHARACTERIZATION;

EID: 84962232247     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/IISWC.2015.12     Document Type: Conference Paper

References (47)

1. V. Agarwal et al., "Scalable graph exploration on multicore processors, " Supercomputing (SC), 2010.
2. W. Anderson et al., "Early experience with scientific programs on the Cray MTA-2, " in Supercomputing (SC), 2003.
3. L. Backstrom et al., "Four degrees of separation, " ACM Web Science Conference, pp. 45-54, 2012.
4. D. A. Bader, G. Cong, and J. Feo, "On the architectural requirements for efficient execution of graph algorithms, " International Conference on Parallel Processing, Jul 2005.
5. A.-L. Barabási and R. Albert, "Emergence of scaling in random networks, " Science, vol. 286, pp. 509-512, Oct 1999.
6. S. Beamer, K. Asanovíc, and D. A. Patterson, "The GAP benchmark suite, " arXiv: 1508. 03619, August 2015.
7. S. Beamer, K. Asanoví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.
8. R. D. Blumofe et al., "Cilk: An efficient multithreaded runtime system, " Journal of parallel and distributed computing (JPDC), vol. 37, no. 1, pp. 55-69, 1996.
9. M. Burtscher, R. Nasre, and K. Pingali, "A quantitative study of irregular programs on GPUs, " IISWC, pp. 141-151, 2012.
10. S. Che et al., "Pannotia: Understanding irregular GPGPU graph applications, " in IISWC, 2013.
11. J. Chhugani et al., "Fast and efficient graph traversal algorithm for CPUs: Maximizing single-node efficiency, " IPDPS, 2012.
12. G. Cong and K. Makarychev, "Optimizing large-scale graph analysis on multithreaded, multicore platforms, " IPDPS, Feb 2011.
13. G. Cong and S. Sbaraglia, "A study on the locality behavior of minimum spanning tree algorithms, " in High Performance Computing (HiPC). Springer, 2006, pp. 583-594.
14. T. Davis and Y. Hu, "The University of Florida sparse matrix collection, " ACM Transactions on Mathematical Software, vol. 38, pp. 1: 1-1: 25, 2011.
15. "9th DIMACS implementation challenge-shortest paths. " http: //www. dis. uniroma1. it/challenge9/, 2006.
16. J. Dundas and T. Mudge, "Improving data cache performance by preexecuting instructions under a cache miss, " in International Conference on Supercomputing (ICS), 1997.
17. S. J. Eggers et al., "Simultaneous multithreading: A platform for nextgeneration processors, " IEEE Micro, vol. 17, no. 5, pp. 12-19, 1997.
18. P. Erdos and A. Réyni, "On random graphs. I, " Publicationes Mathematicae, vol. 6, pp. 290-297, 1959.
19. "GAP benchmark suite reference code v0. 6. " https: //github. com/sbeamer/gapbs.
20. J. E. Gonzalez et al., "Powergraph: Distributed graph-parallel computation on natural graphs, " Symposium on Operating Systems Design and Implementation (OSDI), pp. 17-30, 2012.
21. "Graph500 benchmark. " www. graph500. org.
22. O. Green, M. Dukhan, and R. Vuduc, "Branch-avoiding graph algorithms, " Symposium on Parallelism in Algorithms and Architectures (SPAA), 2015.
23. S. Hong, T. Oguntebi, and K. Olukotun, "Efficient parallel graph exploration on multi-core CPU and GPU, " Parallel Architectures and Compilation Techniques (PACT), 2011.
24. "Intel performance counter monitor. " www. intel. com/software/pcm.
25. H. Kwak et al., "What is Twitter, a social network or a news media?" International World Wide Web Conference (WWW), 2010.
26. A. Kyrola, G. Blelloch, and C. Guestrin, "GraphChi: Large-scale graph computation on just a PC, " Symposium on Operating Systems Design and Implementation (OSDI), pp. 1-17, Oct 2012.
27. J. Leskovec et al., "Realistic, mathematically tractable graph generation and evolution, using Kronecker multiplication, " European Conference on Principles and Practice of Knowledge Discovery in Databases, 2005.
28. Y. Low et al., "GraphLab: A new framework for parallel machine learning, " Uncertainty in Artificial Intelligence, 2010.
29. A. Lumsdaine et al., "Challenges in parallel graph processing, " Parallel Processing Letters, vol. 17, no. 01, pp. 5-20, 2007.
30. F. McSherry, M. Isard, and D. G. Murray, "Scalability! but at what COST?" Workshop on Hot Topics in Operating Systems (HotOS), 2015.
31. A. Mislove et al., "Measurement and analysis of online social networks, " ACM SIGCOMM Conference on Internet Measurement (IMC), 2007.
32. P. J. Mucci et al., "PAPI: A portable interface to hardware performance counters, " in Department of Defense HPCMP Users Group Conference, 1999.
33. R. C. Murphy and P. M. Kogge, "On the memory access patterns of supercomputer applications: Benchmark selection and its implications, " IEEE Transactions on Computers, vol. 56, no. 7, pp. 937-945, 2007.
34. O. Mutlu et al., "Runahead execution: An alternative to very large instruction windows for out-of-order processors, " in International Symposium on High-Performance Computer Architecture (HPCA), 2003.
35. J. Nelson et al., "Crunching large graphs with commodity processors, " USENIX conference on Hot topic in parallelism (HotPAR), 2011.
36. D. Nguyen, A. Lenharth, and K. Pingali, "A lightweight infrastructure for graph analytics, " Symposium on Operating Systems Principles (SOSP), 2013.
37. M. A. O'Neil and M. Burtscher, "Microarchitectural performance characterization of irregular GPU kernels, " IISWC, 2014.
38. L. Page et al., "The pagerank citation ranking: Bringing order to the web. " Stanford InfoLab, Technical Report 1999-66, November 1999.
39. J. B. Pereira-Leal, A. J. Enright, and C. A. Ouzounis, "Detection of functional modules from protein interaction networks, " PROTEINS: Structure, Function, and Bioinformatics, vol. 54, no. 1, pp. 49-57, 2004.
40. J. Shun and G. E. Blelloch, "Ligra: A lightweight graph processing framework for shared memory, " Symposium on Principles and Practice of Parallel Programming (PPoPP), 2013.
41. K. D. Underwood et al., "Analyzing the scalability of graph algorithms on Eldorado, " in IPDPS, 2007, pp. 1-8.
42. D. Watts and S. Strogatz, "Collective dynamics of 'small-world' networks, " Nature, vol. 393, pp. 440-442, June 1998.
43. Y. Wu et al., "Performance characterization for high-level programming models for GPU graph analytics, " in IISWC, 2015.
44. Q. Xu, H. Jeon, and M. Annavaram, "Graph processing on GPUs: Where are the bottlenecks?" IISWC, 2014.
45. J. Yang and J. Leskovec, "Defining and evaluating network communities based on ground-truth, " CoRR, vol. abs/1205. 6233, 2012.
46. K. You et al., "Scalable HMM-based inference engine in large vocabulary continuous speech recognition, " IEEE Signal Processing Magazine, 2010.
47. L. Yuan et al., "Modeling the locality in graph traversals, " in International Conference on Parallel Processing (ICPP), 2012.