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