pxlu.c 22 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412413414415416417418419420421422423424425426427428429430431432433434435436437438439440441442443444445446447448449450451452453454455456457458459460461462463464465466467468469470471472473474475476477478479480481482483484485486487488489490491492493494495496497498499500501502503504505506507508509510511512513514515516517518519520521522523524525526527528529530531532533534535536537538539540541542543544545546547548549550551552553554555556557558559560561562563564565566567568569570571572573574575576577578579580581582583584585586587588589590591592593594595596597598599600601602603604605606607608609610611612613614615616617618619620621622623624625626627628629630631632633634635636637638639640641642643644645646647648649650651652653654655656657658659660661662663664665666667668669670671672673674675676677678679680681682683684685686687688689690691692693694695696697698699700701702703704705706707708709710711712713714715716717718719720721722723724725726727728729730731732733734735736737738739740741742743744745746747748749750751752753754755756757758759760761762763764765766767768769770771772773774775776777778779780781782783784785786787788789790791792793794795796797798799800801802803804805806807808809810811812813814815816817818819820821822823824825826827828829830831832833834835836837838839840841842843844845846847848849850851852853854855856857858859860861862863864865866867868869870871872873874875876877878879880881882883884885886887888889890891892893894895896897898899900901902903904905906907908909910911912913914915916917918919920921922923924925926927928929
  1. /* StarPU --- Runtime system for heterogeneous multicore architectures.
  2. *
  3. * Copyright (C) 2010-2021 Université de Bordeaux, CNRS (LaBRI UMR 5800), Inria
  4. *
  5. * StarPU is free software; you can redistribute it and/or modify
  6. * it under the terms of the GNU Lesser General Public License as published by
  7. * the Free Software Foundation; either version 2.1 of the License, or (at
  8. * your option) any later version.
  9. *
  10. * StarPU is distributed in the hope that it will be useful, but
  11. * WITHOUT ANY WARRANTY; without even the implied warranty of
  12. * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.
  13. *
  14. * See the GNU Lesser General Public License in COPYING.LGPL for more details.
  15. */
  16. #include "pxlu.h"
  17. #include "pxlu_kernels.h"
  18. #include <sys/time.h>
  19. #define MPI_TAG11(k) ((1U << 16) | (k))
  20. #define MPI_TAG12(k, j) ((2U << 16) | (k)<<8 | (j))
  21. #define MPI_TAG21(k, i) ((3U << 16) | (i)<<8 | (k))
  22. // 11 21
  23. // 12 22
  24. #define TAG11(k) ((starpu_tag_t)( (1ULL<<50) | (unsigned long long)(k)))
  25. #define TAG12(k,j) ((starpu_tag_t)(((2ULL<<50) | (((unsigned long long)(k))<<32) \
  26. | (unsigned long long)(j))))
  27. #define TAG21(k,i) ((starpu_tag_t)(((3ULL<<50) | (((unsigned long long)(k))<<32) \
  28. | (unsigned long long)(i))))
  29. #define TAG22(k,i,j) ((starpu_tag_t)(((4ULL<<50) | ((unsigned long long)(k)<<32) \
  30. | ((unsigned long long)(i)<<16) \
  31. | (unsigned long long)(j))))
  32. #define TAG11_SAVE(k) ((starpu_tag_t)( (5ULL<<50) | (unsigned long long)(k)))
  33. #define TAG12_SAVE(k,j) ((starpu_tag_t)(((6ULL<<50) | (((unsigned long long)(k))<<32) \
  34. | (unsigned long long)(j))))
  35. #define TAG21_SAVE(k,i) ((starpu_tag_t)(((7ULL<<50) | (((unsigned long long)(k))<<32) \
  36. | (unsigned long long)(i))))
  37. #define TAG11_SAVE_PARTIAL(k) ((starpu_tag_t)( (8ULL<<50) | (unsigned long long)(k)))
  38. #define TAG12_SAVE_PARTIAL(k,j) ((starpu_tag_t)(((9ULL<<50) | (((unsigned long long)(k))<<32) \
  39. | (unsigned long long)(j))))
  40. #define TAG21_SAVE_PARTIAL(k,i) ((starpu_tag_t)(((10ULL<<50) | (((unsigned long long)(k))<<32) \
  41. | (unsigned long long)(i))))
  42. #define STARPU_TAG_INIT ((starpu_tag_t)(11ULL<<50))
  43. //#define VERBOSE_INIT 1
  44. //#define DEBUG 1
  45. static unsigned no_prio = 0;
  46. static unsigned nblocks = 0;
  47. static int rank = -1;
  48. static int world_size = -1;
  49. struct callback_arg
  50. {
  51. unsigned i, j, k;
  52. };
  53. /*
  54. * Various
  55. */
  56. static struct debug_info *create_debug_info(unsigned i, unsigned j, unsigned k)
  57. {
  58. struct debug_info *info = malloc(sizeof(struct debug_info));
  59. info->i = i;
  60. info->j = j;
  61. info->k = k;
  62. return info;
  63. }
  64. static struct starpu_task *create_task(starpu_tag_t id)
  65. {
  66. struct starpu_task *task = starpu_task_create();
  67. task->cl_arg = NULL;
  68. task->use_tag = 1;
  69. task->tag_id = id;
  70. return task;
  71. }
  72. /* Send handle to every node appearing in the mask, and unlock tag once the
  73. * transfers are done. */
  74. static void send_data_to_mask(starpu_data_handle_t handle, int *rank_mask, starpu_mpi_tag_t mpi_tag, starpu_tag_t tag)
  75. {
  76. unsigned cnt = 0;
  77. STARPU_ASSERT(handle != STARPU_POISON_PTR);
  78. int rank_array[world_size];
  79. MPI_Comm comm_array[world_size];
  80. starpu_mpi_tag_t mpi_tag_array[world_size];
  81. starpu_data_handle_t handle_array[world_size];
  82. int r;
  83. for (r = 0; r < world_size; r++)
  84. {
  85. if (rank_mask[r])
  86. {
  87. rank_array[cnt] = r;
  88. comm_array[cnt] = MPI_COMM_WORLD;
  89. mpi_tag_array[cnt] = mpi_tag;
  90. handle_array[cnt] = handle;
  91. cnt++;
  92. }
  93. }
  94. if (cnt == 0)
  95. {
  96. /* In case there is no message to send, we release the tag at
  97. * once */
  98. starpu_tag_notify_from_apps(tag);
  99. }
  100. else
  101. {
  102. starpu_mpi_isend_array_detached_unlock_tag(cnt, handle_array,
  103. rank_array, mpi_tag_array, comm_array, tag);
  104. }
  105. }
  106. /* Initiate a receive request once all dependencies are fulfilled and unlock
  107. * tag 'unlocked_tag' once it's done. */
  108. struct recv_when_done_callback_arg
  109. {
  110. int source;
  111. starpu_mpi_tag_t mpi_tag;
  112. starpu_data_handle_t handle;
  113. starpu_tag_t unlocked_tag;
  114. };
  115. static void callback_receive_when_done(void *_arg)
  116. {
  117. struct recv_when_done_callback_arg *arg = _arg;
  118. starpu_mpi_irecv_detached_unlock_tag(arg->handle, arg->source,
  119. arg->mpi_tag, MPI_COMM_WORLD, arg->unlocked_tag);
  120. free(arg);
  121. }
  122. static void receive_when_deps_are_done(unsigned ndeps, starpu_tag_t *deps_tags,
  123. int source, starpu_mpi_tag_t mpi_tag,
  124. starpu_data_handle_t handle,
  125. starpu_tag_t partial_tag,
  126. starpu_tag_t unlocked_tag)
  127. {
  128. STARPU_ASSERT(handle != STARPU_POISON_PTR);
  129. struct recv_when_done_callback_arg *arg =
  130. malloc(sizeof(struct recv_when_done_callback_arg));
  131. arg->source = source;
  132. arg->mpi_tag = mpi_tag;
  133. arg->handle = handle;
  134. arg->unlocked_tag = unlocked_tag;
  135. if (ndeps == 0)
  136. {
  137. callback_receive_when_done(arg);
  138. return;
  139. }
  140. starpu_create_sync_task(partial_tag, ndeps, deps_tags,
  141. callback_receive_when_done, arg);
  142. }
  143. /*
  144. * Task 11 (diagonal factorization)
  145. */
  146. static void create_task_11_recv(unsigned k)
  147. {
  148. /* The current node is not computing that task, so we receive the block
  149. * with MPI */
  150. /* We don't issue a MPI receive request until everyone using the
  151. * temporary buffer is done : 11_(k-1) can be used by 12_(k-1)j and
  152. * 21(k-1)i with i,j >= k */
  153. unsigned ndeps = 0;
  154. starpu_tag_t tag_array[2*nblocks];
  155. #ifdef SINGLE_TMP11
  156. if (k > 0)
  157. {
  158. unsigned i;
  159. for (i = (k-1)+1; i < nblocks; i++)
  160. {
  161. if (rank == get_block_rank(i, k-1))
  162. tag_array[ndeps++] = TAG21(k-1, i);
  163. }
  164. }
  165. if (k > 0)
  166. {
  167. unsigned j;
  168. for (j = (k-1)+1; j < nblocks; j++)
  169. {
  170. if (rank == get_block_rank(k-1, j))
  171. tag_array[ndeps++] = TAG12(k-1, j);
  172. }
  173. }
  174. #endif
  175. int source = get_block_rank(k, k);
  176. #ifdef SINGLE_TMP11
  177. starpu_data_handle_t block_handle = STARPU_PLU(get_tmp_11_block_handle)();
  178. #else
  179. starpu_data_handle_t block_handle = STARPU_PLU(get_tmp_11_block_handle)(k);
  180. #endif
  181. starpu_mpi_tag_t mpi_tag = MPI_TAG11(k);
  182. starpu_tag_t partial_tag = TAG11_SAVE_PARTIAL(k);
  183. starpu_tag_t unlocked_tag = TAG11_SAVE(k);
  184. // fprintf(stderr, "NODE %d - 11 (%d) - recv when done ndeps %d - tag array %lx\n", rank, k, ndeps, tag_array[0]);
  185. receive_when_deps_are_done(ndeps, tag_array, source, mpi_tag, block_handle, partial_tag, unlocked_tag);
  186. }
  187. static void find_nodes_using_11(unsigned k, int *rank_mask)
  188. {
  189. memset(rank_mask, 0, world_size*sizeof(int));
  190. /* Block 11_k is used to compute 12_kj + 12ki with i,j > k */
  191. unsigned i;
  192. for (i = k+1; i < nblocks; i++)
  193. {
  194. int r = get_block_rank(i, k);
  195. rank_mask[r] = 1;
  196. }
  197. unsigned j;
  198. for (j = k+1; j < nblocks; j++)
  199. {
  200. int r = get_block_rank(k, j);
  201. rank_mask[r] = 1;
  202. }
  203. }
  204. static void callback_task_11_real(void *_arg)
  205. {
  206. struct callback_arg *arg = _arg;
  207. unsigned k = arg->k;
  208. /* Find all the nodes potentially requiring this block */
  209. int rank_mask[world_size];
  210. find_nodes_using_11(k, rank_mask);
  211. rank_mask[rank] = 0;
  212. /* Send the block to those nodes */
  213. starpu_data_handle_t block_handle = STARPU_PLU(get_block_handle)(k, k);
  214. starpu_tag_t tag = TAG11_SAVE(k);
  215. starpu_mpi_tag_t mpi_tag = MPI_TAG11(k);
  216. send_data_to_mask(block_handle, rank_mask, mpi_tag, tag);
  217. free(arg);
  218. }
  219. static void create_task_11_real(unsigned k)
  220. {
  221. struct starpu_task *task = create_task(TAG11(k));
  222. task->cl = &STARPU_PLU(cl11);
  223. task->color = 0xffff00;
  224. task->cl_arg = create_debug_info(k, k, k);
  225. task->cl_arg_free = 1;
  226. /* which sub-data is manipulated ? */
  227. task->handles[0] = STARPU_PLU(get_block_handle)(k, k);
  228. struct callback_arg *arg = malloc(sizeof(struct callback_arg));
  229. arg->k = k;
  230. task->callback_func = callback_task_11_real;
  231. task->callback_arg = arg;
  232. /* this is an important task */
  233. if (!no_prio)
  234. task->priority = STARPU_MAX_PRIO;
  235. /* enforce dependencies ... */
  236. if (k > 0)
  237. {
  238. starpu_tag_declare_deps(TAG11(k), 1, TAG22(k-1, k, k));
  239. }
  240. else
  241. {
  242. starpu_tag_declare_deps(TAG11(k), 1, STARPU_TAG_INIT);
  243. }
  244. int ret = starpu_task_submit(task);
  245. STARPU_CHECK_RETURN_VALUE(ret, "starpu_task_submit");
  246. }
  247. static void create_task_11(unsigned k)
  248. {
  249. if (get_block_rank(k, k) == rank)
  250. {
  251. #ifdef VERBOSE_INIT
  252. fprintf(stderr, "CREATE real task 11(%u) (TAG11_SAVE(%u) = %llux) on node %d\n", k, k, (unsigned long long) TAG11_SAVE(k), rank);
  253. #endif
  254. create_task_11_real(k);
  255. }
  256. else
  257. {
  258. /* We don't handle the task, but perhaps we have to generate MPI transfers. */
  259. int rank_mask[world_size];
  260. find_nodes_using_11(k, rank_mask);
  261. if (rank_mask[rank])
  262. {
  263. #ifdef VERBOSE_INIT
  264. fprintf(stderr, "create RECV task 11(%u) on node %d\n", k, rank);
  265. #endif
  266. create_task_11_recv(k);
  267. }
  268. else
  269. {
  270. #ifdef VERBOSE_INIT
  271. fprintf(stderr, "Node %d needs not 11(%u)\n", rank, k);
  272. #endif
  273. }
  274. }
  275. }
  276. /*
  277. * Task 12 (Update lower left (TRSM))
  278. */
  279. static void create_task_12_recv(unsigned k, unsigned j)
  280. {
  281. /* The current node is not computing that task, so we receive the block
  282. * with MPI */
  283. /* We don't issue a MPI receive request until everyone using the
  284. * temporary buffer is done : 12_(k-1)j can be used by 22_(k-1)ij with
  285. * i >= k */
  286. unsigned ndeps = 0;
  287. starpu_tag_t tag_array[nblocks];
  288. unsigned start;
  289. unsigned bound;
  290. #ifdef SINGLE_TMP1221
  291. bound = 0;
  292. start = (k-1)+1;
  293. #else
  294. bound = 1;
  295. start = (k-2)+1;
  296. #endif
  297. if (k > bound)
  298. {
  299. unsigned i;
  300. for (i = start; i < nblocks; i++)
  301. {
  302. if (rank == get_block_rank(i, j))
  303. #ifdef SINGLE_TMP1221
  304. tag_array[ndeps++] = TAG22(k-1, i, j);
  305. #else
  306. tag_array[ndeps++] = TAG22(k-2, i, j);
  307. #endif
  308. }
  309. }
  310. int source = get_block_rank(k, j);
  311. #ifdef SINGLE_TMP1221
  312. starpu_data_handle_t block_handle = STARPU_PLU(get_tmp_12_block_handle)(j);
  313. #else
  314. starpu_data_handle_t block_handle = STARPU_PLU(get_tmp_12_block_handle)(j,k);
  315. #endif
  316. starpu_mpi_tag_t mpi_tag = MPI_TAG12(k, j);
  317. starpu_tag_t partial_tag = TAG12_SAVE_PARTIAL(k, j);
  318. starpu_tag_t unlocked_tag = TAG12_SAVE(k, j);
  319. receive_when_deps_are_done(ndeps, tag_array, source, mpi_tag, block_handle, partial_tag, unlocked_tag);
  320. }
  321. static void find_nodes_using_12(unsigned k, unsigned j, int *rank_mask)
  322. {
  323. memset(rank_mask, 0, world_size*sizeof(int));
  324. /* Block 12_kj is used to compute 22_kij with i > k */
  325. unsigned i;
  326. for (i = k+1; i < nblocks; i++)
  327. {
  328. int r = get_block_rank(i, j);
  329. rank_mask[r] = 1;
  330. }
  331. }
  332. static void callback_task_12_real(void *_arg)
  333. {
  334. struct callback_arg *arg = _arg;
  335. unsigned k = arg->k;
  336. unsigned j = arg->j;
  337. /* Find all the nodes potentially requiring this block */
  338. int rank_mask[world_size];
  339. find_nodes_using_12(k, j, rank_mask);
  340. rank_mask[rank] = 0;
  341. /* Send the block to those nodes */
  342. starpu_data_handle_t block_handle = STARPU_PLU(get_block_handle)(k, j);
  343. starpu_tag_t tag = TAG12_SAVE(k, j);
  344. starpu_mpi_tag_t mpi_tag = MPI_TAG12(k, j);
  345. send_data_to_mask(block_handle, rank_mask, mpi_tag, tag);
  346. free(arg);
  347. }
  348. static void create_task_12_real(unsigned k, unsigned j)
  349. {
  350. struct starpu_task *task = create_task(TAG12(k, j));
  351. #ifdef STARPU_DEVEL
  352. #warning temporary fix :/
  353. #endif
  354. // task->cl = &STARPU_PLU(cl12);
  355. task->cl = &STARPU_PLU(cl21);
  356. task->color = 0x8080ff;
  357. task->cl_arg = create_debug_info(j, j, k);
  358. task->cl_arg_free = 1;
  359. unsigned diag_block_is_local = (get_block_rank(k, k) == rank);
  360. starpu_tag_t tag_11_dep;
  361. /* which sub-data is manipulated ? */
  362. starpu_data_handle_t diag_block;
  363. if (diag_block_is_local)
  364. {
  365. diag_block = STARPU_PLU(get_block_handle)(k, k);
  366. tag_11_dep = TAG11(k);
  367. }
  368. else
  369. {
  370. #ifdef SINGLE_TMP11
  371. diag_block = STARPU_PLU(get_tmp_11_block_handle)();
  372. #else
  373. diag_block = STARPU_PLU(get_tmp_11_block_handle)(k);
  374. #endif
  375. tag_11_dep = TAG11_SAVE(k);
  376. }
  377. task->handles[0] = diag_block;
  378. task->handles[1] = STARPU_PLU(get_block_handle)(k, j);
  379. STARPU_ASSERT(get_block_rank(k, j) == rank);
  380. STARPU_ASSERT(task->handles[0] != STARPU_POISON_PTR);
  381. STARPU_ASSERT(task->handles[1] != STARPU_POISON_PTR);
  382. struct callback_arg *arg = malloc(sizeof(struct callback_arg));
  383. arg->j = j;
  384. arg->k = k;
  385. task->callback_func = callback_task_12_real;
  386. task->callback_arg = arg;
  387. if (!no_prio && (j == k+1))
  388. {
  389. task->priority = STARPU_MAX_PRIO;
  390. }
  391. /* enforce dependencies ... */
  392. if (k > 0)
  393. {
  394. starpu_tag_declare_deps(TAG12(k, j), 2, tag_11_dep, TAG22(k-1, k, j));
  395. }
  396. else
  397. {
  398. starpu_tag_declare_deps(TAG12(k, j), 1, tag_11_dep);
  399. }
  400. int ret = starpu_task_submit(task);
  401. STARPU_CHECK_RETURN_VALUE(ret, "starpu_task_submit");
  402. }
  403. static void create_task_12(unsigned k, unsigned j)
  404. {
  405. if (get_block_rank(k, j) == rank)
  406. {
  407. #ifdef VERBOSE_INIT
  408. fprintf(stderr, "CREATE real task 12(k = %u, j = %u) on node %d\n", k, j, rank);
  409. #endif
  410. create_task_12_real(k, j);
  411. }
  412. else
  413. {
  414. /* We don't handle the task, but perhaps we have to generate MPI transfers. */
  415. int rank_mask[world_size];
  416. find_nodes_using_12(k, j, rank_mask);
  417. if (rank_mask[rank])
  418. {
  419. #ifdef VERBOSE_INIT
  420. fprintf(stderr, "create RECV task 12(k = %u, j = %u) on node %d\n", k, j, rank);
  421. #endif
  422. create_task_12_recv(k, j);
  423. }
  424. else
  425. {
  426. #ifdef VERBOSE_INIT
  427. fprintf(stderr, "Node %d needs not 12(k=%u, i=%u)\n", rank, k, j);
  428. #endif
  429. }
  430. }
  431. }
  432. /*
  433. * Task 21 (Update upper right (TRSM))
  434. */
  435. static void create_task_21_recv(unsigned k, unsigned i)
  436. {
  437. /* The current node is not computing that task, so we receive the block
  438. * with MPI */
  439. /* We don't issue a MPI receive request until everyone using the
  440. * temporary buffer is done : 21_(k-1)i can be used by 22_(k-1)ij with
  441. * j >= k */
  442. unsigned ndeps = 0;
  443. starpu_tag_t tag_array[nblocks];
  444. unsigned bound;
  445. unsigned start;
  446. #ifdef SINGLE_TMP1221
  447. bound = 0;
  448. start = (k-1)+1;
  449. #else
  450. bound = 1;
  451. start = (k-2)+1;
  452. #endif
  453. if (k > bound)
  454. {
  455. unsigned j;
  456. for (j = start; j < nblocks; j++)
  457. {
  458. if (rank == get_block_rank(i, j))
  459. #ifdef SINGLE_TMP1221
  460. tag_array[ndeps++] = TAG22(k-1, i, j);
  461. #else
  462. tag_array[ndeps++] = TAG22(k-2, i, j);
  463. #endif
  464. }
  465. }
  466. int source = get_block_rank(i, k);
  467. #ifdef SINGLE_TMP1221
  468. starpu_data_handle_t block_handle = STARPU_PLU(get_tmp_21_block_handle)(i);
  469. #else
  470. starpu_data_handle_t block_handle = STARPU_PLU(get_tmp_21_block_handle)(i, k);
  471. #endif
  472. starpu_mpi_tag_t mpi_tag = MPI_TAG21(k, i);
  473. starpu_tag_t partial_tag = TAG21_SAVE_PARTIAL(k, i);
  474. starpu_tag_t unlocked_tag = TAG21_SAVE(k, i);
  475. // fprintf(stderr, "NODE %d - 21 (%d, %d) - recv when done ndeps %d - tag array %lx\n", rank, k, i, ndeps, tag_array[0]);
  476. receive_when_deps_are_done(ndeps, tag_array, source, mpi_tag, block_handle, partial_tag, unlocked_tag);
  477. }
  478. static void find_nodes_using_21(unsigned k, unsigned i, int *rank_mask)
  479. {
  480. memset(rank_mask, 0, world_size*sizeof(int));
  481. /* Block 21_ki is used to compute 22_kij with j > k */
  482. unsigned j;
  483. for (j = k+1; j < nblocks; j++)
  484. {
  485. int r = get_block_rank(i, j);
  486. rank_mask[r] = 1;
  487. }
  488. }
  489. static void callback_task_21_real(void *_arg)
  490. {
  491. struct callback_arg *arg = _arg;
  492. unsigned k = arg->k;
  493. unsigned i = arg->i;
  494. /* Find all the nodes potentially requiring this block */
  495. int rank_mask[world_size];
  496. find_nodes_using_21(k, i, rank_mask);
  497. rank_mask[rank] = 0;
  498. /* Send the block to those nodes */
  499. starpu_data_handle_t block_handle = STARPU_PLU(get_block_handle)(i, k);
  500. starpu_tag_t tag = TAG21_SAVE(k, i);
  501. starpu_mpi_tag_t mpi_tag = MPI_TAG21(k, i);
  502. send_data_to_mask(block_handle, rank_mask, mpi_tag, tag);
  503. free(arg);
  504. }
  505. static void create_task_21_real(unsigned k, unsigned i)
  506. {
  507. struct starpu_task *task = create_task(TAG21(k, i));
  508. #ifdef STARPU_DEVEL
  509. #warning temporary fix
  510. #endif
  511. // task->cl = &STARPU_PLU(cl21);
  512. task->cl = &STARPU_PLU(cl12);
  513. task->color = 0x8080c0;
  514. task->cl_arg = create_debug_info(i, i, k);
  515. task->cl_arg_free = 1;
  516. unsigned diag_block_is_local = (get_block_rank(k, k) == rank);
  517. starpu_tag_t tag_11_dep;
  518. /* which sub-data is manipulated ? */
  519. starpu_data_handle_t diag_block;
  520. if (diag_block_is_local)
  521. {
  522. diag_block = STARPU_PLU(get_block_handle)(k, k);
  523. tag_11_dep = TAG11(k);
  524. }
  525. else
  526. {
  527. #ifdef SINGLE_TMP11
  528. diag_block = STARPU_PLU(get_tmp_11_block_handle)();
  529. #else
  530. diag_block = STARPU_PLU(get_tmp_11_block_handle)(k);
  531. #endif
  532. tag_11_dep = TAG11_SAVE(k);
  533. }
  534. task->handles[0] = diag_block;
  535. task->handles[1] = STARPU_PLU(get_block_handle)(i, k);
  536. STARPU_ASSERT(task->handles[0] != STARPU_POISON_PTR);
  537. STARPU_ASSERT(task->handles[1] != STARPU_POISON_PTR);
  538. struct callback_arg *arg = malloc(sizeof(struct callback_arg));
  539. arg->i = i;
  540. arg->k = k;
  541. task->callback_func = callback_task_21_real;
  542. task->callback_arg = arg;
  543. if (!no_prio && (i == k+1))
  544. {
  545. task->priority = STARPU_MAX_PRIO;
  546. }
  547. /* enforce dependencies ... */
  548. if (k > 0)
  549. {
  550. starpu_tag_declare_deps(TAG21(k, i), 2, tag_11_dep, TAG22(k-1, i, k));
  551. }
  552. else
  553. {
  554. starpu_tag_declare_deps(TAG21(k, i), 1, tag_11_dep);
  555. }
  556. int ret = starpu_task_submit(task);
  557. STARPU_CHECK_RETURN_VALUE(ret, "starpu_task_submit");
  558. }
  559. static void create_task_21(unsigned k, unsigned i)
  560. {
  561. if (get_block_rank(i, k) == rank)
  562. {
  563. #ifdef VERBOSE_INIT
  564. fprintf(stderr, "CREATE real task 21(k = %u, i = %u) on node %d\n", k, i, rank);
  565. #endif
  566. create_task_21_real(k, i);
  567. }
  568. else
  569. {
  570. /* We don't handle the task, but perhaps we have to generate MPI transfers. */
  571. int rank_mask[world_size];
  572. find_nodes_using_21(k, i, rank_mask);
  573. if (rank_mask[rank])
  574. {
  575. #ifdef VERBOSE_INIT
  576. fprintf(stderr, "create RECV task 21(k = %u, i = %u) on node %d\n", k, i, rank);
  577. #endif
  578. create_task_21_recv(k, i);
  579. }
  580. else
  581. {
  582. #ifdef VERBOSE_INIT
  583. fprintf(stderr, "Node %d needs not 21(k=%u, i=%u)\n", rank, k,i);
  584. #endif
  585. }
  586. }
  587. }
  588. /*
  589. * Task 22 (GEMM)
  590. */
  591. static void create_task_22_real(unsigned k, unsigned i, unsigned j)
  592. {
  593. // printf("task 22 k,i,j = %d,%d,%d TAG = %llx\n", k,i,j, TAG22(k,i,j));
  594. struct starpu_task *task = create_task(TAG22(k, i, j));
  595. task->cl = &STARPU_PLU(cl22);
  596. task->color = 0x00ff00;
  597. task->cl_arg = create_debug_info(i, j, k);
  598. task->cl_arg_free = 1;
  599. /* which sub-data is manipulated ? */
  600. /* produced by TAG21_SAVE(k, i) */
  601. unsigned block21_is_local = (get_block_rank(i, k) == rank);
  602. starpu_tag_t tag_21_dep;
  603. starpu_data_handle_t block21;
  604. if (block21_is_local)
  605. {
  606. block21 = STARPU_PLU(get_block_handle)(i, k);
  607. tag_21_dep = TAG21(k, i);
  608. }
  609. else
  610. {
  611. #ifdef SINGLE_TMP1221
  612. block21 = STARPU_PLU(get_tmp_21_block_handle)(i);
  613. #else
  614. block21 = STARPU_PLU(get_tmp_21_block_handle)(i, k);
  615. #endif
  616. tag_21_dep = TAG21_SAVE(k, i);
  617. }
  618. /* produced by TAG12_SAVE(k, j) */
  619. unsigned block12_is_local = (get_block_rank(k, j) == rank);
  620. starpu_tag_t tag_12_dep;
  621. starpu_data_handle_t block12;
  622. if (block12_is_local)
  623. {
  624. // block12 = STARPU_PLU(get_block_handle)(j, k);
  625. block12 = STARPU_PLU(get_block_handle)(k, j);
  626. tag_12_dep = TAG12(k, j);
  627. }
  628. else
  629. {
  630. #ifdef SINGLE_TMP1221
  631. block12 = STARPU_PLU(get_tmp_12_block_handle)(j);
  632. #else
  633. block12 = STARPU_PLU(get_tmp_12_block_handle)(j, k);
  634. #endif
  635. tag_12_dep = TAG12_SAVE(k, j);
  636. }
  637. #ifdef STARPU_DEVEL
  638. #warning temporary fix :/
  639. #endif
  640. //task->handles[0] = block21;
  641. task->handles[0] = block12;
  642. //task->handles[1] = block12;
  643. task->handles[1] = block21;
  644. /* produced by TAG22(k-1, i, j) */
  645. task->handles[2] = STARPU_PLU(get_block_handle)(i, j);
  646. STARPU_ASSERT(task->handles[0] != STARPU_POISON_PTR);
  647. STARPU_ASSERT(task->handles[1] != STARPU_POISON_PTR);
  648. STARPU_ASSERT(task->handles[2] != STARPU_POISON_PTR);
  649. if (!no_prio && (i == k + 1) && (j == k +1) )
  650. {
  651. task->priority = STARPU_MAX_PRIO;
  652. }
  653. /* enforce dependencies ... */
  654. if (k > 0)
  655. {
  656. starpu_tag_declare_deps(TAG22(k, i, j), 3, TAG22(k-1, i, j), tag_12_dep, tag_21_dep);
  657. }
  658. else
  659. {
  660. starpu_tag_declare_deps(TAG22(k, i, j), 2, tag_12_dep, tag_21_dep);
  661. }
  662. int ret = starpu_task_submit(task);
  663. STARPU_CHECK_RETURN_VALUE(ret, "starpu_task_submit");
  664. }
  665. static void create_task_22(unsigned k, unsigned i, unsigned j)
  666. {
  667. if (get_block_rank(i, j) == rank)
  668. {
  669. // fprintf(stderr, "CREATE real task 22(k = %d, i = %d, j = %d) on node %d\n", k, i, j, rank);
  670. create_task_22_real(k, i, j);
  671. }
  672. // else
  673. // {
  674. // fprintf(stderr, "Node %d needs not 22(k=%d, i=%d, j = %d)\n", rank, k,i,j);
  675. // }
  676. }
  677. static void wait_tag_and_fetch_handle(starpu_tag_t tag, starpu_data_handle_t handle)
  678. {
  679. STARPU_ASSERT(handle != STARPU_POISON_PTR);
  680. starpu_tag_wait(tag);
  681. // fprintf(stderr, "Rank %d : tag %lx is done\n", rank, tag);
  682. starpu_data_acquire(handle, STARPU_R);
  683. starpu_data_release(handle);
  684. // starpu_data_unregister(handle);
  685. }
  686. static void wait_termination(void)
  687. {
  688. unsigned k, i, j;
  689. for (k = 0; k < nblocks; k++)
  690. {
  691. /* Wait task 11k if needed */
  692. if (get_block_rank(k, k) == rank)
  693. {
  694. starpu_data_handle_t diag_block = STARPU_PLU(get_block_handle)(k, k);
  695. wait_tag_and_fetch_handle(TAG11_SAVE(k), diag_block);
  696. }
  697. for (i = k + 1; i < nblocks; i++)
  698. {
  699. /* Wait task 21ki if needed */
  700. if (get_block_rank(i, k) == rank)
  701. {
  702. starpu_data_handle_t block21 = STARPU_PLU(get_block_handle)(i, k);
  703. //starpu_data_handle_t block21 = STARPU_PLU(get_block_handle)(k, i);
  704. //fprintf(stderr, "BLOCK21 i %d k %d -> handle %p\n", i, k, block21);
  705. wait_tag_and_fetch_handle(TAG21_SAVE(k, i), block21);
  706. }
  707. }
  708. for (j = k + 1; j < nblocks; j++)
  709. {
  710. /* Wait task 12kj if needed */
  711. if (get_block_rank(k, j) == rank)
  712. {
  713. //starpu_data_handle_t block12 = STARPU_PLU(get_block_handle)(j, k);
  714. starpu_data_handle_t block12 = STARPU_PLU(get_block_handle)(k, j);
  715. //fprintf(stderr, "BLOCK12 j %d k %d -> handle %p\n", j, k, block12);
  716. wait_tag_and_fetch_handle(TAG12_SAVE(k, j), block12);
  717. }
  718. }
  719. }
  720. }
  721. /*
  722. * code to bootstrap the factorization
  723. */
  724. double STARPU_PLU(plu_main)(unsigned _nblocks, int _rank, int _world_size, unsigned _no_prio)
  725. {
  726. double start;
  727. double end;
  728. nblocks = _nblocks;
  729. rank = _rank;
  730. world_size = _world_size;
  731. no_prio = _no_prio;
  732. /* create all the DAG nodes */
  733. unsigned i,j,k;
  734. for (k = 0; k < nblocks; k++)
  735. {
  736. starpu_iteration_push(k);
  737. create_task_11(k);
  738. for (i = k+1; i<nblocks; i++)
  739. {
  740. create_task_12(k, i);
  741. create_task_21(k, i);
  742. }
  743. for (i = k+1; i<nblocks; i++)
  744. {
  745. for (j = k+1; j<nblocks; j++)
  746. {
  747. create_task_22(k, i, j);
  748. }
  749. }
  750. starpu_iteration_pop();
  751. }
  752. int barrier_ret = starpu_mpi_barrier(MPI_COMM_WORLD);
  753. STARPU_ASSERT(barrier_ret == MPI_SUCCESS);
  754. /* schedule the codelet */
  755. start = starpu_timing_now();
  756. starpu_tag_notify_from_apps(STARPU_TAG_INIT);
  757. wait_termination();
  758. end = starpu_timing_now();
  759. double timing = end - start;
  760. // fprintf(stderr, "RANK %d -> took %f ms\n", rank, timing/1000);
  761. return timing;
  762. }