cholesky_tag.c 9.5 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412413414415416417418419420421422423424425426427428429430431432433
  1. /* StarPU --- Runtime system for heterogeneous multicore architectures.
  2. *
  3. * Copyright (C) 2009-2013 Université de Bordeaux 1
  4. * Copyright (C) 2010 Mehdi Juhoor <mjuhoor@gmail.com>
  5. * Copyright (C) 2010, 2011, 2012, 2013 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. #include <starpu_perfmodel.h>
  20. struct starpu_perfmodel chol_model_11;
  21. struct starpu_perfmodel chol_model_21;
  22. struct starpu_perfmodel chol_model_22;
  23. /*
  24. * Some useful functions
  25. */
  26. static struct starpu_task *create_task(starpu_tag_t id)
  27. {
  28. struct starpu_task *task = starpu_task_create();
  29. task->cl_arg = NULL;
  30. task->use_tag = 1;
  31. task->tag_id = id;
  32. return task;
  33. }
  34. /*
  35. * Create the codelets
  36. */
  37. static struct starpu_codelet cl11 =
  38. {
  39. .modes = { STARPU_RW },
  40. .cpu_funcs = {chol_cpu_codelet_update_u11, NULL},
  41. #ifdef STARPU_USE_CUDA
  42. .cuda_funcs = {chol_cublas_codelet_update_u11, NULL},
  43. #endif
  44. .nbuffers = 1,
  45. .model = &chol_model_11
  46. };
  47. static struct starpu_task * create_task_11(starpu_data_handle_t dataA, unsigned k)
  48. {
  49. /* FPRINTF(stdout, "task 11 k = %d TAG = %llx\n", k, (TAG11(k))); */
  50. struct starpu_task *task = create_task(TAG11(k));
  51. task->cl = &cl11;
  52. /* which sub-data is manipulated ? */
  53. task->handles[0] = starpu_data_get_sub_data(dataA, 2, k, k);
  54. /* this is an important task */
  55. if (!noprio)
  56. task->priority = STARPU_MAX_PRIO;
  57. /* enforce dependencies ... */
  58. if (k > 0)
  59. {
  60. starpu_tag_declare_deps(TAG11(k), 1, TAG22(k-1, k, k));
  61. }
  62. int n = starpu_matrix_get_nx(task->handles[0]);
  63. task->flops = FLOPS_SPOTRF(n);
  64. return task;
  65. }
  66. static struct starpu_codelet cl21 =
  67. {
  68. .modes = { STARPU_R, STARPU_RW },
  69. .cpu_funcs = {chol_cpu_codelet_update_u21, NULL},
  70. #ifdef STARPU_USE_CUDA
  71. .cuda_funcs = {chol_cublas_codelet_update_u21, NULL},
  72. #endif
  73. .nbuffers = 2,
  74. .model = &chol_model_21
  75. };
  76. static void create_task_21(starpu_data_handle_t dataA, unsigned k, unsigned j)
  77. {
  78. struct starpu_task *task = create_task(TAG21(k, j));
  79. task->cl = &cl21;
  80. /* which sub-data is manipulated ? */
  81. task->handles[0] = starpu_data_get_sub_data(dataA, 2, k, k);
  82. task->handles[1] = starpu_data_get_sub_data(dataA, 2, k, j);
  83. if (!noprio && (j == k+1))
  84. {
  85. task->priority = STARPU_MAX_PRIO;
  86. }
  87. /* enforce dependencies ... */
  88. if (k > 0)
  89. {
  90. starpu_tag_declare_deps(TAG21(k, j), 2, TAG11(k), TAG22(k-1, k, j));
  91. }
  92. else
  93. {
  94. starpu_tag_declare_deps(TAG21(k, j), 1, TAG11(k));
  95. }
  96. int n = starpu_matrix_get_nx(task->handles[0]);
  97. task->flops = FLOPS_STRSM(n, n);
  98. int ret = starpu_task_submit(task);
  99. if (STARPU_UNLIKELY(ret == -ENODEV))
  100. {
  101. FPRINTF(stderr, "No worker may execute this task\n");
  102. exit(0);
  103. }
  104. }
  105. static struct starpu_codelet cl22 =
  106. {
  107. .modes = { STARPU_R, STARPU_R, STARPU_RW },
  108. .cpu_funcs = {chol_cpu_codelet_update_u22, NULL},
  109. #ifdef STARPU_USE_CUDA
  110. .cuda_funcs = {chol_cublas_codelet_update_u22, NULL},
  111. #endif
  112. .nbuffers = 3,
  113. .model = &chol_model_22
  114. };
  115. static void create_task_22(starpu_data_handle_t dataA, unsigned k, unsigned i, unsigned j)
  116. {
  117. /* FPRINTF(stdout, "task 22 k,i,j = %d,%d,%d TAG = %llx\n", k,i,j, TAG22(k,i,j)); */
  118. struct starpu_task *task = create_task(TAG22(k, i, j));
  119. task->cl = &cl22;
  120. /* which sub-data is manipulated ? */
  121. task->handles[0] = starpu_data_get_sub_data(dataA, 2, k, i);
  122. task->handles[1] = starpu_data_get_sub_data(dataA, 2, k, j);
  123. task->handles[2] = starpu_data_get_sub_data(dataA, 2, i, j);
  124. if (!noprio && (i == k + 1) && (j == k +1) )
  125. {
  126. task->priority = STARPU_MAX_PRIO;
  127. }
  128. /* enforce dependencies ... */
  129. if (k > 0)
  130. {
  131. starpu_tag_declare_deps(TAG22(k, i, j), 3, TAG22(k-1, i, j), TAG21(k, i), TAG21(k, j));
  132. }
  133. else
  134. {
  135. starpu_tag_declare_deps(TAG22(k, i, j), 2, TAG21(k, i), TAG21(k, j));
  136. }
  137. int n = starpu_matrix_get_nx(task->handles[0]);
  138. task->flops = FLOPS_SGEMM(n, n, n);
  139. int ret = starpu_task_submit(task);
  140. if (STARPU_UNLIKELY(ret == -ENODEV))
  141. {
  142. FPRINTF(stderr, "No worker may execute this task\n");
  143. exit(0);
  144. }
  145. }
  146. /*
  147. * code to bootstrap the factorization
  148. * and construct the DAG
  149. */
  150. static void _cholesky(starpu_data_handle_t dataA, unsigned nblocks)
  151. {
  152. double start;
  153. double end;
  154. struct starpu_task *entry_task = NULL;
  155. /* create all the DAG nodes */
  156. unsigned i,j,k;
  157. start = starpu_timing_now();
  158. for (k = 0; k < nblocks; k++)
  159. {
  160. struct starpu_task *task = create_task_11(dataA, k);
  161. /* we defer the launch of the first task */
  162. if (k == 0)
  163. {
  164. entry_task = task;
  165. }
  166. else
  167. {
  168. int ret = starpu_task_submit(task);
  169. if (STARPU_UNLIKELY(ret == -ENODEV))
  170. {
  171. FPRINTF(stderr, "No worker may execute this task\n");
  172. exit(0);
  173. }
  174. }
  175. for (j = k+1; j<nblocks; j++)
  176. {
  177. create_task_21(dataA, k, j);
  178. for (i = k+1; i<nblocks; i++)
  179. {
  180. if (i <= j)
  181. create_task_22(dataA, k, i, j);
  182. }
  183. }
  184. }
  185. /* schedule the codelet */
  186. int ret = starpu_task_submit(entry_task);
  187. if (STARPU_UNLIKELY(ret == -ENODEV))
  188. {
  189. FPRINTF(stderr, "No worker may execute this task\n");
  190. exit(0);
  191. }
  192. /* stall the application until the end of computations */
  193. starpu_tag_wait(TAG11(nblocks-1));
  194. starpu_data_unpartition(dataA, STARPU_MAIN_RAM);
  195. end = starpu_timing_now();
  196. double timing = end - start;
  197. FPRINTF(stderr, "Computation took (in ms)\n");
  198. FPRINTF(stdout, "%2.2f\n", timing/1000);
  199. unsigned n = starpu_matrix_get_nx(dataA);
  200. double flop = (1.0f*n*n*n)/3.0f;
  201. FPRINTF(stderr, "Synthetic GFlops : %2.2f\n", (flop/timing/1000.0f));
  202. }
  203. static int initialize_system(float **A, unsigned dim, unsigned pinned)
  204. {
  205. int ret;
  206. ret = starpu_init(NULL);
  207. if (ret == -ENODEV)
  208. return 77;
  209. STARPU_CHECK_RETURN_VALUE(ret, "starpu_init");
  210. #ifdef STARPU_USE_CUDA
  211. initialize_chol_model(&chol_model_11,"chol_model_11",cpu_chol_task_11_cost,cuda_chol_task_11_cost);
  212. initialize_chol_model(&chol_model_21,"chol_model_21",cpu_chol_task_21_cost,cuda_chol_task_21_cost);
  213. initialize_chol_model(&chol_model_22,"chol_model_22",cpu_chol_task_22_cost,cuda_chol_task_22_cost);
  214. #else
  215. initialize_chol_model(&chol_model_11,"chol_model_11",cpu_chol_task_11_cost,NULL);
  216. initialize_chol_model(&chol_model_21,"chol_model_21",cpu_chol_task_21_cost,NULL);
  217. initialize_chol_model(&chol_model_22,"chol_model_22",cpu_chol_task_22_cost,NULL);
  218. #endif
  219. starpu_cublas_init();
  220. #ifndef STARPU_SIMGRID
  221. if (pinned)
  222. {
  223. starpu_malloc((void **)A, (size_t)dim*dim*sizeof(float));
  224. }
  225. else
  226. {
  227. *A = malloc(dim*dim*sizeof(float));
  228. }
  229. #endif
  230. return 0;
  231. }
  232. static void cholesky(float *matA, unsigned size, unsigned ld, unsigned nblocks)
  233. {
  234. starpu_data_handle_t dataA;
  235. /* monitor and partition the A matrix into blocks :
  236. * one block is now determined by 2 unsigned (i,j) */
  237. starpu_matrix_data_register(&dataA, STARPU_MAIN_RAM, (uintptr_t)matA, ld, size, size, sizeof(float));
  238. starpu_data_set_sequential_consistency_flag(dataA, 0);
  239. struct starpu_data_filter f =
  240. {
  241. .filter_func = starpu_matrix_filter_vertical_block,
  242. .nchildren = nblocks
  243. };
  244. struct starpu_data_filter f2 =
  245. {
  246. .filter_func = starpu_matrix_filter_block,
  247. .nchildren = nblocks
  248. };
  249. starpu_data_map_filters(dataA, 2, &f, &f2);
  250. _cholesky(dataA, nblocks);
  251. starpu_data_unregister(dataA);
  252. }
  253. static void shutdown_system(float **matA, unsigned pinned)
  254. {
  255. if (pinned)
  256. {
  257. starpu_free(*matA);
  258. }
  259. else
  260. {
  261. free(*matA);
  262. }
  263. starpu_cublas_shutdown();
  264. starpu_shutdown();
  265. }
  266. int main(int argc, char **argv)
  267. {
  268. /* create a simple definite positive symetric matrix example
  269. *
  270. * Hilbert matrix : h(i,j) = 1/(i+j+1)
  271. * */
  272. parse_args(argc, argv);
  273. float *mat = NULL;
  274. int ret = initialize_system(&mat, size, pinned);
  275. if (ret) return ret;
  276. #ifndef STARPU_SIMGRID
  277. unsigned i,j;
  278. for (i = 0; i < size; i++)
  279. {
  280. for (j = 0; j < size; j++)
  281. {
  282. mat[j +i*size] = (1.0f/(1.0f+i+j)) + ((i == j)?1.0f*size:0.0f);
  283. /* mat[j +i*size] = ((i == j)?1.0f*size:0.0f); */
  284. }
  285. }
  286. #endif
  287. #ifdef CHECK_OUTPUT
  288. FPRINTF(stdout, "Input :\n");
  289. for (j = 0; j < size; j++)
  290. {
  291. for (i = 0; i < size; i++)
  292. {
  293. if (i <= j)
  294. {
  295. FPRINTF(stdout, "%2.2f\t", mat[j +i*size]);
  296. }
  297. else
  298. {
  299. FPRINTF(stdout, ".\t");
  300. }
  301. }
  302. FPRINTF(stdout, "\n");
  303. }
  304. #endif
  305. cholesky(mat, size, size, nblocks);
  306. #ifdef CHECK_OUTPUT
  307. FPRINTF(stdout, "Results :\n");
  308. for (j = 0; j < size; j++)
  309. {
  310. for (i = 0; i < size; i++)
  311. {
  312. if (i <= j)
  313. {
  314. FPRINTF(stdout, "%2.2f\t", mat[j +i*size]);
  315. }
  316. else
  317. {
  318. FPRINTF(stdout, ".\t");
  319. mat[j+i*size] = 0.0f; /* debug */
  320. }
  321. }
  322. FPRINTF(stdout, "\n");
  323. }
  324. FPRINTF(stderr, "compute explicit LLt ...\n");
  325. float *test_mat = malloc(size*size*sizeof(float));
  326. STARPU_ASSERT(test_mat);
  327. SSYRK("L", "N", size, size, 1.0f,
  328. mat, size, 0.0f, test_mat, size);
  329. FPRINTF(stderr, "comparing results ...\n");
  330. for (j = 0; j < size; j++)
  331. {
  332. for (i = 0; i < size; i++)
  333. {
  334. if (i <= j)
  335. {
  336. FPRINTF(stdout, "%2.2f\t", test_mat[j +i*size]);
  337. }
  338. else
  339. {
  340. FPRINTF(stdout, ".\t");
  341. }
  342. }
  343. FPRINTF(stdout, "\n");
  344. }
  345. free(test_mat);
  346. #endif
  347. shutdown_system(&mat, pinned);
  348. return 0;
  349. }