summaryrefslogtreecommitdiff
path: root/benchmarks/CUDA/BFS/ReadMe.txt
diff options
context:
space:
mode:
authorTor Aamodt <[email protected]>2010-07-15 18:09:46 -0800
committerTor Aamodt <[email protected]>2010-07-15 18:09:46 -0800
commit69f2911e04ffb1b19eef1fafb8c040af271f656e (patch)
tree231d3b6bdc3a202f7c255bfcf7bf2c36e32cee9e /benchmarks/CUDA/BFS/ReadMe.txt
creating branch for adding support for CUDA 3.x and Fermi
[git-p4: depot-paths = "//depot/gpgpu_sim_research/fermi/distribution/": change = 6829]
Diffstat (limited to 'benchmarks/CUDA/BFS/ReadMe.txt')
-rw-r--r--benchmarks/CUDA/BFS/ReadMe.txt25
1 files changed, 25 insertions, 0 deletions
diff --git a/benchmarks/CUDA/BFS/ReadMe.txt b/benchmarks/CUDA/BFS/ReadMe.txt
new file mode 100644
index 0000000..71a9c03
--- /dev/null
+++ b/benchmarks/CUDA/BFS/ReadMe.txt
@@ -0,0 +1,25 @@
+CUDA Implementations of Breadth First Search and Single Source Shortest Path
+algorithms given in IEEE High performance 2007 paper
+
+
+"Accelerating Large Graph Algorithms on the GPU using CUDA"
+By: Pawan Harish and P.J.Narayanan
+
+
+Please note the given implementation of SSSP requires CUDA 1.1 Hardware whereas BFS does not
+require this hardware. These codes are not optimized, please use CUDA profiler for
+better optimization.
+
+
+Copyright (c) 2008 International Institute of Information Technology.
+All rights reserved.
+
+Permission to use, copy, modify and distribute this software and its documentation for
+educational purpose is hereby granted without fee, provided that the above copyright
+notice and this permission notice appear in all copies of this software and that you do
+not sell the software.
+
+THE SOFTWARE IS PROVIDED "AS IS" AND WITHOUT WARRANTY OF ANY KIND,EXPRESS, IMPLIED OR
+OTHERWISE.
+
+Created by Pawan Harish. \ No newline at end of file