pxlu.c 22 KB

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