life_opencl.c 4.1 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119
  1. /* StarPU --- Runtime system for heterogeneous multicore architectures.
  2. *
  3. * Copyright (C) 2010 Université de Bordeaux 1
  4. *
  5. * StarPU is free software; you can redistribute it and/or modify
  6. * it under the terms of the GNU Lesser General Public License as published by
  7. * the Free Software Foundation; either version 2.1 of the License, or (at
  8. * your option) any later version.
  9. *
  10. * StarPU is distributed in the hope that it will be useful, but
  11. * WITHOUT ANY WARRANTY; without even the implied warranty of
  12. * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.
  13. *
  14. * See the GNU Lesser General Public License in COPYING.LGPL for more details.
  15. */
  16. /* Heart of the stencil computation: compute a new state from an old one. */
  17. /* #define _externC extern "C" */
  18. #include <stencil.h>
  19. #include <CL/cl.h>
  20. #include <starpu.h>
  21. #include <starpu_opencl.h>
  22. #define str(x) #x
  23. #define clsrc(t,k) "__kernel void\n\
  24. #define TYPE " str(t) "\n\
  25. #define K " str(k) "\n\
  26. life_update(int bz, __global const TYPE *old, __global TYPE *newp, int nx, int ny, int nz, int ldy, int ldz, int iter)\n\
  27. {\n\
  28. unsigned idx = get_global_id(0);\n\
  29. unsigned idy = get_global_id(1);\n\
  30. //unsigned idz = threadIdx.z + blockIdx.z * blockDim.z;\n\
  31. unsigned idz = 0;\n\
  32. unsigned stepx = get_global_size(0);\n\
  33. unsigned stepy = get_global_size(1);\n\
  34. //unsigned stepz = blockDim.z * gridDim.z;\n\
  35. unsigned stepz = 1;\n\
  36. unsigned x, y, z;\n\
  37. unsigned num, alive;\n\
  38. \n\
  39. for (z = iter + idz; z < nz - iter; z += stepz)\n\
  40. for (y = K + idy; y < ny - K; y += stepy) {\n\
  41. for (x = K + idx; x < nx - K; x += stepx) {\n\
  42. unsigned index = x + y*ldy + z*ldz;\n\
  43. num = 0\n\
  44. + old[index+1*ldy+0*ldz]\n\
  45. + old[index+1*ldy+1*ldz]\n\
  46. + old[index+0*ldy+1*ldz]\n\
  47. + old[index-1*ldy+1*ldz]\n\
  48. + old[index-1*ldy+0*ldz]\n\
  49. + old[index-1*ldy-1*ldz]\n\
  50. + old[index+0*ldy-1*ldz]\n\
  51. + old[index+1*ldy-1*ldz]\n\
  52. ;\n\
  53. alive = old[index];\n\
  54. alive = (alive && num == 2) || num == 3;\n\
  55. newp[index] = alive;\n\
  56. }\n\
  57. }\n\
  58. }"
  59. static const char * src = clsrc(TYPE,K);
  60. static struct starpu_opencl_program program;
  61. void
  62. opencl_life_init(void) {
  63. starpu_opencl_load_opencl_from_string(src, &program);
  64. }
  65. void opencl_life_free(void) {
  66. starpu_opencl_unload_opencl(&program);
  67. }
  68. void
  69. opencl_life_update_host(int bz, const TYPE *old, TYPE *newp, int nx, int ny, int nz, int ldy, int ldz, int iter)
  70. {
  71. unsigned max_parallelism = 512;
  72. unsigned threads_per_dim_x = max_parallelism;
  73. while (threads_per_dim_x / 2 >= nx)
  74. threads_per_dim_x /= 2;
  75. unsigned threads_per_dim_y = max_parallelism / threads_per_dim_x;
  76. while (threads_per_dim_y / 2 >= ny)
  77. threads_per_dim_y /= 2;
  78. #if 0
  79. unsigned threads_per_dim_z = 4;
  80. size_t dimBlock[] = {threads_per_dim_x, threads_per_dim_y, threads_per_dim_z};
  81. size_t dimGrid[] = {nx / threads_per_dim_x, ny / threads_per_dim_y, nz / threads_per_dim_z};
  82. #else
  83. size_t dimBlock[] = {threads_per_dim_x, threads_per_dim_y, 1};
  84. size_t dimGrid[] = {((nx + threads_per_dim_x-1) / threads_per_dim_x)*threads_per_dim_x, ((ny + threads_per_dim_y-1) / threads_per_dim_y)*threads_per_dim_y, 1};
  85. #endif
  86. int devid,id;
  87. id = starpu_worker_get_id();
  88. devid = starpu_worker_get_devid(id);
  89. cl_kernel kernel;
  90. cl_command_queue cq;
  91. starpu_opencl_load_kernel(&kernel, &cq, &program, "life_update", devid);
  92. clSetKernelArg(kernel, 0, sizeof(bz), &bz);
  93. clSetKernelArg(kernel, 1, sizeof(old), &old);
  94. clSetKernelArg(kernel, 2, sizeof(newp), &newp);
  95. clSetKernelArg(kernel, 3, sizeof(nx), &nx);
  96. clSetKernelArg(kernel, 4, sizeof(ny), &ny);
  97. clSetKernelArg(kernel, 5, sizeof(nz), &nz);
  98. clSetKernelArg(kernel, 6, sizeof(ldy), &ldy);
  99. clSetKernelArg(kernel, 7, sizeof(ldz), &ldz);
  100. clSetKernelArg(kernel, 8, sizeof(iter), &iter);
  101. cl_event ev;
  102. clEnqueueNDRangeKernel(cq, kernel, 3, NULL, dimGrid, dimBlock, 0, NULL, &ev);
  103. clWaitForEvents(1, &ev);
  104. clReleaseEvent(ev);
  105. }