spmv.c 6.8 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277
  1. /* StarPU --- Runtime system for heterogeneous multicore architectures.
  2. *
  3. * Copyright (C) 2009, 2010, 2011, 2013 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. #endif
  87. #ifdef STARPU_USE_OPENCL
  88. .opencl_funcs = {spmv_kernel_opencl, NULL},
  89. #endif
  90. .nbuffers = 3,
  91. .modes = {STARPU_R, STARPU_R, STARPU_W},
  92. .model = NULL,
  93. .name = "spmv"
  94. };
  95. int main(int argc, char **argv)
  96. {
  97. int ret;
  98. unsigned part;
  99. double timing;
  100. struct timeval start, end;
  101. unsigned row, pos;
  102. unsigned ind;
  103. /* CSR matrix description */
  104. float *nzval;
  105. uint32_t nnz;
  106. uint32_t *colind;
  107. uint32_t *rowptr;
  108. /* Input and Output vectors */
  109. float *vector_in_ptr;
  110. float *vector_out_ptr;
  111. /*
  112. * Parse command-line arguments
  113. */
  114. parse_args(argc, argv);
  115. /*
  116. * Launch StarPU
  117. */
  118. ret = starpu_init(NULL);
  119. if (ret == -ENODEV)
  120. return 77;
  121. STARPU_CHECK_RETURN_VALUE(ret, "starpu_init");
  122. /*
  123. * Create a 3-band sparse matrix as input example
  124. */
  125. nnz = 3*size-2;
  126. starpu_malloc((void **)&nzval, nnz*sizeof(float));
  127. starpu_malloc((void **)&colind, nnz*sizeof(uint32_t));
  128. starpu_malloc((void **)&rowptr, (size+1)*sizeof(uint32_t));
  129. assert(nzval && colind && rowptr);
  130. /* fill the matrix */
  131. for (row = 0, pos = 0; row < size; row++)
  132. {
  133. rowptr[row] = pos;
  134. if (row > 0)
  135. {
  136. nzval[pos] = 1.0f;
  137. colind[pos] = row-1;
  138. pos++;
  139. }
  140. nzval[pos] = 5.0f;
  141. colind[pos] = row;
  142. pos++;
  143. if (row < size - 1)
  144. {
  145. nzval[pos] = 1.0f;
  146. colind[pos] = row+1;
  147. pos++;
  148. }
  149. }
  150. STARPU_ASSERT(pos == nnz);
  151. rowptr[size] = nnz;
  152. /* initiate the 2 vectors */
  153. starpu_malloc((void **)&vector_in_ptr, size*sizeof(float));
  154. starpu_malloc((void **)&vector_out_ptr, size*sizeof(float));
  155. assert(vector_in_ptr && vector_out_ptr);
  156. /* fill them */
  157. for (ind = 0; ind < size; ind++)
  158. {
  159. vector_in_ptr[ind] = 2.0f;
  160. vector_out_ptr[ind] = 0.0f;
  161. }
  162. /*
  163. * Register the CSR matrix and the 2 vectors
  164. */
  165. starpu_csr_data_register(&sparse_matrix, 0, nnz, size, (uintptr_t)nzval, colind, rowptr, 0, sizeof(float));
  166. starpu_vector_data_register(&vector_in, 0, (uintptr_t)vector_in_ptr, size, sizeof(float));
  167. starpu_vector_data_register(&vector_out, 0, (uintptr_t)vector_out_ptr, size, sizeof(float));
  168. /*
  169. * Partition the CSR matrix and the output vector
  170. */
  171. csr_f.nchildren = nblocks;
  172. vector_f.nchildren = nblocks;
  173. starpu_data_partition(sparse_matrix, &csr_f);
  174. starpu_data_partition(vector_out, &vector_f);
  175. /*
  176. * If we use OpenCL, we need to compile the SpMV kernel
  177. */
  178. #ifdef STARPU_USE_OPENCL
  179. compile_spmv_opencl_kernel();
  180. #endif
  181. gettimeofday(&start, NULL);
  182. /*
  183. * Create and submit StarPU tasks
  184. */
  185. for (part = 0; part < nblocks; part++)
  186. {
  187. struct starpu_task *task = starpu_task_create();
  188. task->cl = &spmv_cl;
  189. task->handles[0] = starpu_data_get_sub_data(sparse_matrix, 1, part);
  190. task->handles[1] = vector_in;
  191. task->handles[2] = starpu_data_get_sub_data(vector_out, 1, part);
  192. ret = starpu_task_submit(task);
  193. if (STARPU_UNLIKELY(ret == -ENODEV))
  194. {
  195. FPRINTF(stderr, "No worker may execute this task\n");
  196. exit(0);
  197. }
  198. }
  199. starpu_task_wait_for_all();
  200. gettimeofday(&end, NULL);
  201. /*
  202. * Unregister the CSR matrix and the output vector
  203. */
  204. starpu_data_unpartition(sparse_matrix, 0);
  205. starpu_data_unpartition(vector_out, 0);
  206. /*
  207. * Unregister data
  208. */
  209. starpu_data_unregister(sparse_matrix);
  210. starpu_data_unregister(vector_in);
  211. starpu_data_unregister(vector_out);
  212. /*
  213. * Display the result
  214. */
  215. for (row = 0; row < STARPU_MIN(size, 16); row++)
  216. {
  217. FPRINTF(stdout, "%2.2f\t%2.2f\n", vector_in_ptr[row], vector_out_ptr[row]);
  218. }
  219. starpu_free(nzval);
  220. starpu_free(colind);
  221. starpu_free(rowptr);
  222. starpu_free(vector_in_ptr);
  223. starpu_free(vector_out_ptr);
  224. /*
  225. * Stop StarPU
  226. */
  227. starpu_shutdown();
  228. timing = (double)((end.tv_sec - start.tv_sec)*1000000 + (end.tv_usec - start.tv_usec));
  229. FPRINTF(stderr, "Computation took (in ms)\n");
  230. FPRINTF(stdout, "%2.2f\n", timing/1000);
  231. return 0;
  232. }