An implementation of the ID3 Decision Tree algorithm in Java from scratch.
You can not select more than 25 topics Topics must start with a letter or number, can include dashes ('-') and can be up to 35 characters long.
 
 

13 lines
391 B

__kernel void sumReduction(__global int *A, __global int* C, int offset)
{
int global_id = get_global_id(0);
//if(get_global_size(0) < 5)
// printf("Thread id = %d", global_id);
int start = global_id * offset;
int end = start + offset;
int i;
for(i=start; i<end; i++)
{
C[global_id] += A[i];
}
}