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 Chassis2 Chassis4 Chassis
22215.26384.69573.80
24311.00529.96785.42
26234.08456.76852.51
28247.58489.32933.33
29554.41,066.19
30955.13
* 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 Chassis2 Chassis4 Chassis
210.1420.1760.336
220.1760.3130.548
230.2270.3950.684
240.2620.5620.947
250.2720.6101.056
260.3090.7181.226
270.3120.5921.017
280.3230.7111.185
290.8891.529
301.170
* Data in GTEPS (billions of edges traversed per second)