Breadth-First Search (BFS) Benchmarks

Lucata powers high performance graph analytics with a next generation computing architecture. Performance benchmarks running Breadth-First Search (BFS) on Graph500 datasets using Lucata Pathfinder are below.

Breadth-First Search (BFS) Benchmarks on Lucata

Database Scale (2N)4 Chassis
220.574
240.785
260.853
280.933
291.066
300.955
* Data in GTEPS (billions of edges traversed per second) based on the average of 10 runs

K-hop Benchmarks (k=6) on Lucata

The k-hop graph algorithm uses BFS (breadth-first search) to count all neighbors of a source vertex which are k “hops” away.  A source vertex is selected and a count of the number of vertices 6 hops away are counted in the benchmark below.

 

 

Database Scale (2N)4 Chassis
210.336
220.548
230.684
240.947
251.056
261.226
271.017
281.185
291.529
301.170
* Data in GTEPS (billions of edges traversed per second) based on the average of 10 runs