dw_factolu_grain.c 9.0 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. #include "dw_factolu.h"
  17. #define TAG11(k, prefix) ((starpu_tag_t)( (((unsigned long long)(prefix))<<60) | (1ULL<<56) | (unsigned long long)(k)))
  18. #define TAG12(k,i, prefix) ((starpu_tag_t)((((unsigned long long)(prefix))<<60) | ((2ULL<<56) | (((unsigned long long)(k))<<32) \
  19. | (unsigned long long)(i))))
  20. #define TAG21(k,j, prefix) ((starpu_tag_t)( (((unsigned long long)(prefix))<<60) | ((3ULL<<56) | (((unsigned long long)(k))<<32) \
  21. | (unsigned long long)(j))))
  22. #define TAG22(k,i,j, prefix) ((starpu_tag_t)( (((unsigned long long)(prefix))<<60) | ((4ULL<<56) | ((unsigned long long)(k)<<32) \
  23. | ((unsigned long long)(i)<<16) \
  24. | (unsigned long long)(j))))
  25. /*
  26. * Construct the DAG
  27. */
  28. static struct starpu_task *create_task(starpu_tag_t id)
  29. {
  30. struct starpu_task *task = starpu_task_create();
  31. task->cl_arg = NULL;
  32. task->use_tag = 1;
  33. task->tag_id = id;
  34. return task;
  35. }
  36. static starpu_codelet cl11 = {
  37. .where = STARPU_CPU|STARPU_CUDA,
  38. .cpu_func = dw_cpu_codelet_update_u11,
  39. #ifdef STARPU_USE_CUDA
  40. .cuda_func = dw_cublas_codelet_update_u11,
  41. #endif
  42. .nbuffers = 1,
  43. .model = &model_11
  44. };
  45. static struct starpu_task *create_task_11(starpu_data_handle dataA, unsigned k, unsigned tag_prefix)
  46. {
  47. // printf("task 11 k = %d TAG = %llx\n", k, (TAG11(k)));
  48. struct starpu_task *task = create_task(TAG11(k, tag_prefix));
  49. task->cl = &cl11;
  50. /* which sub-data is manipulated ? */
  51. task->buffers[0].handle = starpu_data_get_sub_data(dataA, 2, k, k);
  52. task->buffers[0].mode = STARPU_RW;
  53. /* this is an important task */
  54. task->priority = STARPU_MAX_PRIO;
  55. /* enforce dependencies ... */
  56. if (k > 0) {
  57. starpu_tag_declare_deps(TAG11(k, tag_prefix), 1, TAG22(k-1, k, k, tag_prefix));
  58. }
  59. return task;
  60. }
  61. static starpu_codelet cl12 = {
  62. .where = STARPU_CPU|STARPU_CUDA,
  63. .cpu_func = dw_cpu_codelet_update_u12,
  64. #ifdef STARPU_USE_CUDA
  65. .cuda_func = dw_cublas_codelet_update_u12,
  66. #endif
  67. .nbuffers = 2,
  68. .model = &model_12
  69. };
  70. static void create_task_12(starpu_data_handle dataA, unsigned k, unsigned i, unsigned tag_prefix)
  71. {
  72. // printf("task 12 k,i = %d,%d TAG = %llx\n", k,i, TAG12(k,i));
  73. struct starpu_task *task = create_task(TAG12(k, i, tag_prefix));
  74. task->cl = &cl12;
  75. /* which sub-data is manipulated ? */
  76. task->buffers[0].handle = starpu_data_get_sub_data(dataA, 2, k, k);
  77. task->buffers[0].mode = STARPU_R;
  78. task->buffers[1].handle = starpu_data_get_sub_data(dataA, 2, i, k);
  79. task->buffers[1].mode = STARPU_RW;
  80. if (i == k+1) {
  81. task->priority = STARPU_MAX_PRIO;
  82. }
  83. /* enforce dependencies ... */
  84. if (k > 0) {
  85. starpu_tag_declare_deps(TAG12(k, i, tag_prefix), 2, TAG11(k, tag_prefix), TAG22(k-1, i, k, tag_prefix));
  86. }
  87. else {
  88. starpu_tag_declare_deps(TAG12(k, i, tag_prefix), 1, TAG11(k, tag_prefix));
  89. }
  90. starpu_task_submit(task);
  91. }
  92. static starpu_codelet cl21 = {
  93. .where = STARPU_CPU|STARPU_CUDA,
  94. .cpu_func = dw_cpu_codelet_update_u21,
  95. #ifdef STARPU_USE_CUDA
  96. .cuda_func = dw_cublas_codelet_update_u21,
  97. #endif
  98. .nbuffers = 2,
  99. .model = &model_21
  100. };
  101. static void create_task_21(starpu_data_handle dataA, unsigned k, unsigned j, unsigned tag_prefix)
  102. {
  103. struct starpu_task *task = create_task(TAG21(k, j, tag_prefix));
  104. task->cl = &cl21;
  105. /* which sub-data is manipulated ? */
  106. task->buffers[0].handle = starpu_data_get_sub_data(dataA, 2, k, k);
  107. task->buffers[0].mode = STARPU_R;
  108. task->buffers[1].handle = starpu_data_get_sub_data(dataA, 2, k, j);
  109. task->buffers[1].mode = STARPU_RW;
  110. if (j == k+1) {
  111. task->priority = STARPU_MAX_PRIO;
  112. }
  113. /* enforce dependencies ... */
  114. if (k > 0) {
  115. starpu_tag_declare_deps(TAG21(k, j, tag_prefix), 2, TAG11(k, tag_prefix), TAG22(k-1, k, j, tag_prefix));
  116. }
  117. else {
  118. starpu_tag_declare_deps(TAG21(k, j, tag_prefix), 1, TAG11(k, tag_prefix));
  119. }
  120. starpu_task_submit(task);
  121. }
  122. static starpu_codelet cl22 = {
  123. .where = STARPU_CPU|STARPU_CUDA,
  124. .cpu_func = dw_cpu_codelet_update_u22,
  125. #ifdef STARPU_USE_CUDA
  126. .cuda_func = dw_cublas_codelet_update_u22,
  127. #endif
  128. .nbuffers = 3,
  129. .model = &model_22
  130. };
  131. static void create_task_22(starpu_data_handle dataA, unsigned k, unsigned i, unsigned j, unsigned tag_prefix)
  132. {
  133. // printf("task 22 k,i,j = %d,%d,%d TAG = %llx\n", k,i,j, TAG22(k,i,j));
  134. struct starpu_task *task = create_task(TAG22(k, i, j, tag_prefix));
  135. task->cl = &cl22;
  136. /* which sub-data is manipulated ? */
  137. task->buffers[0].handle = starpu_data_get_sub_data(dataA, 2, i, k);
  138. task->buffers[0].mode = STARPU_R;
  139. task->buffers[1].handle = starpu_data_get_sub_data(dataA, 2, k, j);
  140. task->buffers[1].mode = STARPU_R;
  141. task->buffers[2].handle = starpu_data_get_sub_data(dataA, 2, i, j);
  142. task->buffers[2].mode = STARPU_RW;
  143. if ( (i == k + 1) && (j == k +1) ) {
  144. task->priority = STARPU_MAX_PRIO;
  145. }
  146. /* enforce dependencies ... */
  147. if (k > 0) {
  148. starpu_tag_declare_deps(TAG22(k, i, j, tag_prefix), 3, TAG22(k-1, i, j, tag_prefix), TAG12(k, i, tag_prefix), TAG21(k, j, tag_prefix));
  149. }
  150. else {
  151. starpu_tag_declare_deps(TAG22(k, i, j, tag_prefix), 2, TAG12(k, i, tag_prefix), TAG21(k, j, tag_prefix));
  152. }
  153. starpu_task_submit(task);
  154. }
  155. static void dw_factoLU_grain_inner(float *matA, unsigned size, unsigned inner_size,
  156. unsigned ld, unsigned blocksize, unsigned tag_prefix)
  157. {
  158. /*
  159. * (re)partition data
  160. */
  161. starpu_data_handle dataA;
  162. starpu_matrix_data_register(&dataA, 0, (uintptr_t)matA, ld, size, size, sizeof(float));
  163. STARPU_ASSERT((size % blocksize) == 0);
  164. STARPU_ASSERT((inner_size % blocksize) == 0);
  165. unsigned nblocks = size / blocksize;
  166. unsigned maxk = inner_size / blocksize;
  167. starpu_filter f;
  168. f.filter_func = starpu_vertical_block_filter_func;
  169. f.filter_arg = nblocks;
  170. starpu_filter f2;
  171. f2.filter_func = starpu_block_filter_func;
  172. f2.filter_arg = nblocks;
  173. starpu_map_filters(dataA, 2, &f, &f2);
  174. /*
  175. * submit tasks
  176. */
  177. struct starpu_task *entry_task = NULL;
  178. /* create all the DAG nodes */
  179. unsigned i,j,k;
  180. /* if maxk < nblocks we'll stop before the LU decomposition is totally done */
  181. for (k = 0; k < maxk; k++)
  182. {
  183. struct starpu_task *task = create_task_11(dataA, k, tag_prefix);
  184. /* we defer the launch of the first task */
  185. if (k == 0) {
  186. entry_task = task;
  187. }
  188. else {
  189. starpu_task_submit(task);
  190. }
  191. for (i = k+1; i<nblocks; i++)
  192. {
  193. create_task_12(dataA, k, i, tag_prefix);
  194. create_task_21(dataA, k, i, tag_prefix);
  195. }
  196. for (i = k+1; i<nblocks; i++)
  197. {
  198. for (j = k+1; j<nblocks; j++)
  199. {
  200. create_task_22(dataA, k, i, j, tag_prefix);
  201. }
  202. }
  203. }
  204. int ret = starpu_task_submit(entry_task);
  205. if (STARPU_UNLIKELY(ret == -ENODEV))
  206. {
  207. fprintf(stderr, "No worker may execute this task\n");
  208. exit(-1);
  209. }
  210. /* is this the last call to dw_factoLU_grain_inner ? */
  211. if (inner_size == size)
  212. {
  213. /* we wait for the last task and we are done */
  214. starpu_tag_wait(TAG11(nblocks-1, tag_prefix));
  215. starpu_data_unpartition(dataA, 0);
  216. return;
  217. }
  218. else {
  219. /*
  220. * call dw_factoLU_grain_inner recursively in the remaining blocks
  221. */
  222. unsigned ndeps_tags = (nblocks - maxk)*(nblocks - maxk);
  223. starpu_tag_t *tag_array = malloc(ndeps_tags*sizeof(starpu_tag_t));
  224. STARPU_ASSERT(tag_array);
  225. unsigned ind = 0;
  226. for (i = maxk; i < nblocks; i++)
  227. for (j = maxk; j < nblocks; j++)
  228. {
  229. tag_array[ind++] = TAG22(maxk-1, i, j, tag_prefix);
  230. }
  231. starpu_tag_wait_array(ndeps_tags, tag_array);
  232. free(tag_array);
  233. starpu_data_unpartition(dataA, 0);
  234. starpu_data_unregister(dataA);
  235. float *newmatA = &matA[inner_size*(ld+1)];
  236. // if (tag_prefix < 2)
  237. // {
  238. // dw_factoLU_grain_inner(newmatA, size-inner_size, (size-inner_size)/2, ld, blocksize/2, tag_prefix+1);
  239. // }
  240. // else {
  241. dw_factoLU_grain_inner(newmatA, size-inner_size, size-inner_size, ld, blocksize/2, tag_prefix+1);
  242. // }
  243. }
  244. }
  245. void dw_factoLU_grain(float *matA, unsigned size, unsigned ld, unsigned nblocks, unsigned nbigblocks)
  246. {
  247. #ifdef CHECK_RESULTS
  248. fprintf(stderr, "Checking results ...\n");
  249. float *Asaved;
  250. Asaved = malloc(ld*ld*sizeof(float));
  251. memcpy(Asaved, matA, ld*ld*sizeof(float));
  252. #endif
  253. struct timeval start;
  254. struct timeval end;
  255. /* schedule the codelet */
  256. gettimeofday(&start, NULL);
  257. /* that's only ok for powers of 2 yet ! */
  258. dw_factoLU_grain_inner(matA, size, (size/nblocks) * nbigblocks, ld, size/nblocks, 0);
  259. gettimeofday(&end, NULL);
  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. unsigned n = size;
  264. double flop = (2.0f*n*n*n)/3.0f;
  265. fprintf(stderr, "Synthetic GFlops : %2.2f\n", (flop/timing/1000.0f));
  266. #ifdef CHECK_RESULTS
  267. compare_A_LU(Asaved, matA, size, ld);
  268. #endif
  269. }