dw_cholesky_grain.c 8.7 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382
  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_cholesky.h"
  17. #include "dw_cholesky_models.h"
  18. /*
  19. * Some useful functions
  20. */
  21. static struct starpu_task *create_task(starpu_tag_t id)
  22. {
  23. struct starpu_task *task = starpu_task_create();
  24. task->cl_arg = NULL;
  25. task->use_tag = 1;
  26. task->tag_id = id;
  27. return task;
  28. }
  29. /*
  30. * Create the codelets
  31. */
  32. static starpu_codelet cl11 =
  33. {
  34. .where = STARPU_CPU|STARPU_CUDA,
  35. .cpu_func = chol_cpu_codelet_update_u11,
  36. #ifdef STARPU_USE_CUDA
  37. .cuda_func = chol_cublas_codelet_update_u11,
  38. #endif
  39. .nbuffers = 1,
  40. .model = &chol_model_11
  41. };
  42. static struct starpu_task * create_task_11(starpu_data_handle dataA, unsigned k, unsigned reclevel)
  43. {
  44. // printf("task 11 k = %d TAG = %llx\n", k, (TAG11(k)));
  45. struct starpu_task *task = create_task(TAG11_AUX(k, reclevel));
  46. task->cl = &cl11;
  47. /* which sub-data is manipulated ? */
  48. task->buffers[0].handle = starpu_data_get_sub_data(dataA, 2, k, k);
  49. task->buffers[0].mode = STARPU_RW;
  50. /* this is an important task */
  51. task->priority = STARPU_MAX_PRIO;
  52. /* enforce dependencies ... */
  53. if (k > 0) {
  54. starpu_tag_declare_deps(TAG11_AUX(k, reclevel), 1, TAG22_AUX(k-1, k, k, reclevel));
  55. }
  56. return task;
  57. }
  58. static starpu_codelet cl21 =
  59. {
  60. .where = STARPU_CPU|STARPU_CUDA,
  61. .cpu_func = chol_cpu_codelet_update_u21,
  62. #ifdef STARPU_USE_CUDA
  63. .cuda_func = chol_cublas_codelet_update_u21,
  64. #endif
  65. .nbuffers = 2,
  66. .model = &chol_model_21
  67. };
  68. static void create_task_21(starpu_data_handle dataA, unsigned k, unsigned j, unsigned reclevel)
  69. {
  70. struct starpu_task *task = create_task(TAG21_AUX(k, j, reclevel));
  71. task->cl = &cl21;
  72. /* which sub-data is manipulated ? */
  73. task->buffers[0].handle = starpu_data_get_sub_data(dataA, 2, k, k);
  74. task->buffers[0].mode = STARPU_R;
  75. task->buffers[1].handle = starpu_data_get_sub_data(dataA, 2, k, j);
  76. task->buffers[1].mode = STARPU_RW;
  77. if (j == k+1) {
  78. task->priority = STARPU_MAX_PRIO;
  79. }
  80. /* enforce dependencies ... */
  81. if (k > 0) {
  82. starpu_tag_declare_deps(TAG21_AUX(k, j, reclevel), 2, TAG11_AUX(k, reclevel), TAG22_AUX(k-1, k, j, reclevel));
  83. }
  84. else {
  85. starpu_tag_declare_deps(TAG21_AUX(k, j, reclevel), 1, TAG11_AUX(k, reclevel));
  86. }
  87. starpu_task_submit(task);
  88. }
  89. static starpu_codelet cl22 =
  90. {
  91. .where = STARPU_CPU|STARPU_CUDA,
  92. .cpu_func = chol_cpu_codelet_update_u22,
  93. #ifdef STARPU_USE_CUDA
  94. .cuda_func = chol_cublas_codelet_update_u22,
  95. #endif
  96. .nbuffers = 3,
  97. .model = &chol_model_22
  98. };
  99. static void create_task_22(starpu_data_handle dataA, unsigned k, unsigned i, unsigned j, unsigned reclevel)
  100. {
  101. // printf("task 22 k,i,j = %d,%d,%d TAG = %llx\n", k,i,j, TAG22_AUX(k,i,j));
  102. struct starpu_task *task = create_task(TAG22_AUX(k, i, j, reclevel));
  103. task->cl = &cl22;
  104. /* which sub-data is manipulated ? */
  105. task->buffers[0].handle = starpu_data_get_sub_data(dataA, 2, k, i);
  106. task->buffers[0].mode = STARPU_R;
  107. task->buffers[1].handle = starpu_data_get_sub_data(dataA, 2, k, j);
  108. task->buffers[1].mode = STARPU_R;
  109. task->buffers[2].handle = starpu_data_get_sub_data(dataA, 2, i, j);
  110. task->buffers[2].mode = STARPU_RW;
  111. if ( (i == k + 1) && (j == k +1) ) {
  112. task->priority = STARPU_MAX_PRIO;
  113. }
  114. /* enforce dependencies ... */
  115. if (k > 0) {
  116. starpu_tag_declare_deps(TAG22_AUX(k, i, j, reclevel), 3, TAG22_AUX(k-1, i, j, reclevel), TAG21_AUX(k, i, reclevel), TAG21_AUX(k, j, reclevel));
  117. }
  118. else {
  119. starpu_tag_declare_deps(TAG22_AUX(k, i, j, reclevel), 2, TAG21_AUX(k, i, reclevel), TAG21_AUX(k, j, reclevel));
  120. }
  121. starpu_task_submit(task);
  122. }
  123. /*
  124. * code to bootstrap the factorization
  125. * and construct the DAG
  126. */
  127. static void _dw_cholesky_grain(float *matA, unsigned size, unsigned ld, unsigned nblocks, unsigned nbigblocks, unsigned reclevel)
  128. {
  129. /* create a new codelet */
  130. struct starpu_task *entry_task = NULL;
  131. /* create all the DAG nodes */
  132. unsigned i,j,k;
  133. starpu_data_handle dataA;
  134. /* monitor and partition the A matrix into blocks :
  135. * one block is now determined by 2 unsigned (i,j) */
  136. starpu_matrix_data_register(&dataA, 0, (uintptr_t)matA, ld, size, size, sizeof(float));
  137. starpu_data_set_sequential_consistency_flag(dataA, 0);
  138. starpu_filter f;
  139. f.filter_func = starpu_vertical_block_filter_func;
  140. f.nchildren = nblocks;
  141. f.get_nchildren = NULL;
  142. f.get_child_ops = NULL;
  143. starpu_filter f2;
  144. f2.filter_func = starpu_block_filter_func;
  145. f2.nchildren = nblocks;
  146. f2.get_nchildren = NULL;
  147. f2.get_child_ops = NULL;
  148. starpu_map_filters(dataA, 2, &f, &f2);
  149. for (k = 0; k < nbigblocks; k++)
  150. {
  151. struct starpu_task *task = create_task_11(dataA, k, reclevel);
  152. /* we defer the launch of the first task */
  153. if (k == 0) {
  154. entry_task = task;
  155. }
  156. else {
  157. starpu_task_submit(task);
  158. }
  159. for (j = k+1; j<nblocks; j++)
  160. {
  161. create_task_21(dataA, k, j, reclevel);
  162. for (i = k+1; i<nblocks; i++)
  163. {
  164. if (i <= j)
  165. create_task_22(dataA, k, i, j, reclevel);
  166. }
  167. }
  168. }
  169. /* schedule the codelet */
  170. int ret = starpu_task_submit(entry_task);
  171. if (STARPU_UNLIKELY(ret == -ENODEV))
  172. {
  173. fprintf(stderr, "No worker may execute this task\n");
  174. exit(-1);
  175. }
  176. if (nblocks == nbigblocks)
  177. {
  178. /* stall the application until the end of computations */
  179. starpu_tag_wait(TAG11_AUX(nblocks-1, reclevel));
  180. starpu_data_unpartition(dataA, 0);
  181. return;
  182. }
  183. else {
  184. STARPU_ASSERT(reclevel == 0);
  185. unsigned ndeps_tags = (nblocks - nbigblocks)*(nblocks - nbigblocks);
  186. starpu_tag_t *tag_array = malloc(ndeps_tags*sizeof(starpu_tag_t));
  187. STARPU_ASSERT(tag_array);
  188. unsigned ind = 0;
  189. for (i = nbigblocks; i < nblocks; i++)
  190. for (j = nbigblocks; j < nblocks; j++)
  191. {
  192. if (i <= j)
  193. tag_array[ind++] = TAG22_AUX(nbigblocks - 1, i, j, reclevel);
  194. }
  195. starpu_tag_wait_array(ind, tag_array);
  196. free(tag_array);
  197. starpu_data_unpartition(dataA, 0);
  198. starpu_data_unregister(dataA);
  199. float *newmatA = &matA[nbigblocks*(size/nblocks)*(ld+1)];
  200. _dw_cholesky_grain(newmatA, size/nblocks*(nblocks - nbigblocks), ld, (nblocks - nbigblocks)*2, (nblocks - nbigblocks)*2, reclevel+1);
  201. }
  202. }
  203. void initialize_system(float **A, unsigned dim, unsigned pinned)
  204. {
  205. starpu_init(NULL);
  206. starpu_helper_cublas_init();
  207. if (pinned)
  208. {
  209. starpu_data_malloc_pinned_if_possible((void **)A, dim*dim*sizeof(float));
  210. }
  211. else {
  212. *A = malloc(dim*dim*sizeof(float));
  213. }
  214. }
  215. void dw_cholesky_grain(float *matA, unsigned size, unsigned ld, unsigned nblocks, unsigned nbigblocks)
  216. {
  217. struct timeval start;
  218. struct timeval end;
  219. gettimeofday(&start, NULL);
  220. _dw_cholesky_grain(matA, size, ld, nblocks, nbigblocks, 0);
  221. gettimeofday(&end, NULL);
  222. double timing = (double)((end.tv_sec - start.tv_sec)*1000000 + (end.tv_usec - start.tv_usec));
  223. fprintf(stderr, "Computation took (in ms)\n");
  224. printf("%2.2f\n", timing/1000);
  225. double flop = (1.0f*size*size*size)/3.0f;
  226. fprintf(stderr, "Synthetic GFlops : %2.2f\n", (flop/timing/1000.0f));
  227. starpu_helper_cublas_shutdown();
  228. starpu_shutdown();
  229. }
  230. int main(int argc, char **argv)
  231. {
  232. /* create a simple definite positive symetric matrix example
  233. *
  234. * Hilbert matrix : h(i,j) = 1/(i+j+1)
  235. * */
  236. parse_args(argc, argv);
  237. float *mat;
  238. mat = malloc(size*size*sizeof(float));
  239. initialize_system(&mat, size, pinned);
  240. unsigned i,j;
  241. for (i = 0; i < size; i++)
  242. {
  243. for (j = 0; j < size; j++)
  244. {
  245. mat[j +i*size] = (1.0f/(1.0f+i+j)) + ((i == j)?1.0f*size:0.0f);
  246. //mat[j +i*size] = ((i == j)?1.0f*size:0.0f);
  247. }
  248. }
  249. #ifdef CHECK_OUTPUT
  250. printf("Input :\n");
  251. for (j = 0; j < size; j++)
  252. {
  253. for (i = 0; i < size; i++)
  254. {
  255. if (i <= j) {
  256. printf("%2.2f\t", mat[j +i*size]);
  257. }
  258. else {
  259. printf(".\t");
  260. }
  261. }
  262. printf("\n");
  263. }
  264. #endif
  265. dw_cholesky_grain(mat, size, size, nblocks, nbigblocks);
  266. #ifdef CHECK_OUTPUT
  267. printf("Results :\n");
  268. for (j = 0; j < size; j++)
  269. {
  270. for (i = 0; i < size; i++)
  271. {
  272. if (i <= j) {
  273. printf("%2.2f\t", mat[j +i*size]);
  274. }
  275. else {
  276. printf(".\t");
  277. mat[j+i*size] = 0.0f; // debug
  278. }
  279. }
  280. printf("\n");
  281. }
  282. fprintf(stderr, "compute explicit LLt ...\n");
  283. float *test_mat = malloc(size*size*sizeof(float));
  284. STARPU_ASSERT(test_mat);
  285. SSYRK("L", "N", size, size, 1.0f,
  286. mat, size, 0.0f, test_mat, size);
  287. fprintf(stderr, "comparing results ...\n");
  288. for (j = 0; j < size; j++)
  289. {
  290. for (i = 0; i < size; i++)
  291. {
  292. if (i <= j) {
  293. printf("%2.2f\t", test_mat[j +i*size]);
  294. }
  295. else {
  296. printf(".\t");
  297. }
  298. }
  299. printf("\n");
  300. }
  301. #endif
  302. return 0;
  303. }