summaryrefslogtreecommitdiff
path: root/benchmarks/CUDA/BFS/ReadMe.txt
diff options
context:
space:
mode:
authorTor Aamodt <[email protected]>2010-10-01 08:55:28 -0800
committerTor Aamodt <[email protected]>2010-10-01 08:55:28 -0800
commit11b308e7363e937966b035b4891db32b4eece3bf (patch)
tree50ca4c9ad6f163ac4acb2bf505e64dfebed66947 /benchmarks/CUDA/BFS/ReadMe.txt
parentbb820c116764d7a1b8e071137d32b74e7f34dd2f (diff)
integrating recent changes from fermi-test into fermi
(i'll use "fermi" for more disruptive changes to the pipeline model such as updating the MSHRs and getting rid of the warp tracker, ripping out DWF, etc...) [git-p4: depot-paths = "//depot/gpgpu_sim_research/fermi/distribution/": change = 7805]
Diffstat (limited to 'benchmarks/CUDA/BFS/ReadMe.txt')
-rw-r--r--benchmarks/CUDA/BFS/ReadMe.txt25
1 files changed, 0 insertions, 25 deletions
diff --git a/benchmarks/CUDA/BFS/ReadMe.txt b/benchmarks/CUDA/BFS/ReadMe.txt
deleted file mode 100644
index 71a9c03..0000000
--- a/benchmarks/CUDA/BFS/ReadMe.txt
+++ /dev/null
@@ -1,25 +0,0 @@
-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