Breadth-First Search

Problem Description

This benchmark computes the level of each node from a source node in an unweighted graph. It starts at node 0 and explores all the nodes on the same level and move on to nodes at the next depth level.

Algorithm

This code has been generated using IrGL compiler. IrGL produces CUDA code and automatically adds a few optimizations to the CUDA code. For more information on the implementation and these optimizations please read this paper.

Performance

The benchmark is written in CUDA.
Compile as: make
Execute as: bfs <graphfile>
e.g., ./bfs USA-road-d.NY.gr

GraphTime (ms)
rmat2239
USA92

The above performance is observed on a 1733.500 Mhz GeForce GTX 1080 6000 with 8119 MB of main memory.