Large-scale energy-efficient graph traversal: A path to efficient data-intensive supercomputing

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

Volumn , Issue , 2012, Pages

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

^a INTEL CORPORATION   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

BUSINESS ANALYTICS; CLUSTER IMPLEMENTATION; DATA COMPRESSION TECHNIQUES; DATA-COMMUNICATION; HIGH SCALABILITIES; HIGH-PERFORMANCE COMPUTING; PERFORMANCE IMPROVEMENTS; TRANSFER TECHNIQUE;

DATA TRANSFER; DIGITAL STORAGE; ENERGY UTILIZATION; OPTIMIZATION; SOCIAL SCIENCES COMPUTING;

CLUSTERING ALGORITHMS;

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

References (43)

1. J. Chhugani, N. Satish, C. Kim, J. Sewall, and P. Dubey, "Fast and efficient graph traversal algorithm for cpus : Maximizing single-node efficiency," Parallel and Distributed Processing Symposium, International, vol. 0, pp. 1-10, 2012.
2. "The Graph 500 List (Nov 2011)," http://www.graph500.org.
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. M. Fernandez, D. Florescu, A. Levy, and D. Suciu, "A query language for a Website management system," SIGMOD Rec., vol. 26, pp. 4-11, September 1997. (Pubitemid 127459501)
6. U. Kang, C. E. Tsourakakis, A. P. Appel, C. Faloutsos, and J. Leskovec, "Radius plots for mining tera-byte scale graphs: Algorithms, patterns, and observations," in SDM, 2010, pp. 548-558.
7. D. Bader, "Exascale Analytics of Massive Social Networks," 2010, AN09 Minisymposium on High Performance Comp. on Massive Real-World Graphs.
8. M. Anderson, "Better benchmarking for supercomputers," IEEE Spectrum, vol. 48, pp. 12-14, January 2011.
9. R. C. Murphy, K. B. Wheeler, B. W. Barrett, and J. A. Ang, "Introducing the graph 500," Cray User's Group, May 2010.
10. P. Kogge and K. B. et al., "ExaScale Computing Study: Technology Challenges in Achieving Exascale Systems," 2008.
11. J. Dongarra, P.Beckman, et al, "The international exascale software project roadmap," International Journal of High Performance Computing, vol. 25, no. 1, pp. 3-60, 2011.
12. D. G. Andersen, J. Franklin, M. Kaminsky, A. Phanishayee, L. Tan, and V. Vasudevan, "Fawn: a fast array of wimpy nodes," in SOSP, 2009, pp. 1-14.
13. J. G. Koomey, "Worldwide electricity used in data centers," Environmental Research Letters, vol. 3, no. 3, p. 034008, 2008. [Online]. Available: http://stacks.iop.org/1748-9326/3/i=3/a=034008
14. Julian Seward, "Bzip2: Program and Library for lossless, block-sorting data compression.," 2012. [Online]. Available: bzip.org
15. K. M. Wong and S. Chen, "The entropy of ordered sequences and order statistics." IEEE Transactions on Information Theory, vol. 36, no. 2, pp. 276-284, 1990. (Pubitemid 20702152)
16. H. E. Williams and J. Zobel, "Compressing integers for fast file access," Comput. J., vol. 42, no. 3, pp. 193-201, 1999.
17. Toyotaro Suzumura et al., "Performance characterization of the graph500 on large-scale distributed environment," in IISWC, 2011.
18. A. Buluç and K. Madduri, "Parallel breadth-first search on distributed memory systems," in SC, 2011, p. 65.
19. Intel, "Intel Data Center Manager," http://software.intel.com/ sites/datacentermanager/, 2012.
20. D. Bader, G. Cong, and J. Feo, "On the architectural requirements for efficient execution of graph algorithms," in Parallel Processing, 2005. ICPP 2005. International Conference on, june 2005, pp. 547-556.
21. J. R. Crobak, J. W. Berry, K. Madduri, and D. A. Bader, "Advanced shortest paths algorithms on a massively-multithreaded architecture," in IPDPS, 2007, pp. 1-8.
22. D. A. Bader, S. Kintali, K. Madduri, and M. Mihail, "Approximating betweenness centrality," in WAW, 2007, pp. 124-137.
23. "Intel Advanced Vector Extensions Programming Reference," 2008, http://softwarecommunity.intel.com/isn/downloads/intelavx/Intel-AVX- Programming-Reference-31943302.pdf.
24. "The Message Passing Interface (MPI) standard," http://www.mcs.anl.gov/research/projects/mpi/.
25. "Intel MPI Library," http://software.intel.com/en-us/articles/ intel-mpi-library/.
26. T. Willhalm, N. Popovici, Y. Boshmaf, H. Plattner, A. Zeier, and J. Schaffner, "Simd-scan: ultra fast in-memory table scan using on-chip vector processing units," Proc. VLDB Endow., vol. 2, no. 1, pp. 385-394, aug 2009.
27. C. Kim, J. Chhugani, N. Satish, E. Sedlar, A. D. Nguyen, T. Kaldewey, V. W. Lee, S. A. Brandt, and P. Dubey, "Fast: fast architecture sensitive tree search on modern cpus and gpus," in SIGMOD. ACM, 2010, pp. 339-350.
28. R. Motwani and P. Raghvan, Randomized Algorithms. Cambridge University Press, 1995.
29. S. Beamer, K. Asanovic, and D. A. Patterson, "Searching for a parent instead of fighting over children: A fast breadth-first search implementation for graph500," EECS Department, University of California, Berkeley, Tech. Rep. UCB/EECS-2011-117, Nov 2011. [Online]. Available: http://www.eecs.berkeley. edu/Pubs/TechRpts/2011/EECS-2011-117.html
30. C. E. Leiserson, "Fat-Trees: Universal Networks for Hardware-Efficient Supercomputing," IEEE Transactions on Computers, vol. 34, no. 10, 1985.
31. NASA, "Pleiadas supercomputer," http://www.nas.nasa.gov/hecc/ resources/pleiades.html.
32. V. Agarwal, F. Petrini, D. Pasetto, and D. A. Bader, "Scalable graph exploration on multicore processors," in SC, '10, pp. 1-11.
33. 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.
34. Y. Xia and V. K. Prasanna, "Topologically Adaptive Parallel Breadth-first Search on Multicore-Processors," in PDCS, 2009.
35. S. Hong, S. K. Kim, T. Oguntebi, and K. Olukotun, "Acc. CUDA graph algorithms at max. warp," in PPOPP, '11, pp. 267-276.
36. 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.
37. 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.
38. J. Jose, S. Potluri, M. Luo et al., "Upc queues for scalable graph traversals: Design and evaluation on infiniband clusters," in PGAS, 2011.
39. V. Marjanović, J. Labarta, E. Ayguadé, and M. Valero, "Overlapping communication and computation by using a hybrid mpi/smpss approach," in Proceedings of the 24th ACM International Conference on Supercomputing, ser. ICS '10. New York, NY, USA: ACM, 2010, pp. 5-16. [Online]. Available: http://doi.acm.org/10.1145/1810085.1810091
40. B. V. Protopopov and A. Skjellum, "A multithreaded message passing interface (mpi) architecture: performance and program issues," J. Parallel Distrib. Comput., vol. 61, no. 4, pp. 449-466, Apr. 2001. [Online]. Available: http://dx.doi.org/10.1006/jpdc.2000.1674
41. Mao Jiayin and Song Bo and Wu Yongwei and Yang Guangwen, "Overlapping 107 Communication and Computation in MPI by Multithreading," 2006.
42. V. H. Allan, R. B. Jones, R. M. Lee, and S. J. Allan, "Software pipelining," ACM Computing Surveys, vol. 27, no. 3, pp. 367-432, 1995.
43. H. Simon, "Exascale computing: Applications performance and energy efficiency," Santa Barbara Summit on Energy Efficiency, April 2011.