pxlu.c 21 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412413414415416417418419420421422423424425426427428429430431432433434435436437438439440441442443444445446447448449450451452453454455456457458459460461462463464465466467468469470471472473474475476477478479480481482483484485486487488489490491492493494495496497498499500501502503504505506507508509510511512513514515516517518519520521522523524525526527528529530531532533534535536537538539540541542543544545546547548549550551552553554555556557558559560561562563564565566567568569570571572573574575576577578579580581582583584585586587588589590591592593594595596597598599600601602603604605606607608609610611612613614615616617618619620621622623624625626627628629630631632633634635636637638639640641642643644645646647648649650651652653654655656657658659660661662663664665666667668669670671672673674675676677678679680681682683684685686687688689690691692693694695696697698699700701702703704705706707708709710711712713714715716717718719720721722723724725726727728729730731732733734735736737738739740741742743744745746747748749750751752753754755756757758759760761762763764765766767768769770771772773774775776777778779780781782783784785786787788789790791792793794795796797798799800801802803804805806807808809810811812813814815816817818819820821822823824825826827828829830831832833834835836837838839840841842843844845846847848849850851852853854855856857858859860861862863864865866867868869870871872873874875876877878879880881882883884885886887888889890891892893894895896897898899900901902903904905906907908909910911912913914915916917918919920921922
  1. /* StarPU --- Runtime system for heterogeneous multicore architectures.
  2. *
  3. * Copyright (C) 2010-2020 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, int 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. int 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, int 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. int 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. int 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->cl_arg = create_debug_info(k, k, k);
  224. /* which sub-data is manipulated ? */
  225. task->handles[0] = STARPU_PLU(get_block_handle)(k, k);
  226. struct callback_arg *arg = malloc(sizeof(struct callback_arg));
  227. arg->k = k;
  228. task->callback_func = callback_task_11_real;
  229. task->callback_arg = arg;
  230. /* this is an important task */
  231. if (!no_prio)
  232. task->priority = STARPU_MAX_PRIO;
  233. /* enforce dependencies ... */
  234. if (k > 0)
  235. {
  236. starpu_tag_declare_deps(TAG11(k), 1, TAG22(k-1, k, k));
  237. }
  238. else
  239. {
  240. starpu_tag_declare_deps(TAG11(k), 1, STARPU_TAG_INIT);
  241. }
  242. int ret = starpu_task_submit(task);
  243. STARPU_CHECK_RETURN_VALUE(ret, "starpu_task_submit");
  244. }
  245. static void create_task_11(unsigned k)
  246. {
  247. if (get_block_rank(k, k) == rank)
  248. {
  249. #ifdef VERBOSE_INIT
  250. fprintf(stderr, "CREATE real task 11(%u) (TAG11_SAVE(%u) = %llux) on node %d\n", k, k, (unsigned long long) TAG11_SAVE(k), rank);
  251. #endif
  252. create_task_11_real(k);
  253. }
  254. else
  255. {
  256. /* We don't handle the task, but perhaps we have to generate MPI transfers. */
  257. int rank_mask[world_size];
  258. find_nodes_using_11(k, rank_mask);
  259. if (rank_mask[rank])
  260. {
  261. #ifdef VERBOSE_INIT
  262. fprintf(stderr, "create RECV task 11(%u) on node %d\n", k, rank);
  263. #endif
  264. create_task_11_recv(k);
  265. }
  266. else
  267. {
  268. #ifdef VERBOSE_INIT
  269. fprintf(stderr, "Node %d needs not 11(%u)\n", rank, k);
  270. #endif
  271. }
  272. }
  273. }
  274. /*
  275. * Task 12 (Update lower left (TRSM))
  276. */
  277. static void create_task_12_recv(unsigned k, unsigned j)
  278. {
  279. /* The current node is not computing that task, so we receive the block
  280. * with MPI */
  281. /* We don't issue a MPI receive request until everyone using the
  282. * temporary buffer is done : 12_(k-1)j can be used by 22_(k-1)ij with
  283. * i >= k */
  284. unsigned ndeps = 0;
  285. starpu_tag_t tag_array[nblocks];
  286. unsigned start;
  287. unsigned bound;
  288. #ifdef SINGLE_TMP1221
  289. bound = 0;
  290. start = (k-1)+1;
  291. #else
  292. bound = 1;
  293. start = (k-2)+1;
  294. #endif
  295. if (k > bound)
  296. {
  297. unsigned i;
  298. for (i = start; i < nblocks; i++)
  299. {
  300. if (rank == get_block_rank(i, j))
  301. #ifdef SINGLE_TMP1221
  302. tag_array[ndeps++] = TAG22(k-1, i, j);
  303. #else
  304. tag_array[ndeps++] = TAG22(k-2, i, j);
  305. #endif
  306. }
  307. }
  308. int source = get_block_rank(k, j);
  309. #ifdef SINGLE_TMP1221
  310. starpu_data_handle_t block_handle = STARPU_PLU(get_tmp_12_block_handle)(j);
  311. #else
  312. starpu_data_handle_t block_handle = STARPU_PLU(get_tmp_12_block_handle)(j,k);
  313. #endif
  314. int mpi_tag = MPI_TAG12(k, j);
  315. starpu_tag_t partial_tag = TAG12_SAVE_PARTIAL(k, j);
  316. starpu_tag_t unlocked_tag = TAG12_SAVE(k, j);
  317. receive_when_deps_are_done(ndeps, tag_array, source, mpi_tag, block_handle, partial_tag, unlocked_tag);
  318. }
  319. static void find_nodes_using_12(unsigned k, unsigned j, int *rank_mask)
  320. {
  321. memset(rank_mask, 0, world_size*sizeof(int));
  322. /* Block 12_kj is used to compute 22_kij with i > k */
  323. unsigned i;
  324. for (i = k+1; i < nblocks; i++)
  325. {
  326. int r = get_block_rank(i, j);
  327. rank_mask[r] = 1;
  328. }
  329. }
  330. static void callback_task_12_real(void *_arg)
  331. {
  332. struct callback_arg *arg = _arg;
  333. unsigned k = arg->k;
  334. unsigned j = arg->j;
  335. /* Find all the nodes potentially requiring this block */
  336. int rank_mask[world_size];
  337. find_nodes_using_12(k, j, rank_mask);
  338. rank_mask[rank] = 0;
  339. /* Send the block to those nodes */
  340. starpu_data_handle_t block_handle = STARPU_PLU(get_block_handle)(k, j);
  341. starpu_tag_t tag = TAG12_SAVE(k, j);
  342. int mpi_tag = MPI_TAG12(k, j);
  343. send_data_to_mask(block_handle, rank_mask, mpi_tag, tag);
  344. free(arg);
  345. }
  346. static void create_task_12_real(unsigned k, unsigned j)
  347. {
  348. struct starpu_task *task = create_task(TAG12(k, j));
  349. #ifdef STARPU_DEVEL
  350. #warning temporary fix :/
  351. #endif
  352. // task->cl = &STARPU_PLU(cl12);
  353. task->cl = &STARPU_PLU(cl21);
  354. task->cl_arg = create_debug_info(j, j, k);
  355. unsigned diag_block_is_local = (get_block_rank(k, k) == rank);
  356. starpu_tag_t tag_11_dep;
  357. /* which sub-data is manipulated ? */
  358. starpu_data_handle_t diag_block;
  359. if (diag_block_is_local)
  360. {
  361. diag_block = STARPU_PLU(get_block_handle)(k, k);
  362. tag_11_dep = TAG11(k);
  363. }
  364. else
  365. {
  366. #ifdef SINGLE_TMP11
  367. diag_block = STARPU_PLU(get_tmp_11_block_handle)();
  368. #else
  369. diag_block = STARPU_PLU(get_tmp_11_block_handle)(k);
  370. #endif
  371. tag_11_dep = TAG11_SAVE(k);
  372. }
  373. task->handles[0] = diag_block;
  374. task->handles[1] = STARPU_PLU(get_block_handle)(k, j);
  375. STARPU_ASSERT(get_block_rank(k, j) == rank);
  376. STARPU_ASSERT(task->handles[0] != STARPU_POISON_PTR);
  377. STARPU_ASSERT(task->handles[1] != STARPU_POISON_PTR);
  378. struct callback_arg *arg = malloc(sizeof(struct callback_arg));
  379. arg->j = j;
  380. arg->k = k;
  381. task->callback_func = callback_task_12_real;
  382. task->callback_arg = arg;
  383. if (!no_prio && (j == k+1))
  384. {
  385. task->priority = STARPU_MAX_PRIO;
  386. }
  387. /* enforce dependencies ... */
  388. if (k > 0)
  389. {
  390. starpu_tag_declare_deps(TAG12(k, j), 2, tag_11_dep, TAG22(k-1, k, j));
  391. }
  392. else
  393. {
  394. starpu_tag_declare_deps(TAG12(k, j), 1, tag_11_dep);
  395. }
  396. int ret = starpu_task_submit(task);
  397. STARPU_CHECK_RETURN_VALUE(ret, "starpu_task_submit");
  398. }
  399. static void create_task_12(unsigned k, unsigned j)
  400. {
  401. if (get_block_rank(k, j) == rank)
  402. {
  403. #ifdef VERBOSE_INIT
  404. fprintf(stderr, "CREATE real task 12(k = %u, j = %u) on node %d\n", k, j, rank);
  405. #endif
  406. create_task_12_real(k, j);
  407. }
  408. else
  409. {
  410. /* We don't handle the task, but perhaps we have to generate MPI transfers. */
  411. int rank_mask[world_size];
  412. find_nodes_using_12(k, j, rank_mask);
  413. if (rank_mask[rank])
  414. {
  415. #ifdef VERBOSE_INIT
  416. fprintf(stderr, "create RECV task 12(k = %u, j = %u) on node %d\n", k, j, rank);
  417. #endif
  418. create_task_12_recv(k, j);
  419. }
  420. else
  421. {
  422. #ifdef VERBOSE_INIT
  423. fprintf(stderr, "Node %d needs not 12(k=%u, i=%u)\n", rank, k, j);
  424. #endif
  425. }
  426. }
  427. }
  428. /*
  429. * Task 21 (Update upper right (TRSM))
  430. */
  431. static void create_task_21_recv(unsigned k, unsigned i)
  432. {
  433. /* The current node is not computing that task, so we receive the block
  434. * with MPI */
  435. /* We don't issue a MPI receive request until everyone using the
  436. * temporary buffer is done : 21_(k-1)i can be used by 22_(k-1)ij with
  437. * j >= k */
  438. unsigned ndeps = 0;
  439. starpu_tag_t tag_array[nblocks];
  440. unsigned bound;
  441. unsigned start;
  442. #ifdef SINGLE_TMP1221
  443. bound = 0;
  444. start = (k-1)+1;
  445. #else
  446. bound = 1;
  447. start = (k-2)+1;
  448. #endif
  449. if (k > bound)
  450. {
  451. unsigned j;
  452. for (j = start; j < nblocks; j++)
  453. {
  454. if (rank == get_block_rank(i, j))
  455. #ifdef SINGLE_TMP1221
  456. tag_array[ndeps++] = TAG22(k-1, i, j);
  457. #else
  458. tag_array[ndeps++] = TAG22(k-2, i, j);
  459. #endif
  460. }
  461. }
  462. int source = get_block_rank(i, k);
  463. #ifdef SINGLE_TMP1221
  464. starpu_data_handle_t block_handle = STARPU_PLU(get_tmp_21_block_handle)(i);
  465. #else
  466. starpu_data_handle_t block_handle = STARPU_PLU(get_tmp_21_block_handle)(i, k);
  467. #endif
  468. int mpi_tag = MPI_TAG21(k, i);
  469. starpu_tag_t partial_tag = TAG21_SAVE_PARTIAL(k, i);
  470. starpu_tag_t unlocked_tag = TAG21_SAVE(k, i);
  471. // fprintf(stderr, "NODE %d - 21 (%d, %d) - recv when done ndeps %d - tag array %lx\n", rank, k, i, ndeps, tag_array[0]);
  472. receive_when_deps_are_done(ndeps, tag_array, source, mpi_tag, block_handle, partial_tag, unlocked_tag);
  473. }
  474. static void find_nodes_using_21(unsigned k, unsigned i, int *rank_mask)
  475. {
  476. memset(rank_mask, 0, world_size*sizeof(int));
  477. /* Block 21_ki is used to compute 22_kij with j > k */
  478. unsigned j;
  479. for (j = k+1; j < nblocks; j++)
  480. {
  481. int r = get_block_rank(i, j);
  482. rank_mask[r] = 1;
  483. }
  484. }
  485. static void callback_task_21_real(void *_arg)
  486. {
  487. struct callback_arg *arg = _arg;
  488. unsigned k = arg->k;
  489. unsigned i = arg->i;
  490. /* Find all the nodes potentially requiring this block */
  491. int rank_mask[world_size];
  492. find_nodes_using_21(k, i, rank_mask);
  493. rank_mask[rank] = 0;
  494. /* Send the block to those nodes */
  495. starpu_data_handle_t block_handle = STARPU_PLU(get_block_handle)(i, k);
  496. starpu_tag_t tag = TAG21_SAVE(k, i);
  497. int mpi_tag = MPI_TAG21(k, i);
  498. send_data_to_mask(block_handle, rank_mask, mpi_tag, tag);
  499. free(arg);
  500. }
  501. static void create_task_21_real(unsigned k, unsigned i)
  502. {
  503. struct starpu_task *task = create_task(TAG21(k, i));
  504. #ifdef STARPU_DEVEL
  505. #warning temporary fix
  506. #endif
  507. // task->cl = &STARPU_PLU(cl21);
  508. task->cl = &STARPU_PLU(cl12);
  509. task->cl_arg = create_debug_info(i, i, k);
  510. unsigned diag_block_is_local = (get_block_rank(k, k) == rank);
  511. starpu_tag_t tag_11_dep;
  512. /* which sub-data is manipulated ? */
  513. starpu_data_handle_t diag_block;
  514. if (diag_block_is_local)
  515. {
  516. diag_block = STARPU_PLU(get_block_handle)(k, k);
  517. tag_11_dep = TAG11(k);
  518. }
  519. else
  520. {
  521. #ifdef SINGLE_TMP11
  522. diag_block = STARPU_PLU(get_tmp_11_block_handle)();
  523. #else
  524. diag_block = STARPU_PLU(get_tmp_11_block_handle)(k);
  525. #endif
  526. tag_11_dep = TAG11_SAVE(k);
  527. }
  528. task->handles[0] = diag_block;
  529. task->handles[1] = STARPU_PLU(get_block_handle)(i, k);
  530. STARPU_ASSERT(task->handles[0] != STARPU_POISON_PTR);
  531. STARPU_ASSERT(task->handles[1] != STARPU_POISON_PTR);
  532. struct callback_arg *arg = malloc(sizeof(struct callback_arg));
  533. arg->i = i;
  534. arg->k = k;
  535. task->callback_func = callback_task_21_real;
  536. task->callback_arg = arg;
  537. if (!no_prio && (i == k+1))
  538. {
  539. task->priority = STARPU_MAX_PRIO;
  540. }
  541. /* enforce dependencies ... */
  542. if (k > 0)
  543. {
  544. starpu_tag_declare_deps(TAG21(k, i), 2, tag_11_dep, TAG22(k-1, i, k));
  545. }
  546. else
  547. {
  548. starpu_tag_declare_deps(TAG21(k, i), 1, tag_11_dep);
  549. }
  550. int ret = starpu_task_submit(task);
  551. STARPU_CHECK_RETURN_VALUE(ret, "starpu_task_submit");
  552. }
  553. static void create_task_21(unsigned k, unsigned i)
  554. {
  555. if (get_block_rank(i, k) == rank)
  556. {
  557. #ifdef VERBOSE_INIT
  558. fprintf(stderr, "CREATE real task 21(k = %u, i = %u) on node %d\n", k, i, rank);
  559. #endif
  560. create_task_21_real(k, i);
  561. }
  562. else
  563. {
  564. /* We don't handle the task, but perhaps we have to generate MPI transfers. */
  565. int rank_mask[world_size];
  566. find_nodes_using_21(k, i, rank_mask);
  567. if (rank_mask[rank])
  568. {
  569. #ifdef VERBOSE_INIT
  570. fprintf(stderr, "create RECV task 21(k = %u, i = %u) on node %d\n", k, i, rank);
  571. #endif
  572. create_task_21_recv(k, i);
  573. }
  574. else
  575. {
  576. #ifdef VERBOSE_INIT
  577. fprintf(stderr, "Node %d needs not 21(k=%u, i=%u)\n", rank, k,i);
  578. #endif
  579. }
  580. }
  581. }
  582. /*
  583. * Task 22 (GEMM)
  584. */
  585. static void create_task_22_real(unsigned k, unsigned i, unsigned j)
  586. {
  587. // printf("task 22 k,i,j = %d,%d,%d TAG = %llx\n", k,i,j, TAG22(k,i,j));
  588. struct starpu_task *task = create_task(TAG22(k, i, j));
  589. task->cl = &STARPU_PLU(cl22);
  590. task->cl_arg = create_debug_info(i, j, k);
  591. /* which sub-data is manipulated ? */
  592. /* produced by TAG21_SAVE(k, i) */
  593. unsigned block21_is_local = (get_block_rank(i, k) == rank);
  594. starpu_tag_t tag_21_dep;
  595. starpu_data_handle_t block21;
  596. if (block21_is_local)
  597. {
  598. block21 = STARPU_PLU(get_block_handle)(i, k);
  599. tag_21_dep = TAG21(k, i);
  600. }
  601. else
  602. {
  603. #ifdef SINGLE_TMP1221
  604. block21 = STARPU_PLU(get_tmp_21_block_handle)(i);
  605. #else
  606. block21 = STARPU_PLU(get_tmp_21_block_handle)(i, k);
  607. #endif
  608. tag_21_dep = TAG21_SAVE(k, i);
  609. }
  610. /* produced by TAG12_SAVE(k, j) */
  611. unsigned block12_is_local = (get_block_rank(k, j) == rank);
  612. starpu_tag_t tag_12_dep;
  613. starpu_data_handle_t block12;
  614. if (block12_is_local)
  615. {
  616. // block12 = STARPU_PLU(get_block_handle)(j, k);
  617. block12 = STARPU_PLU(get_block_handle)(k, j);
  618. tag_12_dep = TAG12(k, j);
  619. }
  620. else
  621. {
  622. #ifdef SINGLE_TMP1221
  623. block12 = STARPU_PLU(get_tmp_12_block_handle)(j);
  624. #else
  625. block12 = STARPU_PLU(get_tmp_12_block_handle)(j, k);
  626. #endif
  627. tag_12_dep = TAG12_SAVE(k, j);
  628. }
  629. #ifdef STARPU_DEVEL
  630. #warning temporary fix :/
  631. #endif
  632. //task->handles[0] = block21;
  633. task->handles[0] = block12;
  634. //task->handles[1] = block12;
  635. task->handles[1] = block21;
  636. /* produced by TAG22(k-1, i, j) */
  637. task->handles[2] = STARPU_PLU(get_block_handle)(i, j);
  638. STARPU_ASSERT(task->handles[0] != STARPU_POISON_PTR);
  639. STARPU_ASSERT(task->handles[1] != STARPU_POISON_PTR);
  640. STARPU_ASSERT(task->handles[2] != STARPU_POISON_PTR);
  641. if (!no_prio && (i == k + 1) && (j == k +1) )
  642. {
  643. task->priority = STARPU_MAX_PRIO;
  644. }
  645. /* enforce dependencies ... */
  646. if (k > 0)
  647. {
  648. starpu_tag_declare_deps(TAG22(k, i, j), 3, TAG22(k-1, i, j), tag_12_dep, tag_21_dep);
  649. }
  650. else
  651. {
  652. starpu_tag_declare_deps(TAG22(k, i, j), 2, tag_12_dep, tag_21_dep);
  653. }
  654. int ret = starpu_task_submit(task);
  655. STARPU_CHECK_RETURN_VALUE(ret, "starpu_task_submit");
  656. }
  657. static void create_task_22(unsigned k, unsigned i, unsigned j)
  658. {
  659. if (get_block_rank(i, j) == rank)
  660. {
  661. // fprintf(stderr, "CREATE real task 22(k = %d, i = %d, j = %d) on node %d\n", k, i, j, rank);
  662. create_task_22_real(k, i, j);
  663. }
  664. // else
  665. // {
  666. // fprintf(stderr, "Node %d needs not 22(k=%d, i=%d, j = %d)\n", rank, k,i,j);
  667. // }
  668. }
  669. static void wait_tag_and_fetch_handle(starpu_tag_t tag, starpu_data_handle_t handle)
  670. {
  671. STARPU_ASSERT(handle != STARPU_POISON_PTR);
  672. starpu_tag_wait(tag);
  673. // fprintf(stderr, "Rank %d : tag %lx is done\n", rank, tag);
  674. starpu_data_acquire(handle, STARPU_R);
  675. // starpu_data_unregister(handle);
  676. }
  677. static void wait_termination(void)
  678. {
  679. unsigned k, i, j;
  680. for (k = 0; k < nblocks; k++)
  681. {
  682. /* Wait task 11k if needed */
  683. if (get_block_rank(k, k) == rank)
  684. {
  685. starpu_data_handle_t diag_block = STARPU_PLU(get_block_handle)(k, k);
  686. wait_tag_and_fetch_handle(TAG11_SAVE(k), diag_block);
  687. }
  688. for (i = k + 1; i < nblocks; i++)
  689. {
  690. /* Wait task 21ki if needed */
  691. if (get_block_rank(i, k) == rank)
  692. {
  693. starpu_data_handle_t block21 = STARPU_PLU(get_block_handle)(i, k);
  694. //starpu_data_handle_t block21 = STARPU_PLU(get_block_handle)(k, i);
  695. //fprintf(stderr, "BLOCK21 i %d k %d -> handle %p\n", i, k, block21);
  696. wait_tag_and_fetch_handle(TAG21_SAVE(k, i), block21);
  697. }
  698. }
  699. for (j = k + 1; j < nblocks; j++)
  700. {
  701. /* Wait task 12kj if needed */
  702. if (get_block_rank(k, j) == rank)
  703. {
  704. //starpu_data_handle_t block12 = STARPU_PLU(get_block_handle)(j, k);
  705. starpu_data_handle_t block12 = STARPU_PLU(get_block_handle)(k, j);
  706. //fprintf(stderr, "BLOCK12 j %d k %d -> handle %p\n", j, k, block12);
  707. wait_tag_and_fetch_handle(TAG12_SAVE(k, j), block12);
  708. }
  709. }
  710. }
  711. }
  712. /*
  713. * code to bootstrap the factorization
  714. */
  715. double STARPU_PLU(plu_main)(unsigned _nblocks, int _rank, int _world_size, unsigned _no_prio)
  716. {
  717. double start;
  718. double end;
  719. nblocks = _nblocks;
  720. rank = _rank;
  721. world_size = _world_size;
  722. no_prio = _no_prio;
  723. /* create all the DAG nodes */
  724. unsigned i,j,k;
  725. for (k = 0; k < nblocks; k++)
  726. {
  727. starpu_iteration_push(k);
  728. create_task_11(k);
  729. for (i = k+1; i<nblocks; i++)
  730. {
  731. create_task_12(k, i);
  732. create_task_21(k, i);
  733. }
  734. for (i = k+1; i<nblocks; i++)
  735. {
  736. for (j = k+1; j<nblocks; j++)
  737. {
  738. create_task_22(k, i, j);
  739. }
  740. }
  741. starpu_iteration_pop();
  742. }
  743. int wait_ret = starpu_mpi_wait_for_all(MPI_COMM_WORLD);
  744. STARPU_ASSERT(wait_ret == MPI_SUCCESS);
  745. int barrier_ret = starpu_mpi_barrier(MPI_COMM_WORLD);
  746. STARPU_ASSERT(barrier_ret == MPI_SUCCESS);
  747. /* schedule the codelet */
  748. start = starpu_timing_now();
  749. starpu_tag_notify_from_apps(STARPU_TAG_INIT);
  750. wait_termination();
  751. end = starpu_timing_now();
  752. double timing = end - start;
  753. // fprintf(stderr, "RANK %d -> took %f ms\n", rank, timing/1000);
  754. return timing;
  755. }