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 (2^N)1 Chassis2 Chassis
2029.6352.37
2126.7651.12
2268.14126.19
2357.79110.66
24114.36225.43
2541.5481.53
2643.5484.54
2766.15127.45
2859.82116.79
2964.23122.69
30200.73
* Data in MTEPS (millions of edges traversed per second)

Lucata K-hop Benchmarks (k=6) at Scale 25

K-hop Benchmarks (k=6) on Lucata

The k-hop graph algorithm uses BFS (breadth-first search) to count all the neighbors of a source vertex which are k “hops” away.  For this benchmark, a source vertex is selected and a count of the number of vertices in the graph 6 hops away are counted.
Database Scale (2^N)1 Chassis2 Chassis
2050.6884.36
2132.2764.61
2295.19188.92
2389.62170.89
24179.36321.02
25198.71343.66
26182.02396.90
27202.25334.12
28240.07380.75
29239.9471.91
30372.57
* Data in MTEPS (millions of edges traversed per second)