Traversing Trillions of Edges in Real-time: Graph Exploration on Large-scale Parallel Machines

被引:40
作者
Checconi, Fabio [1 ]
Petrini, Fabrizio [1 ]
机构
[1] IBM TJ Watson, High Performance Analyt Dept, Yorktown Hts, NY 10598 USA
来源
2014 IEEE 28TH INTERNATIONAL PARALLEL AND DISTRIBUTED PROCESSING SYMPOSIUM | 2014年
关键词
ALGORITHMS;
D O I
10.1109/IPDPS.2014.52
中图分类号
TP3 [计算技术、计算机技术];
学科分类号
0812 ;
摘要
The world of Big Data is changing dramatically right before our eyes-from the amount of data being produced to the way in which it is structured and used. The trend of "big data growth" presents enormous challenges, but it also presents incredible scientific and business opportunities. Together with the data explosion, we are also witnessing a dramatic increase in data processing capabilities, thanks to new powerful parallel computer architectures and more sophisticated algorithms. In this paper we describe the algorithmic design and the optimization techniques that led to the unprecedented processing rate of 15.3 trillion edges per second on 64 thousand BlueGene/Q nodes, that allowed the in-memory exploration of a petabyte-scale graph in just a few seconds. This paper provides insight into our parallelization and optimization techniques. We believe that these techniques can be successfully applied to a broader class of graph algorithms.
引用
收藏
页数:10
相关论文
共 28 条
[11]  
Chow E., 2005, UCRLCONF210829 LLNL
[12]  
Cong G., 2010, 2010 ACM/IEEE International Conference for High Performance Computing, Networking, Storage and Analysis (New Orleans, LA, USA, P1
[13]   Designing irregular parallel algorithms with mutual exclusion and lock-free protocols [J].
Cong, Guojing ;
Bader, David A. .
JOURNAL OF PARALLEL AND DISTRIBUTED COMPUTING, 2006, 66 (06) :854-866
[14]  
Harish P, 2007, LECT NOTES COMPUT SC, V4873, P197
[15]  
Kapre M. deLorimer N., 2006, S FIELD PROGR CUST C
[16]  
Leskovec J, 2010, J MACH LEARN RES, V11, P985
[17]  
Luo LJ, 2010, DES AUT CON, P52
[18]  
Mencer O, 2002, LECT NOTES COMPUT SC, V2438, P915
[19]  
Mizell D, 2009, INT PARALL DISTRIB P, P2171
[20]   Finding and evaluating community structure in networks [J].
Newman, MEJ ;
Girvan, M .
PHYSICAL REVIEW E, 2004, 69 (02) :026113-1