1 files changed, 0 insertions, 43 deletions
diff --git a/benchmarks/CUDA/BFS/kernel.cu b/benchmarks/CUDA/BFS/kernel.cu
deleted file mode 100644
index 50f9e20..0000000
--- a/benchmarks/CUDA/BFS/kernel.cu
+++ /dev/null
@@ -1,43 +0,0 @@
-/*********************************************************************************
-Implementing Breadth first search on CUDA using algorithm given in HiPC'07
-  paper "Accelerating Large Graph Algorithms on the GPU using CUDA"
-
-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.
-
-The CUDA Kernel for Applying BFS on a loaded Graph. Created By Pawan Harish
-**********************************************************************************/
-#ifndef _KERNEL_H_
-#define _KERNEL_H_
-
-__global__ void
-Kernel( Node* g_graph_nodes, int* g_graph_edges, bool* g_graph_mask, bool* g_graph_visited, int* g_cost, bool *g_over, int no_of_nodes) 
-{
-	int tid = blockIdx.x*MAX_THREADS_PER_BLOCK + threadIdx.x;
-	if( tid<no_of_nodes && g_graph_mask[tid])
-	{
-		g_graph_mask[tid]=false;
-		g_graph_visited[tid]=true;
-		for(int i=g_graph_nodes[tid].starting; i<(g_graph_nodes[tid].no_of_edges + g_graph_nodes[tid].starting); i++)
-			{
-			int id = g_graph_edges[i];
-			if(!g_graph_visited[id])
-				{
-				g_cost[id]=g_cost[tid]+1;
-				g_graph_mask[id]=true;
-				//Change the loop stop value such that loop continues
-				*g_over=true;
-				}
-			}
-	}
-}
-
-#endif