An NSA Big Graph experiment Paul Burkhardt, Chris Waring May 20, 2013
An NSA Big Graph experiment Paul Burkhardt, Chris Waring May 20, 2013
An NSA Big Graph experiment Paul Burkhardt, Chris Waring May 20, 2013
Create successful ePaper yourself
Turn your PDF publications into a flip-book with our unique Google optimized e-Paper software.
<strong>Graph</strong>500 Experiment<br />
<strong>Graph</strong>500 Huge class — scale 42<br />
2 42 (4.40 trillion) vertices<br />
2 46 (70.4 trillion) edges<br />
1 Petabyte<br />
Huge problem is 19.5x<br />
more than cluster<br />
memory<br />
linear performance from<br />
1 trillion to 70 trillion<br />
edges. . .<br />
despite multiple<br />
hardware failures!<br />
Traversed Edges (trillion)<br />
36 39<br />
Problem Class<br />
42<br />
80<br />
70<br />
60<br />
50<br />
40<br />
30<br />
<strong>20</strong><br />
10<br />
0<br />
Problem Class<br />
Memory = 57.6 TB<br />
0 <strong>20</strong> 40 60 80 100 1<strong>20</strong> 140<br />
Time (h)<br />
<strong>NSA</strong>-RD-<strong>20</strong>13-056001v1<br />
1126<br />
Terabytes<br />
140<br />
17<br />
<strong>Graph</strong>500 Scalability Benchmark<br />
<strong>Paul</strong> <strong>Burkhardt</strong>, <strong>Chris</strong> <strong>Waring</strong> <strong>An</strong> <strong>NSA</strong> <strong>Big</strong> <strong>Graph</strong> <strong>experiment</strong>
Change language