Optimizing large-scale graph analysis on a multi-threaded, multi-core platform

Proceedings - 25th IEEE International Parallel and Distributed Processing Symposium, IPDPS 2011

Volumn , Issue , 2011, Pages 688-697

  Cong, Guojing ^a   Makarychev, Konstantin ^a  

^a IBM T J WATSON RESEARCH CENTER   (United States)

Author keywords

Multi threading; Parallel Graph Algorithms; Software Prefetch; Traversal

Indexed keywords

CACHE PERFORMANCE; FINE GRAIN PARALLELISM; GRAPH ALGORITHMS; GRAPH ANALYSIS; HARDWARE THREADS; LONG MEMORIES; LOW-COST MEASURES; MEMORY ACCESS PATTERNS; MEMORY LATENCIES; MULTI-CORE PLATFORMS; MULTI-THREADING; MULTITHREADED; NUMBER OF THREADS; ON CURRENTS; PARALLEL GRAPH ALGORITHMS; PERFORMANCE BENEFITS; PREFETCHING; TRADITIONAL ARCHITECTURE; TRAVERSAL;

ALGORITHMS; DISTRIBUTED PARAMETER NETWORKS; MULTITASKING;

OPTIMIZATION;

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

References (31)

1. A. Aggarwal, R.J. Anderson, and M.-Y. Kao. Parallel depth-first search in general directed graphs. In Proc. 20th Ann. ACM Symp. on Theory of Computing (STOC), pages 297-308, Seattle, Washington, 1989. ACM.
2. L. Arge, M.A. Bender, E.D. Demaine, B. Holland-Minkley, and J.I. Munro. Cache-oblivious priority queue and graph algorithm applications. In Proceedings of the 34th Annual ACM Symposium on Theory of Computing, pages 268-276, Montreal, Canada, 2002.
3. D. Bader, S. Kintali, K. Madduri, and M. Mihail. Approximating betweenness centrality. Algorithms and Models for the Web-Graph, pages 124-137, 2007.
4. D. A. Bader and G. Cong. Fast shared-memory algorithms for computing the minimum spanning forest of sparse graphs. In Proc. 18th Int'l Parallel and Distributed Processing Symp. (IPDPS 2004), Santa Fe, New Mexico, Apr 2004.
5. D. A. Bader and G. Cong. Efficient parallel algorithms for multi-core and multiprocessors. In S. Rajasekaran and J. Reif, editors, Handbook of Parallel Computing: Models, Algorithms, and Applications. CRC press, 2007.
6. D. A. Bader, G. Cong, and K. Madduri. Design of multi-threaded algorithms for combinatorial problems. In S. Rajasekaran and J. Reif, editors, Handbook of Parallel Computing: Models, Algorithms, and Applications. CRC press, 2007.
7. D.A. Bader, G. Cong, and J. Feo. On the architectural requirements for efficient execution of graph algorithms. In Proceeding of the 2005 International Conference on Parallel Processing, pages 547-556, 2005.
8. A-L. Barabasi and R. Albert. Emergence of scaling in random networks. Science, 286(5439):509-512, October 1999.
9. C. Cascaval and D.A. Padua. Estimating cache misses and locality using stack distances. In Proceedings of the 17th annual international conference on Supercomputing, pages 150-159, San Francisco, CA, 2003.
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, April 2004.
11. R. Chowdhury, F. Silvestri, B. Blakeley, and V. Ramachandran. Oblivious algorithms for multicores and network of processors. In 24th IEEE International Parallel & Distributed Processing Symposium, Atlanta, Georgia, USA, 2010.
12. G. Cong, G. Almasi, and V. Saraswat. Fast PGAS implementation of distributed graph algorithms. In Proc. the 2010 ACM/IEEE International Conference for High Performance Computing, Networking, Storage and Analysis (SC2010), SC '10, pages 1-11, Washington, DC, USA, 2010. IEEE Computer Society.
13. G. Cong and S. Sbaraglia. A study of the locality behavior of minimum spanning tree algorithms. In The 13rd International Conference on High Performance Computing, pages 583-594, 2006.
14. CPI analysis on power5. on line, 2006. http://www.ibm.com/developerworks/ linux/library/pacpipower1/index.html.
15. M. Faloutsos, P. Faloutsos, and C. Faloutsos. On powerlaw relationships of the Internet topology. In Proc. ACM SIGCOMM, pages 251-262, 1999.
16. Uriel Feige. Approximating the bandwidth via volume respecting embeddings (extended abstract). In STOC '98: Proceedings of the thirtieth annual ACM symposium on Theory of computing, pages 90-99, New York, NY, USA, 1998. ACM.
17. L. C. Freeman. A set of measures of centrality based on betweenness. Sociometry, 40(1):35-41, 1977.
18. M.R. Garey and D.S. Johnson. Computers and Intractability: A Guide to the Theory of NP-Completeness. Freeman, New York, NY, 1979.
19. A.H. Gebremedhin, F. Manne, and T. Woods. Speeding up parallel graph coloring. In Proc. Para 2004, Lecture Notes in Computer Science, pages 1079-1088. Springer, 2004.
20. K-I. Goh, E. Oh, H. Jeong, B. Kahng, and D. Kim. Classification of scale-free networks. Proc. Natl. Acad. Sci., 99:12583, 2002.
21. S. Haddadi and Z. Layouni. Consecutive block minimization is 1.5-approximable. Information Processing Letters, 108:132-135, 2008.
22. T. Hagerup. Planar depth-first search in o(log n) parallel time. SIAM Journal on Computing, 19(4):678-704, 1990. (Pubitemid 20720480)
23. D.R. Helman and J. JáJá. Designing practical efficient algorithms for symmetric multiprocessors. In Algorithm Engineering and Experimentation (ALENEX'99), volume 1619 of Lecture Notes in Computer Science, pages 37-56, Baltimore, MD, January 1999. Springer-Verlag.
24. J. JáJá. An Introduction to Parallel Algorithms. Addison- Wesley Publishing Company, New York, 1992.
25. H. Jeong, S.P. Mason, A-L. Barabasi, and Z.N. Oltvai. Lethality and centrality in protein networks. Nature, 411:41, 2001.
26. R. Ladner, J.D. Fix, and A. LaMarca. The cache performance of traversals and random accesses. In Proc. 10th Ann. Symp. Discrete Algorithms (SODA-99), pages 613-622, Baltimore, MD, 1999. ACM-SIAM.
27. F. Liljeros, C. R. Edling, L. A. N. Amaral, H. E. Stanley, and Y. Aberg. The web of human sexual contacts. Nature, 411:907, 2001.
28. J.H. Reif. An optimal parallel algorithm for integer sorting. In Proc. 26th Ann. IEEE Symp. Foundations of Computer Science, pages 496-503. IEEE Press, 1985.
29. Y. Shiloach and U. Vishkin. An O(log n) parallel connectivity algorithm. J. Algs., 3(1):57-67, 1982.
30. R.E. Tarjan and U. Vishkin. An efficient parallel biconnectivity algorithm. SIAM J. Computing, 14(4):862-874, 1985.
31. Samuel Williams, Leonid Oliker, Richard Vuduc, John Shalf, Katherine Yelick, and James Demmel. Optimization of sparse matrix-vector multiplication on emerging multicore platforms. In SC '07: Proceedings of the 2007 ACM/IEEE conference on Supercomputing, pages 1-12, New York, NY, USA, 2007. ACM.