规约算法.求内积

0.引言

有的地方也称之为归约算法.
内积：$d=⟨x,y⟩$

$${\mathrm{v}}_1=\left({\mathrm{a}}_1,{\mathrm{a}}_2,{\mathrm{a}}_3,\dots ,{\mathrm{a}}_{\mathrm{n}}\right)$$$${\mathrm{v}}_2=\left({\mathrm{b}}_1,{\mathrm{b}}_2,{\mathrm{b}}_3,\dots ,{\mathrm{b}}_{\mathrm{n}}\right)$$$${\mathrm{v}}_1\cdot {\mathrm{v}}_2={\mathrm{a}}_1{\mathrm{b}}_1+{\mathrm{a}}_2{\mathrm{b}}_2+{\mathrm{a}}_3{\mathrm{b}}_3+\dots +{\mathrm{a}}_{\mathrm{n}}{\mathrm{b}}_{\mathrm{n}}$$类似可以类比内积思想求解的一些问题：

• 求和
• 乘积
• 逻辑运算, 例如 and, or, xor…
• 极值, 例如 max, min.

$$V=\left\{v_0=\left(\begin{array}{c}{e}_0^0\\ ⋮\\ e_0^{m-1}\end{array}\right),v_1=\left(\begin{array}{c}{e}_1^0\\ ⋮\\ e_1^{m-1}\end{array}\right),\dots ,v_{p-1}=\left(\begin{array}{c}{e}_{p-1}^0\\ ⋮\\ e_{p-1}^{m-1}\end{array}\right)\right\}$$$$r=\left(\begin{array}{c}{e}_0^0\oplus e_1^0\oplus \cdots \oplus e_{-1}^0\\ ⋮\\ e_0^{m-1}\oplus e_1^{m-1}\oplus \cdots \oplus e_{p-1}^{m-1}\end{array}\right)=\left(\begin{array}{c}{\oplus }_{10}^{p-1}{e}_i^0\\ ⋮\\ {\oplus }_{i=0}^{p-1}{e}_i^{m-1}\end{array}\right)$$

1.code

解析见注释：

/* dot product of two vectors: d =  */

#include "reduction_aux.h"
#include 

/* host, add 使用CPU只需要一个for循环就ok*/
FLOAT dot_host(FLOAT *x, FLOAT *y, int N)
{
    int i;
    FLOAT t = 0;

    assert(x != NULL);
    assert(y != NULL);

    for (i = 0; i < N; i++) t += x[i] * y[i];

    return t;
}

__device__ void warpReduce(volatile FLOAT *sdata, int tid)
{
    sdata[tid] += sdata[tid + 32];
    sdata[tid] += sdata[tid + 16];
    sdata[tid] += sdata[tid + 8];
    sdata[tid] += sdata[tid + 4];
    sdata[tid] += sdata[tid + 2];
    sdata[tid] += sdata[tid + 1];
}

/* partial dot product 注意这里没有求完，只是求解了一个block,256个线程*/
__global__ void dot_stg_1(const FLOAT *x, FLOAT *y, FLOAT *z, int N)
{
    __shared__ FLOAT sdata[256];
    /********************************************************************************
    get thread id: 1D block and 2D grid ，blockDim.x 内置变量 
    #define get_tid() (blockDim.x * (blockIdx.x + blockIdx.y * gridDim.x) + threadIdx.x)  //获取全局的线程ID
    get block id: 2D grid 
    #define get_bid() (blockIdx.x + blockIdx.y * gridDim.x) //获取block在Grid中的ID
    ********************************************************************************/
    int idx = get_tid();//idx为0～N-1
    int tid = threadIdx.x;//threaIdx指明线程所在block中的位置，tid为0~255
    int bid = get_bid();//block指明在Grid中的ID，bid为0~198**198即是grid的大小（注意是二维）

    /* load data to shared mem 加载数据并将乘积的结果保存至共享内存中*/
    if (idx < N) {
        sdata[tid] = x[idx] * y[idx];
    }
    else {
        sdata[tid] = 0;//开辟的线程实际上是大于N的，可以尝试一下注释掉这句，结果肯定是乱码.
    }

    __syncthreads();

    /* reduction using shared mem 然后使用规约算法将乘积的结果累加起来*/
    if (tid < 128) sdata[tid] += sdata[tid + 128];
    __syncthreads();

    if (tid < 64) sdata[tid] += sdata[tid + 64];
    __syncthreads();

    if (tid < 32) warpReduce(sdata, tid);

    if (tid == 0) z[bid] = sdata[0];
}

/* sum all entries in x and asign to y
 * block dim must be 256 */
__global__ void dot_stg_2(const FLOAT *x, FLOAT *y, int N)
{
    __shared__ FLOAT sdata[256];
    int idx = get_tid();
    int tid = threadIdx.x;
    int bid = get_bid();

    /* load data to shared mem */
    if (idx < N) {
        sdata[tid] = x[idx];
    }
    else {
        sdata[tid] = 0;
    }

    __syncthreads();

    /* reduction using shared mem */
    if (tid < 128) sdata[tid] += sdata[tid + 128];
    __syncthreads();

    if (tid < 64) sdata[tid] += sdata[tid + 64];
    __syncthreads();

    if (tid < 32) warpReduce(sdata, tid);

    if (tid == 0) y[bid] = sdata[0];
}

__global__ void dot_stg_3(FLOAT *x, int N)
{
    __shared__ FLOAT sdata[128];
    int tid = threadIdx.x;
    int i;

    sdata[tid] = 0;

    /* load data to shared mem */
    for (i = 0; i < N; i += 128) {
        if (tid + i < N) sdata[tid] += x[i + tid];
    }

    __syncthreads();

    /* reduction using shared mem */
    if (tid < 64) sdata[tid] = sdata[tid] + sdata[tid + 64];
    __syncthreads();

    if (tid < 32) warpReduce(sdata, tid);

    if (tid == 0) x[0] = sdata[0];
}

/* dz and d serve as cache: result stores in d[0] */
void dot_device(FLOAT *dx, FLOAT *dy, FLOAT *dz, FLOAT *d, int N)
{
    /* 1D block */
    int bs = 256;

    /* 2D grid */
    int s = ceil(sqrt((N + bs - 1.) / bs));
    dim3 grid = dim3(s, s);
    int gs = 0;

    /* stage 1 */
    dot_stg_1<<<grid, bs>>>(dx, dy, dz, N);

    /* stage 2 */
    {
        /* 1D grid */
        int N2 = (N + bs - 1) / bs;

        int s2 = ceil(sqrt((N2 + bs - 1.) / bs));
        dim3 grid2 = dim3(s2, s2);

        dot_stg_2<<<grid2, bs>>>(dz, d, N2);

        /* record gs */
        gs = (N2 + bs - 1.) / bs;
    }

    /* stage 3 */
    dot_stg_3<<<1, 128>>>(d, gs);
}

int main(int argc, char **argv)
{
    int N = 10000070;
    int nbytes = N * sizeof(FLOAT);

    FLOAT *hx = NULL, *hy = NULL;
    FLOAT *dx = NULL, *dy = NULL, *dz = NULL, *d = NULL;
    int i, itr = 20;
    FLOAT asd = 0, ash;
    double td, th;

    if (argc == 2) {
        int an;

        an = atoi(argv[1]);
        if (an > 0) N = an;
    }

    /*************** allocate GPU mem ***************/
    cudaMalloc((void **)&dx, nbytes);
    cudaMalloc((void **)&dy, nbytes);
    cudaMalloc((void **)&dz, sizeof(FLOAT) * ((N + 255) / 256));//块大小
    cudaMalloc((void **)&d, sizeof(FLOAT) * ((N + 255) / 256));
    if (dx == NULL || dy == NULL || dz == NULL || d == NULL) {
        printf("couldn't allocate GPU memory\n");
        return -1;
    }
    printf("allocated %e MB on GPU\n", nbytes / (1024.f * 1024.f));



    /***************alllocate CPU mem ***************/
    hx = (FLOAT *) malloc(nbytes);
    hy = (FLOAT *) malloc(nbytes);
    if (hx == NULL || hy == NULL) {
        printf("couldn't allocate CPU memory\n");
        return -2;
    }
    printf("allocated %e MB on CPU\n", nbytes / (1024.f * 1024.f));
    /* init */
    for (i = 0; i < N; i++) {
        hx[i] = 1;
        hy[i] = 2;
    }

    /*************** copy data to GPU ***************/
    cudaMemcpy(dx, hx, nbytes, cudaMemcpyHostToDevice);
    cudaMemcpy(dy, hy, nbytes, cudaMemcpyHostToDevice);
    /*************** let dust fall ***************/
    cudaThreadSynchronize();



    td = get_time();
    /*************** call GPU ***************/
    for (i = 0; i < itr; i++) dot_device(dx, dy, dz, d, N);//为什么是循环20次？？
    /*************** let GPU finish ***************/
    cudaThreadSynchronize();
    td = get_time() - td;




    /*************** CPU计算 ***************/
    th = get_time();
    for (i = 0; i < itr; i++) ash = dot_host(hx, hy, N);
    th = get_time() - th;

    /*************** copy data from GPU ***************/
    cudaMemcpy(&asd, d, sizeof(FLOAT), cudaMemcpyDeviceToHost);
    printf("dot, answer: %d, calculated by GPU:%f, calculated by CPU:%f\n", 2 * N, asd, ash);
    printf("GPU time: %e, CPU time: %e, speedup: %g\n", td, th, th / td);



    cudaFree(dx);
    cudaFree(dy);
    cudaFree(dz);
    cudaFree(d);
    free(hx);
    free(hy);

    return 0;
}

总体思想分为三个阶段：

1. 块大小, 256: 数组长度降低256倍： 大规模数组依旧很长, 例如 256万降低到1万；
2. 对部分和继续使用上一步的算法；
3. 使用一个块, 将最后结果规约；

如草稿纸：

2.result

测试：注释掉那一句

    /* load data to shared mem 加载数据并将乘积的结果保存至共享内存中*/
    if (idx < N) {
        sdata[tid] = x[idx] * y[idx];
    }
    else {
        //sdata[tid] = 0;//开辟的线程实际上是大于N的，可以尝试一下注释掉这句，结果肯定是乱码.
    }

猜测是乱码，竟然不是乱码，但是结果也是错误的，按照块的执行，多开的线程依然在执行，所以必须将其他没用到的线程里面的值设置为0，不然会导致结果错误！