cholesky_tag.c 8.7 KB

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