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 Pathfinder

Database Scale (2N)1 Chassis4 Chassis
20255.77291.32
22647.29854.66
24931.272184.02
261035.862895.51
281122.213453.48
291271.613676.75
303761.96
* Data in MTEPS (millions of edges traversed per second)

K-hop Benchmarks (k=6) on Lucata Pathfinder

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)1 Chassis4 Chassis
20392.70477.95
22900.711341.10
241155.712993.95
261245.563589.32
281439.204311.58
291659.564446.82
304698.26
* Data in MTEPS (millions of edges traversed per second)