cholesky_implicit.c 7.0 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294
  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. * Create the codelets
  21. */
  22. static starpu_codelet cl11 =
  23. {
  24. .where = STARPU_CPU|STARPU_CUDA,
  25. .type = STARPU_SEQ,
  26. .cpu_func = chol_cpu_codelet_update_u11,
  27. #ifdef STARPU_USE_CUDA
  28. .cuda_func = chol_cublas_codelet_update_u11,
  29. #endif
  30. .nbuffers = 1,
  31. .model = &chol_model_11
  32. };
  33. static starpu_codelet cl21 =
  34. {
  35. .where = STARPU_CPU|STARPU_CUDA,
  36. .type = STARPU_SEQ,
  37. .cpu_func = chol_cpu_codelet_update_u21,
  38. #ifdef STARPU_USE_CUDA
  39. .cuda_func = chol_cublas_codelet_update_u21,
  40. #endif
  41. .nbuffers = 2,
  42. .model = &chol_model_21
  43. };
  44. static starpu_codelet cl22 =
  45. {
  46. .where = STARPU_CPU|STARPU_CUDA,
  47. .type = STARPU_SEQ,
  48. .max_parallelism = INT_MAX,
  49. .cpu_func = chol_cpu_codelet_update_u22,
  50. #ifdef STARPU_USE_CUDA
  51. .cuda_func = chol_cublas_codelet_update_u22,
  52. #endif
  53. .nbuffers = 3,
  54. .model = &chol_model_22
  55. };
  56. /*
  57. * code to bootstrap the factorization
  58. * and construct the DAG
  59. */
  60. static void callback_turn_spmd_on(void *arg __attribute__ ((unused)))
  61. {
  62. cl22.type = STARPU_SPMD;
  63. }
  64. static double _cholesky(starpu_data_handle dataA, unsigned nblocks, unsigned sched_ctx, double *timing)
  65. {
  66. struct timeval start;
  67. struct timeval end;
  68. unsigned i,j,k;
  69. int prio_level = noprio?STARPU_DEFAULT_PRIO:STARPU_MAX_PRIO;
  70. gettimeofday(&start, NULL);
  71. /* create all the DAG nodes */
  72. for (k = 0; k < nblocks; k++)
  73. {
  74. starpu_data_handle sdatakk = starpu_data_get_sub_data(dataA, 2, k, k);
  75. starpu_insert_task(&cl11,
  76. STARPU_PRIORITY, prio_level,
  77. STARPU_RW, sdatakk,
  78. STARPU_CALLBACK, (k == 3*nblocks/4)?callback_turn_spmd_on:NULL,
  79. STARPU_CTX, sched_ctx,
  80. 0);
  81. for (j = k+1; j<nblocks; j++)
  82. {
  83. starpu_data_handle sdatakj = starpu_data_get_sub_data(dataA, 2, k, j);
  84. starpu_insert_task(&cl21,
  85. STARPU_PRIORITY, (j == k+1)?prio_level:STARPU_DEFAULT_PRIO,
  86. STARPU_R, sdatakk,
  87. STARPU_RW, sdatakj,
  88. STARPU_CTX, sched_ctx,
  89. 0);
  90. for (i = k+1; i<nblocks; i++)
  91. {
  92. if (i <= j)
  93. {
  94. starpu_data_handle sdataki = starpu_data_get_sub_data(dataA, 2, k, i);
  95. starpu_data_handle sdataij = starpu_data_get_sub_data(dataA, 2, i, j);
  96. starpu_insert_task(&cl22,
  97. STARPU_PRIORITY, ((i == k+1) && (j == k+1))?prio_level:STARPU_DEFAULT_PRIO,
  98. STARPU_R, sdataki,
  99. STARPU_R, sdatakj,
  100. STARPU_RW, sdataij,
  101. STARPU_CTX, sched_ctx,
  102. 0);
  103. }
  104. }
  105. }
  106. }
  107. if(sched_ctx != 0)
  108. starpu_wait_for_all_tasks_of_sched_ctx(sched_ctx);
  109. else
  110. starpu_task_wait_for_all();
  111. starpu_data_unpartition(dataA, 0);
  112. gettimeofday(&end, NULL);
  113. (*timing) = (double)((end.tv_sec - start.tv_sec)*1000000 + (end.tv_usec - start.tv_usec));
  114. unsigned long n = starpu_matrix_get_nx(dataA);
  115. double flop = (1.0f*n*n*n)/3.0f;
  116. double gflops = (flop/(*timing)/1000.0f);
  117. (*timing) /= 1000000.0f; //sec
  118. // (*timing) /= 60.0f; //min
  119. return gflops;
  120. }
  121. static double cholesky(float *matA, unsigned size, unsigned ld, unsigned nblocks, unsigned sched_ctx, double *timing)
  122. {
  123. starpu_data_handle dataA;
  124. /* monitor and partition the A matrix into blocks :
  125. * one block is now determined by 2 unsigned (i,j) */
  126. starpu_matrix_data_register(&dataA, 0, (uintptr_t)matA, ld, size, size, sizeof(float));
  127. struct starpu_data_filter f = {
  128. .filter_func = starpu_vertical_block_filter_func,
  129. .nchildren = nblocks
  130. };
  131. struct starpu_data_filter f2 = {
  132. .filter_func = starpu_block_filter_func,
  133. .nchildren = nblocks
  134. };
  135. starpu_data_map_filters(dataA, 2, &f, &f2);
  136. double gflops = _cholesky(dataA, nblocks, sched_ctx, timing);
  137. starpu_data_unregister(dataA);
  138. return gflops;
  139. }
  140. double run_cholesky_implicit(unsigned sched_ctx, int start, int argc, char **argv, double *timing, pthread_barrier_t *barrier)
  141. {
  142. /* create a simple definite positive symetric matrix example
  143. *
  144. * Hilbert matrix : h(i,j) = 1/(i+j+1)
  145. * */
  146. unsigned size = 4 * 1024;
  147. unsigned nblocks = 16;
  148. parse_args_ctx(start, argc, argv, &size, &nblocks);
  149. // starpu_init(NULL);
  150. // starpu_helper_cublas_init();
  151. float *mat;
  152. starpu_malloc((void **)&mat, (size_t)size*size*sizeof(float));
  153. unsigned i,j;
  154. for (i = 0; i < size; i++)
  155. {
  156. for (j = 0; j < size; j++)
  157. {
  158. mat[j +i*size] = (1.0f/(1.0f+i+j)) + ((i == j)?1.0f*size:0.0f);
  159. //mat[j +i*size] = ((i == j)?1.0f*size:0.0f);
  160. }
  161. }
  162. //#define PRINT_OUTPUT
  163. #ifdef PRINT_OUTPUT
  164. printf("Input :\n");
  165. for (j = 0; j < size; j++)
  166. {
  167. for (i = 0; i < size; i++)
  168. {
  169. if (i <= j) {
  170. printf("%2.2f\t", mat[j +i*size]);
  171. }
  172. else {
  173. printf(".\t");
  174. }
  175. }
  176. printf("\n");
  177. }
  178. #endif
  179. // if(barrier != NULL)
  180. // pthread_barrier_wait(barrier);
  181. double gflops = cholesky(mat, size, size, nblocks, sched_ctx, timing);
  182. #ifdef PRINT_OUTPUT
  183. printf("Results :\n");
  184. for (j = 0; j < size; j++)
  185. {
  186. for (i = 0; i < size; i++)
  187. {
  188. if (i <= j) {
  189. printf("%2.2f\t", mat[j +i*size]);
  190. }
  191. else {
  192. printf(".\t");
  193. mat[j+i*size] = 0.0f; // debug
  194. }
  195. }
  196. printf("\n");
  197. }
  198. #endif
  199. if (check)
  200. {
  201. fprintf(stderr, "compute explicit LLt ...\n");
  202. for (j = 0; j < size; j++)
  203. {
  204. for (i = 0; i < size; i++)
  205. {
  206. if (i > j) {
  207. mat[j+i*size] = 0.0f; // debug
  208. }
  209. }
  210. }
  211. float *test_mat = malloc(size*size*sizeof(float));
  212. STARPU_ASSERT(test_mat);
  213. SSYRK("L", "N", size, size, 1.0f,
  214. mat, size, 0.0f, test_mat, size);
  215. fprintf(stderr, "comparing results ...\n");
  216. #ifdef PRINT_OUTPUT
  217. for (j = 0; j < size; j++)
  218. {
  219. for (i = 0; i < size; i++)
  220. {
  221. if (i <= j) {
  222. printf("%2.2f\t", test_mat[j +i*size]);
  223. }
  224. else {
  225. printf(".\t");
  226. }
  227. }
  228. printf("\n");
  229. }
  230. #endif
  231. for (j = 0; j < size; j++)
  232. {
  233. for (i = 0; i < size; i++)
  234. {
  235. if (i <= j) {
  236. float orig = (1.0f/(1.0f+i+j)) + ((i == j)?1.0f*size:0.0f);
  237. float err = abs(test_mat[j +i*size] - orig);
  238. if (err > 0.00001) {
  239. fprintf(stderr, "Error[%d, %d] --> %2.2f != %2.2f (err %2.2f)\n", i, j, test_mat[j +i*size], orig, err);
  240. assert(0);
  241. }
  242. }
  243. }
  244. }
  245. }
  246. starpu_free((void *)mat);
  247. // starpu_helper_cublas_shutdown();
  248. // starpu_shutdown();
  249. return gflops;
  250. }