spmv.c 6.8 KB

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