Differences

This shows you the differences between two versions of the page.

Link to this comparison view

graph_traversal [2018/10/03 17:21]
root created
graph_traversal [2018/10/03 17:44] (current)
root
Line 1: Line 1:
 ====== Graph Traversal ====== ====== Graph Traversal ======
 +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 [[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 [[http://​www.iiit.net/​techreports/​2007_103.pdf|here]].
 +
 +Retrieved from "​https://​www.cs.virginia.edu/​~skadron/​wiki/​rodinia/​index.php?​title=Graph_traversal&​oldid=187"​
 +
  • graph_traversal.txt
  • Last modified: 2018/10/03 17:44
  • by root