# Difference between revisions of "Graph traversal"

From Rodinia

(One intermediate revision by one other user not shown) | |||

Line 2: | Line 2: | ||

areas. Large graphs involving millions of vertices are common in scientific and | areas. Large graphs involving millions of vertices are common in scientific and | ||

engineering applications. | engineering applications. | ||

− | This benchmark suite provides the GPU implementations of breadth-first search (BFS) algorithm which traverses all the connected components in a graph | + | This benchmark suite provides the GPU implementations of breadth-first search (BFS) algorithm which traverses all the connected components in a graph. |

− | |||

− | |||

− | |||

− | |||

We would like to acknowledge Pawan Harish and P.J.Narayanan at [http://cvit.iiit.ac.in/index.php?page=projects IIIT] who contributed their code to the Rodinia benchmark suite. The related paper can be found at [http://www.iiit.net/techreports/2007_103.pdf here] | We would like to acknowledge Pawan Harish and P.J.Narayanan at [http://cvit.iiit.ac.in/index.php?page=projects IIIT] who contributed their code to the Rodinia benchmark suite. The related paper can be found at [http://www.iiit.net/techreports/2007_103.pdf here] |

## Latest revision as of 17:32, 4 May 2009

Graph algorithms are fundamental and widely used in many disciplines and application areas. Large graphs involving millions of vertices are common in scientific and engineering applications. This benchmark suite provides the GPU implementations of breadth-first search (BFS) algorithm which traverses all the connected components in a graph.

We would like to acknowledge Pawan Harish and P.J.Narayanan at IIIT who contributed their code to the Rodinia benchmark suite. The related paper can be found at here