cholesky_tag.c 8.8 KB

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