dw_factolu_grain.c 9.4 KB

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