spmv.c 6.8 KB

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