cholesky_implicit.c 7.1 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284
  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 void _cholesky(starpu_data_handle dataA, unsigned nblocks)
  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. 0);
  80. for (j = k+1; j<nblocks; j++)
  81. {
  82. starpu_data_handle sdatakj = starpu_data_get_sub_data(dataA, 2, k, j);
  83. starpu_insert_task(&cl21,
  84. STARPU_PRIORITY, (j == k+1)?prio_level:STARPU_DEFAULT_PRIO,
  85. STARPU_R, sdatakk,
  86. STARPU_RW, sdatakj,
  87. 0);
  88. for (i = k+1; i<nblocks; i++)
  89. {
  90. if (i <= j)
  91. {
  92. starpu_data_handle sdataki = starpu_data_get_sub_data(dataA, 2, k, i);
  93. starpu_data_handle sdataij = starpu_data_get_sub_data(dataA, 2, i, j);
  94. starpu_insert_task(&cl22,
  95. STARPU_PRIORITY, ((i == k+1) && (j == k+1))?prio_level:STARPU_DEFAULT_PRIO,
  96. STARPU_R, sdataki,
  97. STARPU_R, sdatakj,
  98. STARPU_RW, sdataij,
  99. 0);
  100. }
  101. }
  102. }
  103. }
  104. starpu_task_wait_for_all();
  105. starpu_data_unpartition(dataA, 0);
  106. gettimeofday(&end, NULL);
  107. double timing = (double)((end.tv_sec - start.tv_sec)*1000000 + (end.tv_usec - start.tv_usec));
  108. FPRINTF(stderr, "Computation took (in ms)\n");
  109. FPRINTF(stdout, "%2.2f\n", timing/1000);
  110. unsigned long n = starpu_matrix_get_nx(dataA);
  111. double flop = (1.0f*n*n*n)/3.0f;
  112. FPRINTF(stderr, "Synthetic GFlops : %2.2f\n", (flop/timing/1000.0f));
  113. }
  114. static void cholesky(float *matA, unsigned size, unsigned ld, unsigned nblocks)
  115. {
  116. starpu_data_handle dataA;
  117. /* monitor and partition the A matrix into blocks :
  118. * one block is now determined by 2 unsigned (i,j) */
  119. starpu_matrix_data_register(&dataA, 0, (uintptr_t)matA, ld, size, size, sizeof(float));
  120. struct starpu_data_filter f;
  121. f.filter_func = starpu_vertical_block_filter_func;
  122. f.nchildren = nblocks;
  123. f.get_nchildren = NULL;
  124. f.get_child_ops = NULL;
  125. struct starpu_data_filter f2;
  126. f2.filter_func = starpu_block_filter_func;
  127. f2.nchildren = nblocks;
  128. f2.get_nchildren = NULL;
  129. f2.get_child_ops = NULL;
  130. starpu_data_map_filters(dataA, 2, &f, &f2);
  131. _cholesky(dataA, nblocks);
  132. }
  133. int main(int argc, char **argv)
  134. {
  135. /* create a simple definite positive symetric matrix example
  136. *
  137. * Hilbert matrix : h(i,j) = 1/(i+j+1)
  138. * */
  139. parse_args(argc, argv);
  140. starpu_init(NULL);
  141. starpu_helper_cublas_init();
  142. float *mat;
  143. starpu_data_malloc_pinned_if_possible((void **)&mat, (size_t)size*size*sizeof(float));
  144. unsigned i,j;
  145. for (i = 0; i < size; i++)
  146. {
  147. for (j = 0; j < size; j++)
  148. {
  149. mat[j +i*size] = (1.0f/(1.0f+i+j)) + ((i == j)?1.0f*size:0.0f);
  150. //mat[j +i*size] = ((i == j)?1.0f*size:0.0f);
  151. }
  152. }
  153. //#define PRINT_OUTPUT
  154. #ifdef PRINT_OUTPUT
  155. FPRINTF(stdout, "Input :\n");
  156. for (j = 0; j < size; j++)
  157. {
  158. for (i = 0; i < size; i++)
  159. {
  160. if (i <= j) {
  161. FPRINTF(stdout, "%2.2f\t", mat[j +i*size]);
  162. }
  163. else {
  164. FPRINTF(stdout, ".\t");
  165. }
  166. }
  167. FPRINTF(stdout, "\n");
  168. }
  169. #endif
  170. cholesky(mat, size, size, nblocks);
  171. #ifdef PRINT_OUTPUT
  172. FPRINTF(stdout, "Results :\n");
  173. for (j = 0; j < size; j++)
  174. {
  175. for (i = 0; i < size; i++)
  176. {
  177. if (i <= j) {
  178. FPRINTF(stdout, "%2.2f\t", mat[j +i*size]);
  179. }
  180. else {
  181. FPRINTF(stdout, ".\t");
  182. mat[j+i*size] = 0.0f; // debug
  183. }
  184. }
  185. FPRINTF(stdout, "\n");
  186. }
  187. #endif
  188. if (check)
  189. {
  190. FPRINTF(stderr, "compute explicit LLt ...\n");
  191. for (j = 0; j < size; j++)
  192. {
  193. for (i = 0; i < size; i++)
  194. {
  195. if (i > j) {
  196. mat[j+i*size] = 0.0f; // debug
  197. }
  198. }
  199. }
  200. float *test_mat = malloc(size*size*sizeof(float));
  201. STARPU_ASSERT(test_mat);
  202. SSYRK("L", "N", size, size, 1.0f,
  203. mat, size, 0.0f, test_mat, size);
  204. FPRINTF(stderr, "comparing results ...\n");
  205. #ifdef PRINT_OUTPUT
  206. for (j = 0; j < size; j++)
  207. {
  208. for (i = 0; i < size; i++)
  209. {
  210. if (i <= j) {
  211. FPRINTF(stdout, "%2.2f\t", test_mat[j +i*size]);
  212. }
  213. else {
  214. FPRINTF(stdout, ".\t");
  215. }
  216. }
  217. FPRINTF(stdout, "\n");
  218. }
  219. #endif
  220. for (j = 0; j < size; j++)
  221. {
  222. for (i = 0; i < size; i++)
  223. {
  224. if (i <= j) {
  225. float orig = (1.0f/(1.0f+i+j)) + ((i == j)?1.0f*size:0.0f);
  226. float err = abs(test_mat[j +i*size] - orig);
  227. if (err > 0.00001) {
  228. FPRINTF(stderr, "Error[%d, %d] --> %2.2f != %2.2f (err %2.2f)\n", i, j, test_mat[j +i*size], orig, err);
  229. assert(0);
  230. }
  231. }
  232. }
  233. }
  234. }
  235. starpu_helper_cublas_shutdown();
  236. starpu_shutdown();
  237. return 0;
  238. }