Branch-avoiding graph algorithms

Annual ACM Symposium on Parallelism in Algorithms and Architectures

Volumn 2015-June, Issue , 2015, Pages 212-223

  Green, Oded ^a   Dukhan, Marat ^a   Vuduc, Richard ^a  

^a Georgia Institute of Technology   (United States)

Author keywords

Branch prediction; Code generation; Connected components; Performance engineering; Predication

Indexed keywords

ARM PROCESSORS; PROGRAM COMPILERS;

BRANCH PREDICTION; CODE GENERATION; CONNECTED COMPONENT; PERFORMANCE ENGINEERING; PREDICATION;

ALGORITHMS;

EID: 84950270970     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/2755573.2755580     Document Type: Conference Paper

References (54)

1. GraphCT: A Graph Characterization Toolkit.
2. 10th dimacs implementation challenge - graph partitioning and graph clustering, 2013.
3. R. Albert, H. Jeong, and A. Barab Aasi. Internet: Diameter of the world-wide web. Nature, 401(6749):130-131, Sep. 09 1999.
4. D. A. Bader, J. Berry, A. Amos-Binks, D. Chavarría-Miranda, C. Hastings, K. Madduri, and S. C. Poulos. STINGER: Spatio-Temporal Interaction Networks and Graphs (STING) Extensible Representation. Technical report, Georgia Institute of Technology, 2009.
5. D. A. Bader and K. Madduri. Designing multithreaded algorithms for breadth-first search and st-connectivity on the Cray MTA-2. In Parallel Processing, 2006. ICPP 2006. International Conference on, pages 523-530. IEEE, 2006.
6. A.-L. Barab Aasi and R. Albert. Emergence of scaling in random networks. Science, 286(5439):509-512, 1999.
7. B. W. Barrett, J. W. Berry, R. C. Murphy, and K. B. Wheeler. Implementing a portable multi-threaded graph library: The MTGL on Qthreads. In Parallel & Distributed Processing, 2009. IPDPS 2009. IEEE International Symposium on, pages 1-8. IEEE, 2009.
8. S. Beamer, K. Asanovic, and D. Patterson. Direction-optimizing breadth-first search. In High Performance Computing, Networking, Storage and Analysis (SC), 2012 International Conference for, pages 1-10. IEEE, 2012.
9. S. Beamer, A. Buluc, K. Asanovic, and D. Patterson. Distributed memory breadth-first search revisited: Enabling bottom-up search. In Proceedings of the 2013 IEEE 27th International Symposium on Parallel and Distributed Processing Workshops and PhD Forum, pages 1618-1627. IEEE Computer Society, 2013.
10. U. Brandes. A faster algorithm for betweenness centrality. Journal of Mathematical Sociology, 25(2):163-177, 2001.
11. A. Broder, R. Kumar, F. Maghoul, P. Raghavan, S. Rajagopalan, R. Stata, A. Tomkins, and J. Wiener. Graph structure in the Web. Computer Networks, 33:309-320, 2000.
12. A. Buluc and K. Madduri. Parallel breadth-first search on distributed memory systems. In Proceedings of 2011 International Conference for High Performance Computing, Networking, Storage and Analysis, page 65. ACM, 2011.
13. A. BuluAg and J. R. Gilbert. The Combinatorial BLAS: design, implementation, and applications. International Journal of High Performance Computing Applications, 25(4):496-509, 2011.
14. M. Burtscher, R. Nasre, and K. Pingali. A quantitative study of irregular programs on GPUs. In Workload Characterization (IISWC), 2012 IEEE International Symposium on, pages 141-151. IEEE, 2012.
15. 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. In High Performance Computing, Networking, Storage and Analysis (SC), 2012 International Conference for, pages 1-12. IEEE, 2012.
16. J. Chhugani, N. Satish, C. Kim, J. Sewall, and P. Dubey. Fast and efficient graph traversal algorithm for CPUs: Maximizing single-node efficiency. In Parallel & Distributed Processing Symposium (IPDPS), 2012 IEEE 26th International, pages 378-389. IEEE, 2012.
17. G. Cong and K. Makarychev. Optimizing large-scale graph analysis on multithreaded, multicore platforms. In Parallel & Distributed Processing Symposium (IPDPS), 2012 IEEE 26th International, pages 414-425. IEEE, 2012.
18. T. H. Cormen, C. E. Leiserson, R. L. Rivest, and C. Stein. Introduction to Algorithms. The MIT Press, New York, 2001.
19. M. Dukhan. PeachPy: A python framework for developing high-performance assembly kernels, PyHPC 2013.
20. A. N. Eden and T. Mudge. The YAGS branch prediction scheme. In Proceedings of the 31st annual ACM/IEEE international symposium on Microarchitecture, pages 69-77. IEEE Computer Society Press, 1998.
21. D. Ediger, K. Jiang, J. Riedy, and D. Bader. Graphct: Multithreaded algorithms for massive graph analysis. Parallel and Distributed Systems, IEEE Transactions on, PP (99):1-1, 2012.
22. D. Ediger, R. McColl, J. Riedy, and D. Bader. Stinger: High performance data structure for streaming graphs. In Proc. High Performace Embedded Computing Workshop (HPEC 2012), Waltham, MA, Sept. 2012.
23. M. Faloutsos, P. Faloutsos, and C. Faloutsos. On Power-Law Relationships of The Internet Topology. In ACM SIGCOMM Computer Communication Review, pages 251-262. ACM, 1999.
24. R. W. Floyd. Algorithm 97: Shortest path. Commun. ACM, 5:345-345, June 1962.
25. A. Fog. The microarchitecture of Intel, AMD and VIA CPUs. An optimization guide for assembly programmers and compiler makers. Copenhagen University College of Engineering, 2013.
26. L. C. Freeman. A set of measures of centrality based on betweenness. Sociometry, 40(1): pp. 35-41, 1977.
27. O. Green. When merging and branch predictors collide. In Proceedings of the Fourth Workshop on Irregular Applications: Architectures and Algorithms, pages 33-40. IEEE Press, 2014.
28. O. Green, M. Dukhan, and R. W. Vuduc. Branch-avoiding graph algorithms. CoRR, abs/1411.1460, 2014.
29. O. Green, R. McColl, and D. A. Bader. A Fast Algorithm For Streaming Betweenness Centrality. In Proceedings of the 4th ASE/IEEE International Conference on Social Computing, SocialCom'12, 2012.
30. D. Gregor and A. Lumsdaine. The parallel BGL: A generic library for distributed graph computations. Parallel Object-Oriented Scientific Computing (POOSC), page 2, 2005.
31. S. Hong, H. Chafi, E. Sedlar, and K. Olukotun. Green-Marl: a DSL for easy and efficient graph analysis. In ACM SIGARCH Computer Architecture News, volume 40, pages 349-362. ACM, 2012.
32. J. Hopcroft and R. Tarjan. Algorithm 447: efficient algorithms for graph manipulation. Commun. ACM, 16(6):372-378, June 1973.
33. G. Karypis and V. Kumar. Metis-unstructured graph partitioning and sparse matrix ordering system, version 2.0. 1995.
34. C.-C. Lee, I.-C. Chen, and T. N. Mudge. The bi-mode branch predictor. In Microarchitecture, 1997. Proceedings., Thirtieth Annual IEEE/ACM International Symposium on, pages 4-13. IEEE, 1997.
35. J. K. Lee and A. J. Smith. Branch prediction strategies and branch target buffer design. Computer, 17(1):6-22, 1984.
36. J. Leskovec, J. Kleinberg, and C. Faloutsos. Graph evolution: Densification and shrinking diameters. ACM Trans. Knowl. Discov. Data, 1(1), 2007.
37. 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 Proceedings of the 2010 ACM SIGMOD International Conference on Management of data, pages 135-146. ACM, 2010.
38. R. McColl, O. Green, and D. Bader. Parallel streaming connected components using "parent-neighbor" subgraphs. In IEEE International Conference on High Performance Computing, 2013.
39. D. Merrill, M. Garland, and A. Grimshaw. Scalable gpu graph traversal. In ACM SIGPLAN symposium on Principles and Practice of Parallel Programming, PPoPP'12, pages 117-128, New York, NY, USA, 2012. ACM.
40. M. Milenkovic, A. Milenkovic, and J. Kulick. Demystifying intel branch predictors. In Workshop on Duplicating, Deconstructing and Debunking, 2002.
41. S. Milgram. The Small World Problem. Psychology Today, 2(1):60-67, 1967.
42. M. Newman and M. Girvan. Finding and evaluating community structure in networks. Physical review E, 69(2):026113, 2004.
43. E. J. Riedy, H. Meyerhenke, D. Ediger, and D. A. Bader. Parallel community detection for massive graphs. In Parallel Processing and Applied Mathematics, pages 286-296. Springer, 2012.
44. G. Sabidussi. The centrality index of a graph. Psychometrika, 31(4):581-603, 1966.
45. Y. Shiloach and S. Even. An on-line edge-deletion problem. J. ACM, 28:1-4, January 1981.
46. Y. Shiloach and U. Vishkin. An O (logn) parallel connectivity algorithm. Journal of Algorithms, 3(1):57-67, 1982.
47. J. Shun and G. E. Blelloch. Ligra: a lightweight graph processing framework for shared memory. In Proceedings of the 18th ACM SIGPLAN symposium on Principles and practice of parallel programming, pages 135-146. ACM, 2013.
48. J. E. Smith. A study of branch prediction strategies. In Proceedings of the 8th annual symposium on Computer Architecture, pages 135-148. IEEE Computer Society Press, 1981.
49. E. Sprangle, R. S. Chappell, M. Alsup, and Y. N. Patt. The agree predictor: A mechanism for reducing negative branch history interference. In ACM SIGARCH Computer Architecture News, volume 25, pages 284-291. ACM, 1997.
50. S. Warshall. A theorem on boolean matrices. J. ACM, 9:11-12, Jan. 1962.
51. D. J. Watts and S. H. Strogatz. Collective Dynamics of "Small-World" Networks. Nature, 393(6684):440-442, 1998.
52. T.-Y. Yeh and Y. N. Patt. Two-level adaptive training branch prediction. In Proceedings of the 24th annual international symposium on Microarchitecture, pages 51-61. ACM, 1991.
53. T.-Y. Yeh and Y. N. Patt. Alternative implementations of two-level adaptive branch prediction. In ACM SIGARCH Computer Architecture News, volume 20, pages 124-134. ACM, 1992.
54. A. Yoo, E. Chow, K. Henderson, W. McLendon, B. Hendrickson, and U. Catalyurek. A scalable distributed parallel breadth-first search algorithm on BlueGene/L. In Supercomputing, 2005. Proceedings of the ACM/IEEE SC 2005 Conference, pages 25-25. IEEE, 2005.