dw_factolu_tag.c 7.5 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304
  1. /*
  2. * StarPU
  3. * Copyright (C) Université Bordeaux 1, CNRS 2008-2010 (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) ((starpu_tag_t)( (1ULL<<60) | (unsigned long long)(k)))
  18. #define TAG12(k,i) ((starpu_tag_t)(((2ULL<<60) | (((unsigned long long)(k))<<32) \
  19. | (unsigned long long)(i))))
  20. #define TAG21(k,j) ((starpu_tag_t)(((3ULL<<60) | (((unsigned long long)(k))<<32) \
  21. | (unsigned long long)(j))))
  22. #define TAG22(k,i,j) ((starpu_tag_t)(((4ULL<<60) | ((unsigned long long)(k)<<32) \
  23. | ((unsigned long long)(i)<<16) \
  24. | (unsigned long long)(j))))
  25. static unsigned no_prio = 0;
  26. /*
  27. * Construct the DAG
  28. */
  29. static struct starpu_task *create_task(starpu_tag_t id)
  30. {
  31. struct starpu_task *task = starpu_task_create();
  32. task->cl_arg = NULL;
  33. task->use_tag = 1;
  34. task->tag_id = id;
  35. return task;
  36. }
  37. static starpu_codelet cl11 = {
  38. .where = STARPU_CPU|STARPU_CUDA,
  39. .cpu_func = dw_cpu_codelet_update_u11,
  40. #ifdef STARPU_USE_CUDA
  41. .cuda_func = dw_cublas_codelet_update_u11,
  42. #endif
  43. .nbuffers = 1,
  44. .model = &model_11
  45. };
  46. static struct starpu_task *create_task_11(starpu_data_handle dataA, unsigned k)
  47. {
  48. // printf("task 11 k = %d TAG = %llx\n", k, (TAG11(k)));
  49. struct starpu_task *task = create_task(TAG11(k));
  50. task->cl = &cl11;
  51. /* which sub-data is manipulated ? */
  52. task->buffers[0].handle = starpu_data_get_sub_data(dataA, 2, k, k);
  53. task->buffers[0].mode = STARPU_RW;
  54. /* this is an important task */
  55. if (!no_prio)
  56. task->priority = STARPU_MAX_PRIO;
  57. /* enforce dependencies ... */
  58. if (k > 0) {
  59. starpu_tag_declare_deps(TAG11(k), 1, TAG22(k-1, k, k));
  60. }
  61. return task;
  62. }
  63. static starpu_codelet cl12 = {
  64. .where = STARPU_CPU|STARPU_CUDA,
  65. .cpu_func = dw_cpu_codelet_update_u12,
  66. #ifdef STARPU_USE_CUDA
  67. .cuda_func = dw_cublas_codelet_update_u12,
  68. #endif
  69. .nbuffers = 2,
  70. .model = &model_12
  71. };
  72. static void create_task_12(starpu_data_handle dataA, unsigned k, unsigned i)
  73. {
  74. // printf("task 12 k,i = %d,%d TAG = %llx\n", k,i, TAG12(k,i));
  75. struct starpu_task *task = create_task(TAG12(k, i));
  76. task->cl = &cl12;
  77. /* which sub-data is manipulated ? */
  78. task->buffers[0].handle = starpu_data_get_sub_data(dataA, 2, k, k);
  79. task->buffers[0].mode = STARPU_R;
  80. task->buffers[1].handle = starpu_data_get_sub_data(dataA, 2, i, k);
  81. task->buffers[1].mode = STARPU_RW;
  82. if (!no_prio && (i == k+1)) {
  83. task->priority = STARPU_MAX_PRIO;
  84. }
  85. /* enforce dependencies ... */
  86. if (k > 0) {
  87. starpu_tag_declare_deps(TAG12(k, i), 2, TAG11(k), TAG22(k-1, i, k));
  88. }
  89. else {
  90. starpu_tag_declare_deps(TAG12(k, i), 1, TAG11(k));
  91. }
  92. starpu_task_submit(task);
  93. }
  94. static starpu_codelet cl21 = {
  95. .where = STARPU_CPU|STARPU_CUDA,
  96. .cpu_func = dw_cpu_codelet_update_u21,
  97. #ifdef STARPU_USE_CUDA
  98. .cuda_func = dw_cublas_codelet_update_u21,
  99. #endif
  100. .nbuffers = 2,
  101. .model = &model_21
  102. };
  103. static void create_task_21(starpu_data_handle dataA, unsigned k, unsigned j)
  104. {
  105. struct starpu_task *task = create_task(TAG21(k, j));
  106. task->cl = &cl21;
  107. /* which sub-data is manipulated ? */
  108. task->buffers[0].handle = starpu_data_get_sub_data(dataA, 2, k, k);
  109. task->buffers[0].mode = STARPU_R;
  110. task->buffers[1].handle = starpu_data_get_sub_data(dataA, 2, k, j);
  111. task->buffers[1].mode = STARPU_RW;
  112. if (!no_prio && (j == k+1)) {
  113. task->priority = STARPU_MAX_PRIO;
  114. }
  115. /* enforce dependencies ... */
  116. if (k > 0) {
  117. starpu_tag_declare_deps(TAG21(k, j), 2, TAG11(k), TAG22(k-1, k, j));
  118. }
  119. else {
  120. starpu_tag_declare_deps(TAG21(k, j), 1, TAG11(k));
  121. }
  122. starpu_task_submit(task);
  123. }
  124. static starpu_codelet cl22 = {
  125. .where = STARPU_CPU|STARPU_CUDA,
  126. .cpu_func = dw_cpu_codelet_update_u22,
  127. #ifdef STARPU_USE_CUDA
  128. .cuda_func = dw_cublas_codelet_update_u22,
  129. #endif
  130. .nbuffers = 3,
  131. .model = &model_22
  132. };
  133. static void create_task_22(starpu_data_handle dataA, unsigned k, unsigned i, unsigned j)
  134. {
  135. // printf("task 22 k,i,j = %d,%d,%d TAG = %llx\n", k,i,j, TAG22(k,i,j));
  136. struct starpu_task *task = create_task(TAG22(k, i, j));
  137. task->cl = &cl22;
  138. /* which sub-data is manipulated ? */
  139. task->buffers[0].handle = starpu_data_get_sub_data(dataA, 2, i, k);
  140. task->buffers[0].mode = STARPU_R;
  141. task->buffers[1].handle = starpu_data_get_sub_data(dataA, 2, k, j);
  142. task->buffers[1].mode = STARPU_R;
  143. task->buffers[2].handle = starpu_data_get_sub_data(dataA, 2, i, j);
  144. task->buffers[2].mode = STARPU_RW;
  145. if (!no_prio && (i == k + 1) && (j == k +1) ) {
  146. task->priority = STARPU_MAX_PRIO;
  147. }
  148. /* enforce dependencies ... */
  149. if (k > 0) {
  150. starpu_tag_declare_deps(TAG22(k, i, j), 3, TAG22(k-1, i, j), TAG12(k, i), TAG21(k, j));
  151. }
  152. else {
  153. starpu_tag_declare_deps(TAG22(k, i, j), 2, TAG12(k, i), TAG21(k, j));
  154. }
  155. starpu_task_submit(task);
  156. }
  157. /*
  158. * code to bootstrap the factorization
  159. */
  160. static void dw_codelet_facto_v3(starpu_data_handle dataA, unsigned nblocks)
  161. {
  162. struct timeval start;
  163. struct timeval end;
  164. struct starpu_task *entry_task = NULL;
  165. /* create all the DAG nodes */
  166. unsigned i,j,k;
  167. for (k = 0; k < nblocks; k++)
  168. {
  169. struct starpu_task *task = create_task_11(dataA, k);
  170. /* we defer the launch of the first task */
  171. if (k == 0) {
  172. entry_task = task;
  173. }
  174. else {
  175. starpu_task_submit(task);
  176. }
  177. for (i = k+1; i<nblocks; i++)
  178. {
  179. create_task_12(dataA, k, i);
  180. create_task_21(dataA, k, i);
  181. }
  182. for (i = k+1; i<nblocks; i++)
  183. {
  184. for (j = k+1; j<nblocks; j++)
  185. {
  186. create_task_22(dataA, k, i, j);
  187. }
  188. }
  189. }
  190. /* schedule the codelet */
  191. gettimeofday(&start, NULL);
  192. int ret = starpu_task_submit(entry_task);
  193. if (STARPU_UNLIKELY(ret == -ENODEV))
  194. {
  195. fprintf(stderr, "No worker may execute this task\n");
  196. exit(-1);
  197. }
  198. /* stall the application until the end of computations */
  199. starpu_tag_wait(TAG11(nblocks-1));
  200. gettimeofday(&end, NULL);
  201. double timing = (double)((end.tv_sec - start.tv_sec)*1000000 + (end.tv_usec - start.tv_usec));
  202. fprintf(stderr, "Computation took (in ms)\n");
  203. printf("%2.2f\n", timing/1000);
  204. unsigned n = starpu_matrix_get_nx(dataA);
  205. double flop = (2.0f*n*n*n)/3.0f;
  206. fprintf(stderr, "Synthetic GFlops : %2.2f\n", (flop/timing/1000.0f));
  207. }
  208. void dw_factoLU_tag(float *matA, unsigned size, unsigned ld, unsigned nblocks, unsigned _no_prio)
  209. {
  210. #ifdef CHECK_RESULTS
  211. fprintf(stderr, "Checking results ...\n");
  212. float *Asaved;
  213. Asaved = malloc((size_t)ld*ld*sizeof(float));
  214. memcpy(Asaved, matA, (size_t)ld*ld*sizeof(float));
  215. #endif
  216. no_prio = _no_prio;
  217. starpu_data_handle dataA;
  218. /* monitor and partition the A matrix into blocks :
  219. * one block is now determined by 2 unsigned (i,j) */
  220. starpu_matrix_data_register(&dataA, 0, (uintptr_t)matA, ld, size, size, sizeof(float));
  221. struct starpu_data_filter f;
  222. f.filter_func = starpu_vertical_block_filter_func;
  223. f.nchildren = nblocks;
  224. f.get_nchildren = NULL;
  225. f.get_child_ops = NULL;
  226. struct starpu_data_filter f2;
  227. f2.filter_func = starpu_block_filter_func;
  228. f2.nchildren = nblocks;
  229. f2.get_nchildren = NULL;
  230. f2.get_child_ops = NULL;
  231. starpu_data_map_filters(dataA, 2, &f, &f2);
  232. dw_codelet_facto_v3(dataA, nblocks);
  233. /* gather all the data */
  234. starpu_data_unpartition(dataA, 0);
  235. #ifdef CHECK_RESULTS
  236. compare_A_LU(Asaved, matA, size, ld);
  237. #endif
  238. }