NUMA-aware graph mining techniques for performance and energy efficiency

International Conference for High Performance Computing, Networking, Storage and Analysis, SC

Volumn , Issue , 2012, Pages

  Frasca, Michael ^a   Madduri, Kamesh ^a   Raghavan, Padma ^a  

^a The Pennsylvania State University   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

BETWEENNESS CENTRALITY; COMPUTATIONAL DEMANDS; HARDWARE TOPOLOGY; IRREGULAR APPLICATIONS; MULTI-CORE MACHINES; MULTI-CORE SYSTEMS; NON-UNIFORM MEMORY ARCHITECTURE; PERFORMANCE PROFILE;

ENERGY EFFICIENCY; ENERGY UTILIZATION; MICROPROCESSOR CHIPS;

DIGITAL STORAGE;

EID: 84877711984     PISSN: 21674329     EISSN: 21674337     Source Type: Conference Proceeding    
DOI: 10.1109/SC.2012.81     Document Type: Conference Paper

References (33)

1. A. Hey, S. Tansley, and K. Tolle, The fourth paradigm: data-intensive scientific discovery. Microsoft Research Redmond, WA, 2009.
2. J. Aspnes, J. Kirsch, and A. Krishnamurthy, "Load balancing and locality in range-queriable data structures," in Proceedings of the twenty-third annual ACM symposium on Principles of distributed computing. ACM, 2004, pp. 115-124.
3. L. Seiler, D. Carmean, E. Sprangle, T. Forsyth, M. Abrash, P. Dubey, S. Junkins, A. Lake, J. Sugerman, R. Cavin, R. Espasa, E. Grochowski, T. Juan, and P. Hanrahan, "Larrabee: a many-core x86 architecture for visual computing," in SIGGRAPH '08: ACM SIGGRAPH 2008 papers. New York, NY, USA: ACM, 2008, pp. 1-15.
4. U. Brandes, "A faster algorithm for betweenness centrality," J. Mathematical Sociology, vol. 25, no. 2, pp. 163-177, 2001.
5. -, "On variants of shortest-path betweenness centrality and their generic computation," Social Networks, vol. 30, no. 2, pp. 136-145, 2008.
6. J. Shalf, S. Dosanjh, and J. Morrison, "Exascale Computing Technology Challenges," High Performance Computing for Computational Science-VECPAR 2010, pp. 1-25, 2011.
7. G. Moore et al., "Cramming more components onto integrated circuits," Proceedings of the IEEE, vol. 86, no. 1, pp. 82-85, 1998.
8. W. A. Wulf and S. A. McKee, "Hitting the memory wall: implications of the obvious," SIGARCH Comput. Archit. News, vol. 23, pp. 20-24, March 1995.
9. P. McCormick, R. Braithwaite, and W. Feng, "Empirical memory-access cost models in multicore numa architectures," Los Alamos National Laboratory (LANL), Tech. Rep., 2011.
10. S. Sawant, U. Desai, G. Shamanna, L. Sharma, M. Ranade, A. Agarwal, S. Dakshinamurthy, and R. Narayanan, "A 32nm Westmere-EX Xeon® enterprise processor," in Solid-State Circuits Conference Digest of Technical Papers (ISSCC), 2011 IEEE International. IEEE, 2011, pp. 74-75.
11. W. Bolosky, R. Fitzgerald, and M. Scott, "Simple but effective techniques for numa memory management," in ACM SIGOPS Operating Systems Review, vol. 23, no. 5. ACM, 1989, pp. 19-31.
12. D. Tam, "Operating system management of shared caches on multicore processors," Ph.D. dissertation, University of Toronto, 2010.
13. K. Madduri, D. Ediger, K. Jiang, D. Bader, and D. Chavarria-Miranda, "A faster parallel algorithm and efficient multithreaded implementations for evaluating betweenness centrality on massive datasets," in Parallel & Distributed Processing, 2009. IPDPS 2009. IEEE International Symposium on. IEEE, 2009, pp. 1-8.
14. D. Eppstein and J. Wang, "Fast approximation of centrality," Journal of Graph Algorithms and Applications, vol. 8, no. 1, pp. 39-45, 2004.
15. D. Bader, S. Kintali, K. Madduri, and M. Mihail, "Approximating betweenness centrality," in Proc. 5th Int'l. Workshop on Algorithms and Models for the Web-Graph (WAW 2007), ser. LNCS, A. Bonato and F. Chung, Eds., vol. 4863. Springer, Dec. 2007, pp. 124-137.
16. R. Geisberger, P. Sanders, and D. Schultes, "Better approximation of betweenness centrality," in Proc. Workshop on Algorithm Engineering and Experimentation (ALENEX 2008). SIAM, Jan. 2008, pp. 90-100.
17. L. Dagum and R. Menon, "Open MP: An Industry-Standard API for Shared-Memory Programming," Computational Science & Engineering, IEEE, vol. 5, no. 1, pp. 46-55, 1998.
18. A. Pinar and M. Heath, "Improving performance of sparse matrix-vector multiplication," in Proceedings of the 1999 ACM/IEEE conference on Supercomputing (CDROM). ACM, 1999, p. 30.
19. W. Liu and A. Sherman, "Comparative analysis of the Cuthill-McKee and the reverse Cuthill-McKee ordering algorithms for sparse matrices," SIAM Journal on Numerical Analysis, pp. 198-213, 1976.
20. M. Frasca, A. Chatterjee, and P. Raghavan, "Can models of scientific software-hardware interactions be predictive?" Procedia CS, vol. 4, pp. 322-331, 2011.
21. T. A. Davis and Y. Hu, "The University of Florida sparse matrix collection," ACM Trans. Math. Softw., vol. 38, no. 1, pp. 1:1-1:25, Dec. 2011. [Online]. Available: http://doi.acm.org/10.1145/2049662.2049663
22. R. Blumofe and C. Leiserson, "Scheduling multithreaded computations by work stealing," in Foundations of Computer Science, 1994 Proceedings., 35th Annual Symposium on. IEEE, 1994, pp. 356-368.
23. R. Blumofe, C. Joerg, B. Kuszmaul, C. Leiserson, K. Randall, and Y. Zhou, Cilk: An efficient multithreaded runtime system. ACM, 1995, vol. 30, no. 8.
24. D. Neill and A. Wierman, "On the benefits of work stealing in shared-memory multiprocessors," Tech Report, Department of Computer Science, Carnegie Mellon University, 2006.
25. D. Bader, H. Meyerhenke, P. Sanders, and D. Wagner, "10th DIMACS implementation challenge-graph partitioning and graph clustering, 2011."
26. P. Boldi and S. Vigna, "The WebGraph framework I: Compression techniques," in Proc. of the Thirteenth International World Wide Web Conference (WWW 2004). Manhattan, USA: ACM Press, 2004, pp. 595-601.
27. J. McCalpin, "A survey of memory bandwidth and machine balance in current high performance computers," IEEE TCCA Newsletter, pp. 19-25, 1995.
28. S. Browne, J. Dongarra, N. Garner, G. Ho, and P. Mucci, "A portable programming interface for performance evaluation on modern processors," International Journal of High Performance Computing Applications, vol. 14, no. 3, pp. 189-204, 2000. (Pubitemid 32025040)
29. W. Li and K. Pingali, "Access normalization: loop restructuring for numa computers," ACM Transactions on Computer Systems (TOCS), vol. 11, no. 4, pp. 353-375, 1993.
30. S. Cho and L. Jin, "Managing distributed, shared l2 caches through oslevel page allocation," in Proceedings of the 39th Annual IEEE/ACM International Symposium on Microarchitecture. IEEE Computer Society, 2006, pp. 455-468.
31. S. Boyd-Wickizer, H. Chen, R. Chen, Y. Mao, F. Kaashoek, R. Morris, A. Pesterev, L. Stein, M. Wu, Y. Dai et al., "Corey: An operating system for many cores," in Proceedings of the 8th USENIX conference on Operating systems design and implementation. USENIX Association, 2008, pp. 43-57.
32. U. Acar, G. Blelloch, and R. Blumofe, "The data locality of work stealing," in Proceedings of the twelfth annual ACM symposium on Parallel algorithms and architectures . ACM, 2000, pp. 1-12.
33. S. Min, C. Iancu, and K. Yelick, "Hierarchical work stealing on manycore clusters," in Fifth Conference on Partitioned Global Address Space Programming Models (PGAS11), 2011.