dw_factolu_grain.c 9.5 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371
  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, prefix) ((starpu_tag_t)( (((unsigned long long)(prefix))<<60) | (1ULL<<56) | (unsigned long long)(k)))
  20. #define TAG12(k,i, prefix) ((starpu_tag_t)((((unsigned long long)(prefix))<<60) | ((2ULL<<56) | (((unsigned long long)(k))<<32) \
  21. | (unsigned long long)(i))))
  22. #define TAG21(k,j, prefix) ((starpu_tag_t)( (((unsigned long long)(prefix))<<60) | ((3ULL<<56) | (((unsigned long long)(k))<<32) \
  23. | (unsigned long long)(j))))
  24. #define TAG22(k,i,j, prefix) ((starpu_tag_t)( (((unsigned long long)(prefix))<<60) | ((4ULL<<56) | ((unsigned long long)(k)<<32) \
  25. | ((unsigned long long)(i)<<16) \
  26. | (unsigned long long)(j))))
  27. struct starpu_perfmodel model_11;
  28. struct starpu_perfmodel model_12;
  29. struct starpu_perfmodel model_21;
  30. struct starpu_perfmodel model_22;
  31. /*
  32. * Construct the DAG
  33. */
  34. static struct starpu_task *create_task(starpu_tag_t id)
  35. {
  36. struct starpu_task *task = starpu_task_create();
  37. task->cl_arg = NULL;
  38. task->use_tag = 1;
  39. task->tag_id = id;
  40. return task;
  41. }
  42. static struct starpu_codelet cl11 =
  43. {
  44. .modes = { STARPU_RW },
  45. .cpu_funcs = {dw_cpu_codelet_update_u11, NULL},
  46. #ifdef STARPU_USE_CUDA
  47. .cuda_funcs = {dw_cublas_codelet_update_u11, NULL},
  48. #endif
  49. .nbuffers = 1,
  50. .model = &model_11
  51. };
  52. static struct starpu_task *create_task_11(starpu_data_handle_t dataA, unsigned k, unsigned tag_prefix)
  53. {
  54. /* FPRINTF(stdout, "task 11 k = %d TAG = %llx\n", k, (TAG11(k))); */
  55. struct starpu_task *task = create_task(TAG11(k, tag_prefix));
  56. task->cl = &cl11;
  57. /* which sub-data is manipulated ? */
  58. task->handles[0] = starpu_data_get_sub_data(dataA, 2, k, k);
  59. /* this is an important task */
  60. task->priority = STARPU_MAX_PRIO;
  61. /* enforce dependencies ... */
  62. if (k > 0)
  63. {
  64. starpu_tag_declare_deps(TAG11(k, tag_prefix), 1, TAG22(k-1, k, k, tag_prefix));
  65. }
  66. return task;
  67. }
  68. static struct starpu_codelet cl12 =
  69. {
  70. .modes = { STARPU_R, STARPU_RW },
  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, unsigned tag_prefix)
  79. {
  80. int ret;
  81. /* FPRINTF(stdout, "task 12 k,i = %d,%d TAG = %llx\n", k,i, TAG12(k,i)); */
  82. struct starpu_task *task = create_task(TAG12(k, i, tag_prefix));
  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 (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, tag_prefix), 2, TAG11(k, tag_prefix), TAG22(k-1, i, k, tag_prefix));
  95. }
  96. else
  97. {
  98. starpu_tag_declare_deps(TAG12(k, i, tag_prefix), 1, TAG11(k, tag_prefix));
  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. .cpu_funcs = {dw_cpu_codelet_update_u21, NULL},
  107. #ifdef STARPU_USE_CUDA
  108. .cuda_funcs = {dw_cublas_codelet_update_u21, NULL},
  109. #endif
  110. .nbuffers = 2,
  111. .model = &model_21
  112. };
  113. static void create_task_21(starpu_data_handle_t dataA, unsigned k, unsigned j, unsigned tag_prefix)
  114. {
  115. int ret;
  116. struct starpu_task *task = create_task(TAG21(k, j, tag_prefix));
  117. task->cl = &cl21;
  118. /* which sub-data is manipulated ? */
  119. task->handles[0] = starpu_data_get_sub_data(dataA, 2, k, k);
  120. task->handles[1] = starpu_data_get_sub_data(dataA, 2, k, j);
  121. if (j == k+1)
  122. {
  123. task->priority = STARPU_MAX_PRIO;
  124. }
  125. /* enforce dependencies ... */
  126. if (k > 0)
  127. {
  128. starpu_tag_declare_deps(TAG21(k, j, tag_prefix), 2, TAG11(k, tag_prefix), TAG22(k-1, k, j, tag_prefix));
  129. }
  130. else
  131. {
  132. starpu_tag_declare_deps(TAG21(k, j, tag_prefix), 1, TAG11(k, tag_prefix));
  133. }
  134. ret = starpu_task_submit(task);
  135. STARPU_CHECK_RETURN_VALUE(ret, "starpu_task_submit");
  136. }
  137. static struct starpu_codelet cl22 =
  138. {
  139. .modes = { STARPU_R, STARPU_R, STARPU_RW },
  140. .cpu_funcs = {dw_cpu_codelet_update_u22, NULL},
  141. #ifdef STARPU_USE_CUDA
  142. .cuda_funcs = {dw_cublas_codelet_update_u22, NULL},
  143. #endif
  144. .nbuffers = 3,
  145. .model = &model_22
  146. };
  147. static void create_task_22(starpu_data_handle_t dataA, unsigned k, unsigned i, unsigned j, unsigned tag_prefix)
  148. {
  149. int ret;
  150. /* FPRINTF(stdout, "task 22 k,i,j = %d,%d,%d TAG = %llx\n", k,i,j, TAG22(k,i,j)); */
  151. struct starpu_task *task = create_task(TAG22(k, i, j, tag_prefix));
  152. task->cl = &cl22;
  153. /* which sub-data is manipulated ? */
  154. task->handles[0] = starpu_data_get_sub_data(dataA, 2, i, k);
  155. task->handles[1] = starpu_data_get_sub_data(dataA, 2, k, j);
  156. task->handles[2] = starpu_data_get_sub_data(dataA, 2, i, j);
  157. if ( (i == k + 1) && (j == k +1) )
  158. {
  159. task->priority = STARPU_MAX_PRIO;
  160. }
  161. /* enforce dependencies ... */
  162. if (k > 0)
  163. {
  164. 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));
  165. }
  166. else
  167. {
  168. starpu_tag_declare_deps(TAG22(k, i, j, tag_prefix), 2, TAG12(k, i, tag_prefix), TAG21(k, j, tag_prefix));
  169. }
  170. ret = starpu_task_submit(task);
  171. STARPU_CHECK_RETURN_VALUE(ret, "starpu_task_submit");
  172. }
  173. static void dw_factoLU_grain_inner(float *matA, unsigned size, unsigned inner_size,
  174. unsigned ld, unsigned blocksize, unsigned tag_prefix)
  175. {
  176. int ret;
  177. /*
  178. * (re)partition data
  179. */
  180. starpu_data_handle_t dataA;
  181. starpu_matrix_data_register(&dataA, STARPU_MAIN_RAM, (uintptr_t)matA, ld, size, size, sizeof(float));
  182. STARPU_ASSERT((size % blocksize) == 0);
  183. STARPU_ASSERT((inner_size % blocksize) == 0);
  184. unsigned nblocks = size / blocksize;
  185. unsigned maxk = inner_size / blocksize;
  186. struct starpu_data_filter f =
  187. {
  188. .filter_func = starpu_matrix_filter_vertical_block,
  189. .nchildren = nblocks
  190. };
  191. struct starpu_data_filter f2 =
  192. {
  193. .filter_func = starpu_matrix_filter_block,
  194. .nchildren = nblocks
  195. };
  196. starpu_data_map_filters(dataA, 2, &f, &f2);
  197. /*
  198. * submit tasks
  199. */
  200. struct starpu_task *entry_task = NULL;
  201. /* create all the DAG nodes */
  202. unsigned i,j,k;
  203. /* if maxk < nblocks we'll stop before the LU decomposition is totally done */
  204. for (k = 0; k < maxk; k++)
  205. {
  206. struct starpu_task *task = create_task_11(dataA, k, tag_prefix);
  207. /* we defer the launch of the first task */
  208. if (k == 0)
  209. {
  210. entry_task = task;
  211. }
  212. else
  213. {
  214. ret = starpu_task_submit(task);
  215. STARPU_CHECK_RETURN_VALUE(ret, "starpu_task_submit");
  216. }
  217. for (i = k+1; i<nblocks; i++)
  218. {
  219. create_task_12(dataA, k, i, tag_prefix);
  220. create_task_21(dataA, k, i, tag_prefix);
  221. }
  222. for (i = k+1; i<nblocks; i++)
  223. {
  224. for (j = k+1; j<nblocks; j++)
  225. {
  226. create_task_22(dataA, k, i, j, tag_prefix);
  227. }
  228. }
  229. }
  230. ret = starpu_task_submit(entry_task);
  231. if (STARPU_UNLIKELY(ret == -ENODEV))
  232. {
  233. FPRINTF(stderr, "No worker may execute this task\n");
  234. exit(-1);
  235. }
  236. /* is this the last call to dw_factoLU_grain_inner ? */
  237. if (inner_size == size)
  238. {
  239. /* we wait for the last task and we are done */
  240. starpu_tag_wait(TAG11(nblocks-1, tag_prefix));
  241. starpu_data_unpartition(dataA, STARPU_MAIN_RAM);
  242. return;
  243. }
  244. else
  245. {
  246. /*
  247. * call dw_factoLU_grain_inner recursively in the remaining blocks
  248. */
  249. unsigned ndeps_tags = (nblocks - maxk)*(nblocks - maxk);
  250. starpu_tag_t *tag_array = malloc(ndeps_tags*sizeof(starpu_tag_t));
  251. STARPU_ASSERT(tag_array);
  252. unsigned ind = 0;
  253. for (i = maxk; i < nblocks; i++)
  254. for (j = maxk; j < nblocks; j++)
  255. {
  256. tag_array[ind++] = TAG22(maxk-1, i, j, tag_prefix);
  257. }
  258. starpu_tag_wait_array(ndeps_tags, tag_array);
  259. free(tag_array);
  260. starpu_data_unpartition(dataA, STARPU_MAIN_RAM);
  261. starpu_data_unregister(dataA);
  262. float *newmatA = &matA[inner_size*(ld+1)];
  263. /* if (tag_prefix < 2)
  264. {
  265. dw_factoLU_grain_inner(newmatA, size-inner_size, (size-inner_size)/2, ld, blocksize/2, tag_prefix+1);
  266. }
  267. else
  268. { */
  269. dw_factoLU_grain_inner(newmatA, size-inner_size, size-inner_size, ld, blocksize/2, tag_prefix+1);
  270. /* } */
  271. }
  272. }
  273. void dw_factoLU_grain(float *matA, unsigned size, unsigned ld, unsigned nblocks, unsigned nbigblocks)
  274. {
  275. #ifdef CHECK_RESULTS
  276. FPRINTF(stderr, "Checking results ...\n");
  277. float *Asaved;
  278. Asaved = malloc(ld*ld*sizeof(float));
  279. memcpy(Asaved, matA, ld*ld*sizeof(float));
  280. #endif
  281. struct timeval start;
  282. struct timeval end;
  283. /* schedule the codelet */
  284. gettimeofday(&start, NULL);
  285. /* that's only ok for powers of 2 yet ! */
  286. dw_factoLU_grain_inner(matA, size, (size/nblocks) * nbigblocks, ld, size/nblocks, 0);
  287. gettimeofday(&end, NULL);
  288. double timing = (double)((end.tv_sec - start.tv_sec)*1000000 + (end.tv_usec - start.tv_usec));
  289. FPRINTF(stderr, "Computation took (in ms)\n");
  290. FPRINTF(stdout, "%2.2f\n", timing/1000);
  291. unsigned n = size;
  292. double flop = (2.0f*n*n*n)/3.0f;
  293. FPRINTF(stderr, "Synthetic GFlops : %2.2f\n", (flop/timing/1000.0f));
  294. #ifdef CHECK_RESULTS
  295. compare_A_LU(Asaved, matA, size, ld);
  296. #endif
  297. }