dw_spmv.c 8.2 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341
  1. /*
  2. * StarPU
  3. * Copyright (C) INRIA 2008-2009 (see AUTHORS file)
  4. *
  5. * This program 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. * This program 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. /*
  17. * Conjugate gradients for Sparse matrices
  18. */
  19. #include "dw_spmv.h"
  20. #ifdef STARPU_USE_CUDA
  21. extern void spmv_kernel_cuda(void *descr[], void *args);
  22. #endif
  23. struct timeval start;
  24. struct timeval end;
  25. #ifdef STARPU_USE_OPENCL
  26. #include "starpu_opencl.h"
  27. struct starpu_opencl_program opencl_codelet;
  28. void spmv_kernel_opencl(void *descr[], void *args)
  29. {
  30. cl_kernel kernel;
  31. cl_command_queue queue;
  32. int id, devid, err, n;
  33. uint32_t nnz = STARPU_GET_CSR_NNZ(descr[0]);
  34. uint32_t nrow = STARPU_GET_CSR_NROW(descr[0]);
  35. float *nzval = (float *)STARPU_GET_CSR_NZVAL(descr[0]);
  36. uint32_t *colind = STARPU_GET_CSR_COLIND(descr[0]);
  37. uint32_t *rowptr = STARPU_GET_CSR_ROWPTR(descr[0]);
  38. uint32_t firstentry = STARPU_GET_CSR_FIRSTENTRY(descr[0]);
  39. float *vecin = (float *)STARPU_GET_VECTOR_PTR(descr[1]);
  40. uint32_t nx_in = STARPU_GET_VECTOR_NX(descr[1]);
  41. float *vecout = (float *)STARPU_GET_VECTOR_PTR(descr[2]);
  42. uint32_t nx_out = STARPU_GET_VECTOR_NX(descr[2]);
  43. id = starpu_worker_get_id();
  44. devid = starpu_worker_get_devid(id);
  45. err = starpu_opencl_load_kernel(&kernel, &queue, &opencl_codelet, "spvm", devid);
  46. if (err != CL_SUCCESS) STARPU_OPENCL_REPORT_ERROR(err);
  47. err = 0;
  48. n=0;
  49. err = clSetKernelArg(kernel, n++, sizeof(uint32_t), &nnz);
  50. err = clSetKernelArg(kernel, n++, sizeof(uint32_t), &nrow);
  51. err = clSetKernelArg(kernel, n++, sizeof(cl_mem), &nzval);
  52. err = clSetKernelArg(kernel, n++, sizeof(cl_mem), &colind);
  53. err = clSetKernelArg(kernel, n++, sizeof(cl_mem), &rowptr);
  54. err = clSetKernelArg(kernel, n++, sizeof(uint32_t), &firstentry);
  55. err = clSetKernelArg(kernel, n++, sizeof(cl_mem), &vecin);
  56. err = clSetKernelArg(kernel, n++, sizeof(uint32_t), &nx_in);
  57. err = clSetKernelArg(kernel, n++, sizeof(cl_mem), &vecout);
  58. err = clSetKernelArg(kernel, n++, sizeof(uint32_t), &nx_out);
  59. if (err) STARPU_OPENCL_REPORT_ERROR(err);
  60. {
  61. size_t global=1024;
  62. err = clEnqueueNDRangeKernel(queue, kernel, 1, NULL, &global, NULL, 0, NULL, NULL);
  63. if (err != CL_SUCCESS) STARPU_OPENCL_REPORT_ERROR(err);
  64. }
  65. clFinish(queue);
  66. starpu_opencl_release_kernel(kernel);
  67. }
  68. #endif
  69. unsigned nblocks = 2;
  70. uint32_t size = 4194304;
  71. starpu_data_handle sparse_matrix;
  72. starpu_data_handle vector_in, vector_out;
  73. float *sparse_matrix_nzval;
  74. uint32_t *sparse_matrix_colind;
  75. uint32_t *sparse_matrix_rowptr;
  76. float *vector_in_ptr;
  77. float *vector_out_ptr;
  78. static void parse_args(int argc, char **argv)
  79. {
  80. int i;
  81. for (i = 1; i < argc; i++) {
  82. if (strcmp(argv[i], "-size") == 0) {
  83. char *argptr;
  84. size = strtol(argv[++i], &argptr, 10);
  85. }
  86. if (strcmp(argv[i], "-nblocks") == 0) {
  87. char *argptr;
  88. nblocks = strtol(argv[++i], &argptr, 10);
  89. }
  90. }
  91. }
  92. static void cpu_spmv(void *descr[], __attribute__((unused)) void *arg)
  93. {
  94. float *nzval = (float *)STARPU_GET_CSR_NZVAL(descr[0]);
  95. uint32_t *colind = STARPU_GET_CSR_COLIND(descr[0]);
  96. uint32_t *rowptr = STARPU_GET_CSR_ROWPTR(descr[0]);
  97. float *vecin = (float *)STARPU_GET_VECTOR_PTR(descr[1]);
  98. float *vecout = (float *)STARPU_GET_VECTOR_PTR(descr[2]);
  99. uint32_t firstelem = STARPU_GET_CSR_FIRSTENTRY(descr[0]);
  100. uint32_t nnz;
  101. uint32_t nrow;
  102. nnz = STARPU_GET_CSR_NNZ(descr[0]);
  103. nrow = STARPU_GET_CSR_NROW(descr[0]);
  104. //STARPU_ASSERT(nrow == STARPU_GET_VECTOR_NX(descr[1]));
  105. STARPU_ASSERT(nrow == STARPU_GET_VECTOR_NX(descr[2]));
  106. unsigned row;
  107. for (row = 0; row < nrow; row++)
  108. {
  109. float tmp = 0.0f;
  110. unsigned index;
  111. unsigned firstindex = rowptr[row] - firstelem;
  112. unsigned lastindex = rowptr[row+1] - firstelem;
  113. for (index = firstindex; index < lastindex; index++)
  114. {
  115. unsigned col;
  116. col = colind[index];
  117. tmp += nzval[index]*vecin[col];
  118. }
  119. vecout[row] = tmp;
  120. }
  121. }
  122. static void create_data(void)
  123. {
  124. /* we need a sparse symetric (definite positive ?) matrix and a "dense" vector */
  125. /* example of 3-band matrix */
  126. float *nzval;
  127. uint32_t nnz;
  128. uint32_t *colind;
  129. uint32_t *rowptr;
  130. nnz = 3*size-2;
  131. nzval = malloc(nnz*sizeof(float));
  132. colind = malloc(nnz*sizeof(uint32_t));
  133. rowptr = malloc((size+1)*sizeof(uint32_t));
  134. assert(nzval);
  135. assert(colind);
  136. assert(rowptr);
  137. /* fill the matrix */
  138. unsigned row;
  139. unsigned pos = 0;
  140. for (row = 0; row < size; row++)
  141. {
  142. rowptr[row] = pos;
  143. if (row > 0) {
  144. nzval[pos] = 1.0f;
  145. colind[pos] = row-1;
  146. pos++;
  147. }
  148. nzval[pos] = 5.0f;
  149. colind[pos] = row;
  150. pos++;
  151. if (row < size - 1) {
  152. nzval[pos] = 1.0f;
  153. colind[pos] = row+1;
  154. pos++;
  155. }
  156. }
  157. STARPU_ASSERT(pos == nnz);
  158. rowptr[size] = nnz;
  159. starpu_csr_data_register(&sparse_matrix, 0, nnz, size, (uintptr_t)nzval, colind, rowptr, 0, sizeof(float));
  160. sparse_matrix_nzval = nzval;
  161. sparse_matrix_colind = colind;
  162. sparse_matrix_rowptr = rowptr;
  163. /* initiate the 2 vectors */
  164. float *invec, *outvec;
  165. invec = malloc(size*sizeof(float));
  166. assert(invec);
  167. outvec = malloc(size*sizeof(float));
  168. assert(outvec);
  169. /* fill those */
  170. unsigned ind;
  171. for (ind = 0; ind < size; ind++)
  172. {
  173. invec[ind] = 2.0f;
  174. outvec[ind] = 0.0f;
  175. }
  176. starpu_vector_data_register(&vector_in, 0, (uintptr_t)invec, size, sizeof(float));
  177. starpu_vector_data_register(&vector_out, 0, (uintptr_t)outvec, size, sizeof(float));
  178. vector_in_ptr = invec;
  179. vector_out_ptr = outvec;
  180. }
  181. void call_spmv_codelet_filters(void)
  182. {
  183. /* partition the data along a block distribution */
  184. starpu_filter csr_f, vector_f;
  185. csr_f.filter_func = starpu_vertical_block_filter_func_csr;
  186. csr_f.filter_arg = nblocks;
  187. vector_f.filter_func = starpu_block_filter_func_vector;
  188. vector_f.filter_arg = nblocks;
  189. starpu_data_partition(sparse_matrix, &csr_f);
  190. starpu_data_partition(vector_out, &vector_f);
  191. #ifdef STARPU_USE_OPENCL
  192. {
  193. int ret = starpu_opencl_load_opencl_from_file("examples/spmv/spmv_opencl.cl", &opencl_codelet);
  194. if (ret)
  195. {
  196. fprintf(stderr, "Failed to compile OpenCL codelet\n");
  197. exit(ret);
  198. }
  199. }
  200. #endif
  201. starpu_codelet cl;
  202. memset(&cl, 0, sizeof(starpu_codelet));
  203. cl.where = STARPU_CPU|STARPU_CUDA|STARPU_OPENCL;
  204. cl.cpu_func = cpu_spmv;
  205. #ifdef STARPU_USE_CUDA
  206. cl.cuda_func = spmv_kernel_cuda;
  207. #endif
  208. #ifdef STARPU_USE_OPENCL
  209. cl.opencl_func = spmv_kernel_opencl;
  210. #endif
  211. cl.nbuffers = 3;
  212. cl.model = NULL;
  213. gettimeofday(&start, NULL);
  214. unsigned part;
  215. for (part = 0; part < nblocks; part++)
  216. {
  217. struct starpu_task *task = starpu_task_create();
  218. int ret;
  219. task->callback_func = NULL;
  220. task->cl = &cl;
  221. task->cl_arg = NULL;
  222. task->buffers[0].handle = starpu_data_get_sub_data(sparse_matrix, 1, part);
  223. task->buffers[0].mode = STARPU_R;
  224. task->buffers[1].handle = vector_in;
  225. task->buffers[1].mode = STARPU_R;
  226. task->buffers[2].handle = starpu_data_get_sub_data(vector_out, 1, part);
  227. task->buffers[2].mode = STARPU_W;
  228. ret = starpu_task_submit(task);
  229. if (STARPU_UNLIKELY(ret == -ENODEV))
  230. {
  231. fprintf(stderr, "No worker may execute this task\n");
  232. exit(0);
  233. }
  234. }
  235. starpu_task_wait_for_all();
  236. gettimeofday(&end, NULL);
  237. starpu_data_unpartition(sparse_matrix, 0);
  238. starpu_data_unpartition(vector_out, 0);
  239. }
  240. static void print_results(void)
  241. {
  242. unsigned row;
  243. for (row = 0; row < STARPU_MIN(size, 16); row++)
  244. {
  245. printf("%2.2f\t%2.2f\n", vector_in_ptr[row], vector_out_ptr[row]);
  246. }
  247. }
  248. int main(__attribute__ ((unused)) int argc,
  249. __attribute__ ((unused)) char **argv)
  250. {
  251. parse_args(argc, argv);
  252. /* start the runtime */
  253. starpu_init(NULL);
  254. /* create the sparse input matrix */
  255. create_data();
  256. /* create a new codelet that will perform a SpMV on it */
  257. call_spmv_codelet_filters();
  258. starpu_shutdown();
  259. print_results();
  260. double timing = (double)((end.tv_sec - start.tv_sec)*1000000 + (end.tv_usec - start.tv_usec));
  261. fprintf(stderr, "Computation took (in ms)\n");
  262. printf("%2.2f\n", timing/1000);
  263. return 0;
  264. }