spmv.c 6.9 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283
  1. /* StarPU --- Runtime system for heterogeneous multicore architectures.
  2. *
  3. * Copyright (C) 2009, 2010, 2011, 2013-2015 Université de Bordeaux
  4. * Copyright (C) 2010 Mehdi Juhoor <mjuhoor@gmail.com>
  5. * Copyright (C) 2010, 2011, 2012 CNRS
  6. *
  7. * StarPU is free software; you can redistribute it and/or modify
  8. * it under the terms of the GNU Lesser General Public License as published by
  9. * the Free Software Foundation; either version 2.1 of the License, or (at
  10. * your option) any later version.
  11. *
  12. * StarPU is distributed in the hope that it will be useful, but
  13. * WITHOUT ANY WARRANTY; without even the implied warranty of
  14. * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.
  15. *
  16. * See the GNU Lesser General Public License in COPYING.LGPL for more details.
  17. */
  18. /*
  19. * This computes an SPMV with a CSR sparse matrix, by splitting it in
  20. * horizontal stripes and processing them in parallel.
  21. */
  22. #include "spmv.h"
  23. unsigned nblocks = 4;
  24. uint32_t size = 4*1024*1024;
  25. starpu_data_handle_t sparse_matrix;
  26. starpu_data_handle_t vector_in, vector_out;
  27. static void parse_args(int argc, char **argv)
  28. {
  29. int i;
  30. for (i = 1; i < argc; i++)
  31. {
  32. if (strcmp(argv[i], "-size") == 0)
  33. {
  34. char *argptr;
  35. size = strtol(argv[++i], &argptr, 10);
  36. }
  37. if (strcmp(argv[i], "-nblocks") == 0)
  38. {
  39. char *argptr;
  40. nblocks = strtol(argv[++i], &argptr, 10);
  41. }
  42. }
  43. }
  44. /* This filter function takes a CSR matrix, and divides it into nparts with the
  45. * same number of rows. */
  46. static void csr_filter_func(void *father_interface, void *child_interface, struct starpu_data_filter *f, unsigned id, unsigned nparts)
  47. {
  48. struct starpu_csr_interface *csr_father = (struct starpu_csr_interface *) father_interface;
  49. struct starpu_csr_interface *csr_child = (struct starpu_csr_interface *) child_interface;
  50. uint32_t nrow = csr_father->nrow;
  51. size_t elemsize = csr_father->elemsize;
  52. uint32_t firstentry = csr_father->firstentry;
  53. /* Every sub-parts should contain the same number of non-zero entries */
  54. uint32_t chunk_size = (nrow + nparts - 1)/nparts;
  55. uint32_t *rowptr = csr_father->rowptr;
  56. uint32_t first_index = id*chunk_size - firstentry;
  57. uint32_t local_firstentry = rowptr[first_index];
  58. uint32_t child_nrow = STARPU_MIN(chunk_size, nrow - id*chunk_size);
  59. uint32_t local_nnz = rowptr[first_index + child_nrow] - rowptr[first_index];
  60. csr_child->nnz = local_nnz;
  61. csr_child->nrow = child_nrow;
  62. csr_child->firstentry = local_firstentry;
  63. csr_child->elemsize = elemsize;
  64. if (csr_father->nzval)
  65. {
  66. csr_child->rowptr = &csr_father->rowptr[first_index];
  67. csr_child->colind = &csr_father->colind[local_firstentry];
  68. csr_child->nzval = csr_father->nzval + local_firstentry * elemsize;
  69. }
  70. }
  71. /* partition the CSR matrix along a block distribution */
  72. static struct starpu_data_filter csr_f =
  73. {
  74. .filter_func = csr_filter_func,
  75. /* This value is defined later on */
  76. .nchildren = -1,
  77. /* the children also use a csr interface */
  78. };
  79. static struct starpu_data_filter vector_f =
  80. {
  81. .filter_func = starpu_vector_filter_block,
  82. /* This value is defined later on */
  83. .nchildren = -1,
  84. };
  85. static struct starpu_codelet spmv_cl =
  86. {
  87. .cpu_funcs = {spmv_kernel_cpu},
  88. #ifdef STARPU_USE_CUDA
  89. .cuda_funcs = {spmv_kernel_cuda},
  90. .cuda_flags = {STARPU_CUDA_ASYNC},
  91. #endif
  92. #ifdef STARPU_USE_OPENCL
  93. .opencl_funcs = {spmv_kernel_opencl},
  94. .opencl_flags = {STARPU_OPENCL_ASYNC},
  95. #endif
  96. .nbuffers = 3,
  97. .modes = {STARPU_R, STARPU_R, STARPU_W},
  98. .model = NULL,
  99. .name = "spmv"
  100. };
  101. int main(int argc, char **argv)
  102. {
  103. int ret;
  104. unsigned part;
  105. double timing;
  106. double start, end;
  107. unsigned row, pos;
  108. unsigned ind;
  109. /* CSR matrix description */
  110. float *nzval;
  111. uint32_t nnz;
  112. uint32_t *colind;
  113. uint32_t *rowptr;
  114. /* Input and Output vectors */
  115. float *vector_in_ptr;
  116. float *vector_out_ptr;
  117. /*
  118. * Parse command-line arguments
  119. */
  120. parse_args(argc, argv);
  121. /*
  122. * Launch StarPU
  123. */
  124. ret = starpu_init(NULL);
  125. if (ret == -ENODEV)
  126. return 77;
  127. STARPU_CHECK_RETURN_VALUE(ret, "starpu_init");
  128. /*
  129. * Create a 3-band sparse matrix as input example
  130. */
  131. nnz = 3*size-2;
  132. starpu_malloc((void **)&nzval, nnz*sizeof(float));
  133. starpu_malloc((void **)&colind, nnz*sizeof(uint32_t));
  134. starpu_malloc((void **)&rowptr, (size+1)*sizeof(uint32_t));
  135. assert(nzval && colind && rowptr);
  136. /* fill the matrix */
  137. for (row = 0, pos = 0; row < size; row++)
  138. {
  139. rowptr[row] = pos;
  140. if (row > 0)
  141. {
  142. nzval[pos] = 1.0f;
  143. colind[pos] = row-1;
  144. pos++;
  145. }
  146. nzval[pos] = 5.0f;
  147. colind[pos] = row;
  148. pos++;
  149. if (row < size - 1)
  150. {
  151. nzval[pos] = 1.0f;
  152. colind[pos] = row+1;
  153. pos++;
  154. }
  155. }
  156. STARPU_ASSERT(pos == nnz);
  157. rowptr[size] = nnz;
  158. /* initiate the 2 vectors */
  159. starpu_malloc((void **)&vector_in_ptr, size*sizeof(float));
  160. starpu_malloc((void **)&vector_out_ptr, size*sizeof(float));
  161. assert(vector_in_ptr && vector_out_ptr);
  162. /* fill them */
  163. for (ind = 0; ind < size; ind++)
  164. {
  165. vector_in_ptr[ind] = 2.0f;
  166. vector_out_ptr[ind] = 0.0f;
  167. }
  168. /*
  169. * Register the CSR matrix and the 2 vectors
  170. */
  171. starpu_csr_data_register(&sparse_matrix, STARPU_MAIN_RAM, nnz, size, (uintptr_t)nzval, colind, rowptr, 0, sizeof(float));
  172. starpu_vector_data_register(&vector_in, STARPU_MAIN_RAM, (uintptr_t)vector_in_ptr, size, sizeof(float));
  173. starpu_vector_data_register(&vector_out, STARPU_MAIN_RAM, (uintptr_t)vector_out_ptr, size, sizeof(float));
  174. /*
  175. * Partition the CSR matrix and the output vector
  176. */
  177. csr_f.nchildren = nblocks;
  178. vector_f.nchildren = nblocks;
  179. starpu_data_partition(sparse_matrix, &csr_f);
  180. starpu_data_partition(vector_out, &vector_f);
  181. /*
  182. * If we use OpenCL, we need to compile the SpMV kernel
  183. */
  184. #ifdef STARPU_USE_OPENCL
  185. compile_spmv_opencl_kernel();
  186. #endif
  187. start = starpu_timing_now();
  188. /*
  189. * Create and submit StarPU tasks
  190. */
  191. for (part = 0; part < nblocks; part++)
  192. {
  193. struct starpu_task *task = starpu_task_create();
  194. task->cl = &spmv_cl;
  195. task->handles[0] = starpu_data_get_sub_data(sparse_matrix, 1, part);
  196. task->handles[1] = vector_in;
  197. task->handles[2] = starpu_data_get_sub_data(vector_out, 1, part);
  198. ret = starpu_task_submit(task);
  199. if (STARPU_UNLIKELY(ret == -ENODEV))
  200. {
  201. FPRINTF(stderr, "No worker may execute this task\n");
  202. exit(0);
  203. }
  204. }
  205. starpu_task_wait_for_all();
  206. end = starpu_timing_now();
  207. /*
  208. * Unregister the CSR matrix and the output vector
  209. */
  210. starpu_data_unpartition(sparse_matrix, STARPU_MAIN_RAM);
  211. starpu_data_unpartition(vector_out, STARPU_MAIN_RAM);
  212. /*
  213. * Unregister data
  214. */
  215. starpu_data_unregister(sparse_matrix);
  216. starpu_data_unregister(vector_in);
  217. starpu_data_unregister(vector_out);
  218. /*
  219. * Display the result
  220. */
  221. for (row = 0; row < STARPU_MIN(size, 16); row++)
  222. {
  223. FPRINTF(stdout, "%2.2f\t%2.2f\n", vector_in_ptr[row], vector_out_ptr[row]);
  224. }
  225. starpu_free(nzval);
  226. starpu_free(colind);
  227. starpu_free(rowptr);
  228. starpu_free(vector_in_ptr);
  229. starpu_free(vector_out_ptr);
  230. /*
  231. * Stop StarPU
  232. */
  233. starpu_shutdown();
  234. timing = end - start;
  235. FPRINTF(stderr, "Computation took (in ms)\n");
  236. FPRINTF(stdout, "%2.2f\n", timing/1000);
  237. return 0;
  238. }