Difference between revisions of "Graph traversal"

From Rodinia
Jump to: navigation, search
(New page: Will come soon)
 
Line 1: Line 1:
Will come soon
+
Editting...
 +
 
 +
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.
 +
 
 +
 
 +
The breadth-first search and shortest path CUDA implementations can be downloaded from [http://www.people.virginia.edu/~sc5nf/HiPC.zip 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]

Revision as of 06:29, 18 November 2008

Editting...

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.


The breadth-first search and shortest path CUDA implementations can be downloaded from here

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