dw_factolu_tag.c 7.8 KB

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