/* * spGPU - Sparse matrices on GPU library. * * Copyright (C) 2010 - 2012 * Davide Barbieri - University of Rome Tor Vergata * * This program is free software; you can redistribute it and/or * modify it under the terms of the GNU General Public License * version 3 as published by the Free Software Foundation. * * This program is distributed in the hope that it will be useful, * but WITHOUT ANY WARRANTY; without even the implied warranty of * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the * GNU General Public License for more details. */ #include "stdio.h" #include "cudalang.h" #include "cudadebug.h" #include "cuComplex.h" extern "C" { #include "core.h" #include "vector.h" } //#define USE_CUBLAS #define BLOCK_SIZE 512 //#define ASSUME_LOCK_SYNC_PARALLELISM static __device__ cuDoubleComplex ddotReductionResult[128]; __global__ void spgpuZdot_kern(int n, cuDoubleComplex* x, cuDoubleComplex* y) { __shared__ cuDoubleComplex sSum[BLOCK_SIZE]; cuDoubleComplex res = make_cuDoubleComplex(0.0, 0.0); cuDoubleComplex* lastX = x + n; x += threadIdx.x + blockIdx.x*BLOCK_SIZE; y += threadIdx.x + blockIdx.x*BLOCK_SIZE; int blockOffset = gridDim.x*BLOCK_SIZE; while (x < lastX) { res = cuCfma(x[0], y[0], res); x += blockOffset; y += blockOffset; } if (threadIdx.x >= 32) sSum[threadIdx.x] = res; __syncthreads(); // Start reduction! if (threadIdx.x < 32) { for (int i=1; imultiProcessorCount, (n+BLOCK_SIZE-1)/BLOCK_SIZE)); #endif cuDoubleComplex tRes[128]; spgpuZdot_kern<<currentStream>>>(n, a, b); cudaMemcpyFromSymbol(tRes, ddotReductionResult,blocks*sizeof(cuDoubleComplex)); for (int i=0; i