dw_factolu.c 20 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412413414415416417418419420421422423424425426427428429430431432433434435436437438439440441442443444445446447448449450451452453454455456457458459460461462463464465466467468469470471472473474475476477478479480481482483484485486487488489490491492493494495496497498499500501502503504505506507508509510511512513514515516517518519520521522523524525526527528529530531532533534535536537538539540541542543544545546547548549550551552553554555556557558559560561562563564565566567568569570571572573574575576577578579580581582583584585586587588589590591592593594595596597598599600601602603604605606607608609610611612613614615616617618619620621622623624625626627628629630631632633634635636637638639640641642643644645646647648649650651652653654655656657658659660661662663664665666667668669670671672673674675676677678679680681682683684685686687688689690691692693694695696697698699700701702703704705706707708709710711712713714715716717718719720721722723724725726727728729730731732733734735736737738739740741742743744745746747748749750751752753754755756757758759760761762763764765766767768769770771772773774775776777778779780781782783784785
  1. /* StarPU --- Runtime system for heterogeneous multicore architectures.
  2. *
  3. * Copyright (C) 2009-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 "dw_factolu.h"
  19. #include <sys/time.h>
  20. uint8_t *advance_12_21; /* size nblocks*nblocks */
  21. uint8_t *advance_11; /* size nblocks*nblocks */
  22. uint8_t *advance_22; /* array of nblocks *nblocks*nblocks */
  23. struct timeval start;
  24. struct timeval end;
  25. static pthread_mutex_t mutex = PTHREAD_MUTEX_INITIALIZER;
  26. static pthread_cond_t cond = PTHREAD_COND_INITIALIZER;
  27. static unsigned finished = 0;
  28. static unsigned no_prio = 0;
  29. static struct starpu_codelet cl11 =
  30. {
  31. .where = STARPU_CPU|STARPU_CUDA,
  32. .cpu_funcs = {dw_cpu_codelet_update_u11, NULL},
  33. #ifdef STARPU_USE_CUDA
  34. .cuda_funcs = {dw_cublas_codelet_update_u11, NULL},
  35. #endif
  36. .nbuffers = 1,
  37. .model = &model_11
  38. };
  39. static struct starpu_codelet cl12 =
  40. {
  41. .where = STARPU_CPU|STARPU_CUDA,
  42. .cpu_funcs = {dw_cpu_codelet_update_u12, NULL},
  43. #ifdef STARPU_USE_CUDA
  44. .cuda_funcs = {dw_cublas_codelet_update_u12, NULL},
  45. #endif
  46. .nbuffers = 2,
  47. .model = &model_12
  48. };
  49. static struct starpu_codelet cl21 =
  50. {
  51. .where = STARPU_CPU|STARPU_CUDA,
  52. .cpu_funcs = {dw_cpu_codelet_update_u21, NULL},
  53. #ifdef STARPU_USE_CUDA
  54. .cuda_funcs = {dw_cublas_codelet_update_u21, NULL},
  55. #endif
  56. .nbuffers = 2,
  57. .model = &model_21
  58. };
  59. static struct starpu_codelet cl22 =
  60. {
  61. .where = STARPU_CPU|STARPU_CUDA,
  62. .cpu_funcs = {dw_cpu_codelet_update_u22, NULL},
  63. #ifdef STARPU_USE_CUDA
  64. .cuda_funcs = {dw_cublas_codelet_update_u22, NULL},
  65. #endif
  66. .nbuffers = 3,
  67. .model = &model_22
  68. };
  69. #define STARTED 0x01
  70. #define DONE 0x10
  71. /*
  72. * Upgraded Callbacks : break the pipeline design !
  73. */
  74. void dw_callback_v2_codelet_update_u22(void *argcb)
  75. {
  76. cl_args *args = argcb;
  77. unsigned k = args->k;
  78. unsigned i = args->i;
  79. unsigned j = args->j;
  80. unsigned nblocks = args->nblocks;
  81. /* we did task 22k,i,j */
  82. advance_22[k*nblocks*nblocks + i + j*nblocks] = DONE;
  83. if ( (i == j) && (i == k+1))
  84. {
  85. /* we now reduce the LU22 part (recursion appears there) */
  86. cl_args *u11arg = malloc(sizeof(cl_args));
  87. struct starpu_task *task = starpu_task_create();
  88. task->callback_func = dw_callback_v2_codelet_update_u11;
  89. task->callback_arg = u11arg;
  90. task->cl = &cl11;
  91. task->cl_arg = u11arg;
  92. task->buffers[0].handle =
  93. starpu_data_get_sub_data(args->dataA, 2, k+1, k+1);
  94. task->buffers[0].mode = STARPU_RW;
  95. u11arg->dataA = args->dataA;
  96. u11arg->i = k + 1;
  97. u11arg->nblocks = args->nblocks;
  98. /* schedule the codelet */
  99. if (!no_prio)
  100. task->priority = STARPU_MAX_PRIO;
  101. starpu_task_submit(task);
  102. }
  103. /* 11k+1 + 22k,k+1,j => 21 k+1,j */
  104. if ( i == k + 1)
  105. {
  106. uint8_t dep;
  107. /* 11 k+1*/
  108. dep = advance_11[(k+1)];
  109. if (dep & DONE)
  110. {
  111. /* try to push the task */
  112. uint8_t u = STARPU_ATOMIC_OR(&advance_12_21[(k+1) + j*nblocks], STARTED);
  113. if ((u & STARTED) == 0)
  114. {
  115. /* we are the only one that should
  116. * launch that task */
  117. cl_args *u21a = malloc(sizeof(cl_args));
  118. struct starpu_task *task21 = starpu_task_create();
  119. task21->callback_func = dw_callback_v2_codelet_update_u21;
  120. task21->callback_arg = u21a;
  121. task21->cl = &cl21;
  122. task21->cl_arg = u21a;
  123. u21a->i = k+1;
  124. u21a->k = j;
  125. u21a->nblocks = args->nblocks;
  126. u21a->dataA = args->dataA;
  127. task21->buffers[0].handle =
  128. starpu_data_get_sub_data(args->dataA, 2, u21a->i, u21a->i);
  129. task21->buffers[0].mode = STARPU_R;
  130. task21->buffers[1].handle =
  131. starpu_data_get_sub_data(args->dataA, 2, u21a->i, u21a->k);
  132. task21->buffers[1].mode = STARPU_RW;
  133. starpu_task_submit(task21);
  134. }
  135. }
  136. }
  137. /* 11k + 22k-1,i,k => 12 k,i */
  138. if (j == k + 1)
  139. {
  140. uint8_t dep;
  141. /* 11 k+1*/
  142. dep = advance_11[(k+1)];
  143. if (dep & DONE)
  144. {
  145. /* try to push the task */
  146. uint8_t u = STARPU_ATOMIC_OR(&advance_12_21[(k+1)*nblocks + i], STARTED);
  147. if ((u & STARTED) == 0)
  148. {
  149. /* we are the only one that should launch that task */
  150. cl_args *u12a = malloc(sizeof(cl_args));
  151. struct starpu_task *task12 = starpu_task_create();
  152. task12->callback_func = dw_callback_v2_codelet_update_u12;
  153. task12->callback_arg = u12a;
  154. task12->cl = &cl12;
  155. task12->cl_arg = u12a;
  156. u12a->i = k+1;
  157. u12a->k = i;
  158. u12a->nblocks = args->nblocks;
  159. u12a->dataA = args->dataA;
  160. task12->buffers[0].handle = starpu_data_get_sub_data(args->dataA, 2, u12a->i, u12a->i);
  161. task12->buffers[0].mode = STARPU_R;
  162. task12->buffers[1].handle = starpu_data_get_sub_data(args->dataA, 2, u12a->k, u12a->i);
  163. task12->buffers[1].mode = STARPU_RW;
  164. starpu_task_submit(task12);
  165. }
  166. }
  167. }
  168. free(args);
  169. }
  170. void dw_callback_v2_codelet_update_u12(void *argcb)
  171. {
  172. cl_args *args = argcb;
  173. /* now launch the update of LU22 */
  174. unsigned i = args->i;
  175. unsigned k = args->k;
  176. unsigned nblocks = args->nblocks;
  177. /* we did task 21i,k */
  178. advance_12_21[i*nblocks + k] = DONE;
  179. unsigned slicey;
  180. for (slicey = i+1; slicey < nblocks; slicey++)
  181. {
  182. /* can we launch 22 i,args->k,slicey ? */
  183. /* deps : 21 args->k, slicey */
  184. uint8_t dep;
  185. dep = advance_12_21[i + slicey*nblocks];
  186. if (dep & DONE)
  187. {
  188. /* perhaps we may schedule the 22 i,args->k,slicey task */
  189. uint8_t u = STARPU_ATOMIC_OR(&advance_22[i*nblocks*nblocks + slicey*nblocks + k], STARTED);
  190. if ((u & STARTED) == 0)
  191. {
  192. /* update that square matrix */
  193. cl_args *u22a = malloc(sizeof(cl_args));
  194. struct starpu_task *task22 = starpu_task_create();
  195. task22->callback_func = dw_callback_v2_codelet_update_u22;
  196. task22->callback_arg = u22a;
  197. task22->cl = &cl22;
  198. task22->cl_arg = u22a;
  199. u22a->k = i;
  200. u22a->i = k;
  201. u22a->j = slicey;
  202. u22a->dataA = args->dataA;
  203. u22a->nblocks = nblocks;
  204. task22->buffers[0].handle = starpu_data_get_sub_data(args->dataA, 2, u22a->i, u22a->k);
  205. task22->buffers[0].mode = STARPU_R;
  206. task22->buffers[1].handle = starpu_data_get_sub_data(args->dataA, 2, u22a->k, u22a->j);
  207. task22->buffers[1].mode = STARPU_R;
  208. task22->buffers[2].handle = starpu_data_get_sub_data(args->dataA, 2, u22a->i, u22a->j);
  209. task22->buffers[2].mode = STARPU_RW;
  210. /* schedule that codelet */
  211. if (!no_prio && (slicey == i+1))
  212. task22->priority = STARPU_MAX_PRIO;
  213. starpu_task_submit(task22);
  214. }
  215. }
  216. }
  217. }
  218. void dw_callback_v2_codelet_update_u21(void *argcb)
  219. {
  220. cl_args *args = argcb;
  221. /* now launch the update of LU22 */
  222. unsigned i = args->i;
  223. unsigned k = args->k;
  224. unsigned nblocks = args->nblocks;
  225. /* we did task 21i,k */
  226. advance_12_21[i + k*nblocks] = DONE;
  227. unsigned slicex;
  228. for (slicex = i+1; slicex < nblocks; slicex++)
  229. {
  230. /* can we launch 22 i,slicex,k ? */
  231. /* deps : 12 slicex k */
  232. uint8_t dep;
  233. dep = advance_12_21[i*nblocks + slicex];
  234. if (dep & DONE)
  235. {
  236. /* perhaps we may schedule the 22 i,args->k,slicey task */
  237. uint8_t u = STARPU_ATOMIC_OR(&advance_22[i*nblocks*nblocks + k*nblocks + slicex], STARTED);
  238. if ((u & STARTED) == 0)
  239. {
  240. /* update that square matrix */
  241. cl_args *u22a = malloc(sizeof(cl_args));
  242. struct starpu_task *task22 = starpu_task_create();
  243. task22->callback_func = dw_callback_v2_codelet_update_u22;
  244. task22->callback_arg = u22a;
  245. task22->cl = &cl22;
  246. task22->cl_arg = u22a;
  247. u22a->k = i;
  248. u22a->i = slicex;
  249. u22a->j = k;
  250. u22a->dataA = args->dataA;
  251. u22a->nblocks = nblocks;
  252. task22->buffers[0].handle = starpu_data_get_sub_data(args->dataA, 2, u22a->i, u22a->k);
  253. task22->buffers[0].mode = STARPU_R;
  254. task22->buffers[1].handle = starpu_data_get_sub_data(args->dataA, 2, u22a->k, u22a->j);
  255. task22->buffers[1].mode = STARPU_R;
  256. task22->buffers[2].handle = starpu_data_get_sub_data(args->dataA, 2, u22a->i, u22a->j);
  257. task22->buffers[2].mode = STARPU_RW;
  258. /* schedule that codelet */
  259. if (!no_prio && (slicex == i+1))
  260. task22->priority = STARPU_MAX_PRIO;
  261. starpu_task_submit(task22);
  262. }
  263. }
  264. }
  265. }
  266. void dw_callback_v2_codelet_update_u11(void *argcb)
  267. {
  268. /* in case there remains work, go on */
  269. cl_args *args = argcb;
  270. unsigned nblocks = args->nblocks;
  271. unsigned i = args->i;
  272. /* we did task 11k */
  273. advance_11[i] = DONE;
  274. if (i == nblocks - 1)
  275. {
  276. /* we are done : wake the application up */
  277. pthread_mutex_lock(&mutex);
  278. finished = 1;
  279. pthread_cond_signal(&cond);
  280. pthread_mutex_unlock(&mutex);
  281. return;
  282. }
  283. else
  284. {
  285. /* put new tasks */
  286. unsigned slice;
  287. for (slice = i + 1; slice < nblocks; slice++)
  288. {
  289. /* can we launch 12i,slice ? */
  290. uint8_t deps12;
  291. if (i == 0)
  292. {
  293. deps12 = DONE;
  294. }
  295. else
  296. {
  297. deps12 = advance_22[(i-1)*nblocks*nblocks + slice + i*nblocks];
  298. }
  299. if (deps12 & DONE)
  300. {
  301. /* we may perhaps launch the task 12i,slice */
  302. uint8_t u = STARPU_ATOMIC_OR(&advance_12_21[i*nblocks + slice], STARTED);
  303. if ((u & STARTED) == 0)
  304. {
  305. /* we are the only one that should launch that task */
  306. cl_args *u12a = malloc(sizeof(cl_args));
  307. struct starpu_task *task12 = starpu_task_create();
  308. task12->callback_func = dw_callback_v2_codelet_update_u12;
  309. task12->callback_arg = u12a;
  310. task12->cl = &cl12;
  311. task12->cl_arg = u12a;
  312. u12a->i = i;
  313. u12a->k = slice;
  314. u12a->nblocks = args->nblocks;
  315. u12a->dataA = args->dataA;
  316. task12->buffers[0].handle = starpu_data_get_sub_data(args->dataA, 2, u12a->i, u12a->i);
  317. task12->buffers[0].mode = STARPU_R;
  318. task12->buffers[1].handle = starpu_data_get_sub_data(args->dataA, 2, u12a->k, u12a->i);
  319. task12->buffers[1].mode = STARPU_RW;
  320. if (!no_prio && (slice == i +1))
  321. task12->priority = STARPU_MAX_PRIO;
  322. starpu_task_submit(task12);
  323. }
  324. }
  325. /* can we launch 21i,slice ? */
  326. if (i == 0)
  327. {
  328. deps12 = DONE;
  329. }
  330. else
  331. {
  332. deps12 = advance_22[(i-1)*nblocks*nblocks + slice*nblocks + i];
  333. }
  334. if (deps12 & DONE)
  335. {
  336. /* we may perhaps launch the task 12i,slice */
  337. uint8_t u = STARPU_ATOMIC_OR(&advance_12_21[i + slice*nblocks], STARTED);
  338. if ((u & STARTED) == 0)
  339. {
  340. /* we are the only one that should launch that task */
  341. cl_args *u21a = malloc(sizeof(cl_args));
  342. struct starpu_task *task21 = starpu_task_create();
  343. task21->callback_func = dw_callback_v2_codelet_update_u21;
  344. task21->callback_arg = u21a;
  345. task21->cl = &cl21;
  346. task21->cl_arg = u21a;
  347. u21a->i = i;
  348. u21a->k = slice;
  349. u21a->nblocks = args->nblocks;
  350. u21a->dataA = args->dataA;
  351. task21->buffers[0].handle = starpu_data_get_sub_data(args->dataA, 2, u21a->i, u21a->i);
  352. task21->buffers[0].mode = STARPU_R;
  353. task21->buffers[1].handle = starpu_data_get_sub_data(args->dataA, 2, u21a->i, u21a->k);
  354. task21->buffers[1].mode = STARPU_RW;
  355. if (!no_prio && (slice == i +1))
  356. task21->priority = STARPU_MAX_PRIO;
  357. starpu_task_submit(task21);
  358. }
  359. }
  360. }
  361. }
  362. }
  363. /*
  364. * Callbacks
  365. */
  366. void dw_callback_codelet_update_u11(void *argcb)
  367. {
  368. /* in case there remains work, go on */
  369. cl_args *args = argcb;
  370. if (args->i == args->nblocks - 1)
  371. {
  372. /* we are done : wake the application up */
  373. pthread_mutex_lock(&mutex);
  374. finished = 1;
  375. pthread_cond_signal(&cond);
  376. pthread_mutex_unlock(&mutex);
  377. return;
  378. }
  379. else
  380. {
  381. /* put new tasks */
  382. unsigned nslices;
  383. nslices = args->nblocks - 1 - args->i;
  384. unsigned *remaining = malloc(sizeof(unsigned));
  385. *remaining = 2*nslices;
  386. unsigned slice;
  387. for (slice = args->i + 1; slice < args->nblocks; slice++)
  388. {
  389. /* update slice from u12 */
  390. cl_args *u12a = malloc(sizeof(cl_args));
  391. /* update slice from u21 */
  392. cl_args *u21a = malloc(sizeof(cl_args));
  393. struct starpu_task *task12 = starpu_task_create();
  394. task12->callback_func = dw_callback_codelet_update_u12_21;
  395. task12->callback_arg = u12a;
  396. task12->cl = &cl12;
  397. task12->cl_arg = u12a;
  398. struct starpu_task *task21 = starpu_task_create();
  399. task21->callback_func = dw_callback_codelet_update_u12_21;
  400. task21->callback_arg = u21a;
  401. task21->cl = &cl21;
  402. task21->cl_arg = u21a;
  403. u12a->i = args->i;
  404. u12a->k = slice;
  405. u12a->nblocks = args->nblocks;
  406. u12a->dataA = args->dataA;
  407. u12a->remaining = remaining;
  408. u21a->i = args->i;
  409. u21a->k = slice;
  410. u21a->nblocks = args->nblocks;
  411. u21a->dataA = args->dataA;
  412. u21a->remaining = remaining;
  413. task12->buffers[0].handle =
  414. starpu_data_get_sub_data(args->dataA, 2, u12a->i, u12a->i);
  415. task12->buffers[0].mode = STARPU_R;
  416. task12->buffers[1].handle =
  417. starpu_data_get_sub_data(args->dataA, 2, u12a->k, u12a->i);
  418. task12->buffers[1].mode = STARPU_RW;
  419. task21->buffers[0].handle =
  420. starpu_data_get_sub_data(args->dataA, 2, u21a->i, u21a->i);
  421. task21->buffers[0].mode = STARPU_R;
  422. task21->buffers[1].handle =
  423. starpu_data_get_sub_data(args->dataA, 2, u21a->i, u21a->k);
  424. task21->buffers[1].mode = STARPU_RW;
  425. starpu_task_submit(task12);
  426. starpu_task_submit(task21);
  427. }
  428. }
  429. }
  430. void dw_callback_codelet_update_u22(void *argcb)
  431. {
  432. cl_args *args = argcb;
  433. if (STARPU_ATOMIC_ADD(args->remaining, (-1)) == 0)
  434. {
  435. /* all worker already used the counter */
  436. free(args->remaining);
  437. /* we now reduce the LU22 part (recursion appears there) */
  438. cl_args *u11arg = malloc(sizeof(cl_args));
  439. struct starpu_task *task = starpu_task_create();
  440. task->callback_func = dw_callback_codelet_update_u11;
  441. task->callback_arg = u11arg;
  442. task->cl = &cl11;
  443. task->cl_arg = u11arg;
  444. task->buffers[0].handle = starpu_data_get_sub_data(args->dataA, 2, args->k + 1, args->k + 1);
  445. task->buffers[0].mode = STARPU_RW;
  446. u11arg->dataA = args->dataA;
  447. u11arg->i = args->k + 1;
  448. u11arg->nblocks = args->nblocks;
  449. /* schedule the codelet */
  450. starpu_task_submit(task);
  451. }
  452. free(args);
  453. }
  454. void dw_callback_codelet_update_u12_21(void *argcb)
  455. {
  456. cl_args *args = argcb;
  457. if (STARPU_ATOMIC_ADD(args->remaining, -1) == 0)
  458. {
  459. /* now launch the update of LU22 */
  460. unsigned i = args->i;
  461. unsigned nblocks = args->nblocks;
  462. /* the number of tasks to be done */
  463. unsigned *remaining = malloc(sizeof(unsigned));
  464. *remaining = (nblocks - 1 - i)*(nblocks - 1 - i);
  465. unsigned slicey, slicex;
  466. for (slicey = i+1; slicey < nblocks; slicey++)
  467. {
  468. for (slicex = i+1; slicex < nblocks; slicex++)
  469. {
  470. /* update that square matrix */
  471. cl_args *u22a = malloc(sizeof(cl_args));
  472. struct starpu_task *task22 = starpu_task_create();
  473. task22->callback_func = dw_callback_codelet_update_u22;
  474. task22->callback_arg = u22a;
  475. task22->cl = &cl22;
  476. task22->cl_arg = u22a;
  477. u22a->k = i;
  478. u22a->i = slicex;
  479. u22a->j = slicey;
  480. u22a->dataA = args->dataA;
  481. u22a->nblocks = nblocks;
  482. u22a->remaining = remaining;
  483. task22->buffers[0].handle = starpu_data_get_sub_data(args->dataA, 2, u22a->i, u22a->k);
  484. task22->buffers[0].mode = STARPU_R;
  485. task22->buffers[1].handle = starpu_data_get_sub_data(args->dataA, 2, u22a->k, u22a->j);
  486. task22->buffers[1].mode = STARPU_R;
  487. task22->buffers[2].handle = starpu_data_get_sub_data(args->dataA, 2, u22a->i, u22a->j);
  488. task22->buffers[2].mode = STARPU_RW;
  489. /* schedule that codelet */
  490. starpu_task_submit(task22);
  491. }
  492. }
  493. }
  494. }
  495. /*
  496. * code to bootstrap the factorization
  497. */
  498. void dw_codelet_facto(starpu_data_handle_t dataA, unsigned nblocks)
  499. {
  500. cl_args *args = malloc(sizeof(cl_args));
  501. args->i = 0;
  502. args->nblocks = nblocks;
  503. args->dataA = dataA;
  504. gettimeofday(&start, NULL);
  505. /* inject a new task with this codelet into the system */
  506. struct starpu_task *task = starpu_task_create();
  507. task->callback_func = dw_callback_codelet_update_u11;
  508. task->callback_arg = args;
  509. task->cl = &cl11;
  510. task->cl_arg = args;
  511. task->buffers[0].handle = starpu_data_get_sub_data(dataA, 2, 0, 0);
  512. task->buffers[0].mode = STARPU_RW;
  513. /* schedule the codelet */
  514. starpu_task_submit(task);
  515. /* stall the application until the end of computations */
  516. pthread_mutex_lock(&mutex);
  517. if (!finished)
  518. pthread_cond_wait(&cond, &mutex);
  519. pthread_mutex_unlock(&mutex);
  520. gettimeofday(&end, NULL);
  521. double timing = (double)((end.tv_sec - start.tv_sec)*1000000 + (end.tv_usec - start.tv_usec));
  522. FPRINTF(stderr, "Computation took (in ms)\n");
  523. FPRINTF(stdout, "%2.2f\n", timing/1000);
  524. unsigned n = starpu_matrix_get_nx(dataA);
  525. double flop = (2.0f*n*n*n)/3.0f;
  526. FPRINTF(stderr, "Synthetic GFlops : %2.2f\n", (flop/timing/1000.0f));
  527. }
  528. void dw_codelet_facto_v2(starpu_data_handle_t dataA, unsigned nblocks)
  529. {
  530. advance_11 = calloc(nblocks, sizeof(uint8_t));
  531. STARPU_ASSERT(advance_11);
  532. advance_12_21 = calloc(nblocks*nblocks, sizeof(uint8_t));
  533. STARPU_ASSERT(advance_12_21);
  534. advance_22 = calloc(nblocks*nblocks*nblocks, sizeof(uint8_t));
  535. STARPU_ASSERT(advance_22);
  536. cl_args *args = malloc(sizeof(cl_args));
  537. args->i = 0;
  538. args->nblocks = nblocks;
  539. args->dataA = dataA;
  540. gettimeofday(&start, NULL);
  541. /* inject a new task with this codelet into the system */
  542. struct starpu_task *task = starpu_task_create();
  543. task->callback_func = dw_callback_v2_codelet_update_u11;
  544. task->callback_arg = args;
  545. task->cl = &cl11;
  546. task->cl_arg = args;
  547. task->buffers[0].handle = starpu_data_get_sub_data(dataA, 2, 0, 0);
  548. task->buffers[0].mode = STARPU_RW;
  549. /* schedule the codelet */
  550. int ret = starpu_task_submit(task);
  551. if (STARPU_UNLIKELY(ret == -ENODEV))
  552. {
  553. FPRINTF(stderr, "No worker may execute this task\n");
  554. exit(0);
  555. }
  556. /* stall the application until the end of computations */
  557. pthread_mutex_lock(&mutex);
  558. if (!finished)
  559. pthread_cond_wait(&cond, &mutex);
  560. pthread_mutex_unlock(&mutex);
  561. gettimeofday(&end, NULL);
  562. double timing = (double)((end.tv_sec - start.tv_sec)*1000000 + (end.tv_usec - start.tv_usec));
  563. FPRINTF(stderr, "Computation took (in ms)\n");
  564. FPRINTF(stdout, "%2.2f\n", timing/1000);
  565. unsigned n = starpu_matrix_get_nx(dataA);
  566. double flop = (2.0f*n*n*n)/3.0f;
  567. FPRINTF(stderr, "Synthetic GFlops : %2.2f\n", (flop/timing/1000.0f));
  568. }
  569. void initialize_system(float **A, float **B, unsigned dim, unsigned pinned)
  570. {
  571. starpu_init(NULL);
  572. starpu_helper_cublas_init();
  573. if (pinned)
  574. {
  575. starpu_malloc((void **)A, (size_t)dim*dim*sizeof(float));
  576. starpu_malloc((void **)B, (size_t)dim*sizeof(float));
  577. }
  578. else
  579. {
  580. *A = malloc((size_t)dim*dim*sizeof(float));
  581. STARPU_ASSERT(*A);
  582. *B = malloc((size_t)dim*sizeof(float));
  583. STARPU_ASSERT(*B);
  584. }
  585. }
  586. void dw_factoLU(float *matA, unsigned size,
  587. unsigned ld, unsigned nblocks,
  588. unsigned version, unsigned _no_prio)
  589. {
  590. #ifdef CHECK_RESULTS
  591. FPRINTF(stderr, "Checking results ...\n");
  592. float *Asaved;
  593. Asaved = malloc((size_t)ld*ld*sizeof(float));
  594. memcpy(Asaved, matA, (size_t)ld*ld*sizeof(float));
  595. #endif
  596. no_prio = _no_prio;
  597. starpu_data_handle_t dataA;
  598. /* monitor and partition the A matrix into blocks :
  599. * one block is now determined by 2 unsigned (i,j) */
  600. starpu_matrix_data_register(&dataA, 0, (uintptr_t)matA, ld,
  601. size, size, sizeof(float));
  602. struct starpu_data_filter f =
  603. {
  604. .filter_func = starpu_vertical_block_filter_func,
  605. .nchildren = nblocks
  606. };
  607. struct starpu_data_filter f2 =
  608. {
  609. .filter_func = starpu_block_filter_func,
  610. .nchildren = nblocks
  611. };
  612. starpu_data_map_filters(dataA, 2, &f, &f2);
  613. switch (version)
  614. {
  615. case 1:
  616. dw_codelet_facto(dataA, nblocks);
  617. break;
  618. default:
  619. case 2:
  620. dw_codelet_facto_v2(dataA, nblocks);
  621. break;
  622. }
  623. /* gather all the data */
  624. starpu_data_unpartition(dataA, 0);
  625. starpu_data_unregister(dataA);
  626. #ifdef CHECK_RESULTS
  627. compare_A_LU(Asaved, matA, size, ld);
  628. #endif
  629. }