pxlu.c 21 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412413414415416417418419420421422423424425426427428429430431432433434435436437438439440441442443444445446447448449450451452453454455456457458459460461462463464465466467468469470471472473474475476477478479480481482483484485486487488489490491492493494495496497498499500501502503504505506507508509510511512513514515516517518519520521522523524525526527528529530531532533534535536537538539540541542543544545546547548549550551552553554555556557558559560561562563564565566567568569570571572573574575576577578579580581582583584585586587588589590591592593594595596597598599600601602603604605606607608609610611612613614615616617618619620621622623624625626627628629630631632633634635636637638639640641642643644645646647648649650651652653654655656657658659660661662663664665666667668669670671672673674675676677678679680681682683684685686687688689690691692693694695696697698699700701702703704705706707708709710711712713714715716717718719720721722723724725726727728729730731732733734735736737738739740741742743744745746747748749750751752753754755756757758759760761762763764765766767768769770771772773774775776777778779780781782783784785786787788789790791792793794795796797798799800801802803804805806807808809810811812813814815816817818819820821822823824825826827828829830831832833834835836837838839840841842843844845846847848849850851852853854855856857858859860861862863864865866867868869870871872873874875876877878879880881882883884885886887888889890891892893894895896897898899900901902903904905906907908909910911912913914915916917918919920921922
  1. /* StarPU --- Runtime system for heterogeneous multicore architectures.
  2. *
  3. * Copyright (C) 2010,2011,2014,2017 Université de Bordeaux
  4. * Copyright (C) 2012,2017 Inria
  5. * Copyright (C) 2010-2013,2015,2017,2018 CNRS
  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 "pxlu.h"
  19. #include "pxlu_kernels.h"
  20. #include <sys/time.h>
  21. #define MPI_TAG11(k) ((1U << 16) | (k))
  22. #define MPI_TAG12(k, j) ((2U << 16) | (k)<<8 | (j))
  23. #define MPI_TAG21(k, i) ((3U << 16) | (i)<<8 | (k))
  24. // 11 21
  25. // 12 22
  26. #define TAG11(k) ((starpu_tag_t)( (1ULL<<50) | (unsigned long long)(k)))
  27. #define TAG12(k,j) ((starpu_tag_t)(((2ULL<<50) | (((unsigned long long)(k))<<32) \
  28. | (unsigned long long)(j))))
  29. #define TAG21(k,i) ((starpu_tag_t)(((3ULL<<50) | (((unsigned long long)(k))<<32) \
  30. | (unsigned long long)(i))))
  31. #define TAG22(k,i,j) ((starpu_tag_t)(((4ULL<<50) | ((unsigned long long)(k)<<32) \
  32. | ((unsigned long long)(i)<<16) \
  33. | (unsigned long long)(j))))
  34. #define TAG11_SAVE(k) ((starpu_tag_t)( (5ULL<<50) | (unsigned long long)(k)))
  35. #define TAG12_SAVE(k,j) ((starpu_tag_t)(((6ULL<<50) | (((unsigned long long)(k))<<32) \
  36. | (unsigned long long)(j))))
  37. #define TAG21_SAVE(k,i) ((starpu_tag_t)(((7ULL<<50) | (((unsigned long long)(k))<<32) \
  38. | (unsigned long long)(i))))
  39. #define TAG11_SAVE_PARTIAL(k) ((starpu_tag_t)( (8ULL<<50) | (unsigned long long)(k)))
  40. #define TAG12_SAVE_PARTIAL(k,j) ((starpu_tag_t)(((9ULL<<50) | (((unsigned long long)(k))<<32) \
  41. | (unsigned long long)(j))))
  42. #define TAG21_SAVE_PARTIAL(k,i) ((starpu_tag_t)(((10ULL<<50) | (((unsigned long long)(k))<<32) \
  43. | (unsigned long long)(i))))
  44. #define STARPU_TAG_INIT ((starpu_tag_t)(11ULL<<50))
  45. //#define VERBOSE_INIT 1
  46. //#define DEBUG 1
  47. static unsigned no_prio = 0;
  48. static unsigned nblocks = 0;
  49. static int rank = -1;
  50. static int world_size = -1;
  51. struct callback_arg
  52. {
  53. unsigned i, j, k;
  54. };
  55. /*
  56. * Various
  57. */
  58. static struct debug_info *create_debug_info(unsigned i, unsigned j, unsigned k)
  59. {
  60. struct debug_info *info = malloc(sizeof(struct debug_info));
  61. info->i = i;
  62. info->j = j;
  63. info->k = k;
  64. return info;
  65. }
  66. static struct starpu_task *create_task(starpu_tag_t id)
  67. {
  68. struct starpu_task *task = starpu_task_create();
  69. task->cl_arg = NULL;
  70. task->use_tag = 1;
  71. task->tag_id = id;
  72. return task;
  73. }
  74. /* Send handle to every node appearing in the mask, and unlock tag once the
  75. * transfers are done. */
  76. static void send_data_to_mask(starpu_data_handle_t handle, int *rank_mask, int mpi_tag, starpu_tag_t tag)
  77. {
  78. unsigned cnt = 0;
  79. STARPU_ASSERT(handle != STARPU_POISON_PTR);
  80. int rank_array[world_size];
  81. MPI_Comm comm_array[world_size];
  82. starpu_mpi_tag_t mpi_tag_array[world_size];
  83. starpu_data_handle_t handle_array[world_size];
  84. int r;
  85. for (r = 0; r < world_size; r++)
  86. {
  87. if (rank_mask[r])
  88. {
  89. rank_array[cnt] = r;
  90. comm_array[cnt] = MPI_COMM_WORLD;
  91. mpi_tag_array[cnt] = mpi_tag;
  92. handle_array[cnt] = handle;
  93. cnt++;
  94. }
  95. }
  96. if (cnt == 0)
  97. {
  98. /* In case there is no message to send, we release the tag at
  99. * once */
  100. starpu_tag_notify_from_apps(tag);
  101. }
  102. else
  103. {
  104. starpu_mpi_isend_array_detached_unlock_tag(cnt, handle_array,
  105. rank_array, mpi_tag_array, comm_array, tag);
  106. }
  107. }
  108. /* Initiate a receive request once all dependencies are fulfilled and unlock
  109. * tag 'unlocked_tag' once it's done. */
  110. struct recv_when_done_callback_arg
  111. {
  112. int source;
  113. int mpi_tag;
  114. starpu_data_handle_t handle;
  115. starpu_tag_t unlocked_tag;
  116. };
  117. static void callback_receive_when_done(void *_arg)
  118. {
  119. struct recv_when_done_callback_arg *arg = _arg;
  120. starpu_mpi_irecv_detached_unlock_tag(arg->handle, arg->source,
  121. arg->mpi_tag, MPI_COMM_WORLD, arg->unlocked_tag);
  122. free(arg);
  123. }
  124. static void receive_when_deps_are_done(unsigned ndeps, starpu_tag_t *deps_tags,
  125. int source, int mpi_tag,
  126. starpu_data_handle_t handle,
  127. starpu_tag_t partial_tag,
  128. starpu_tag_t unlocked_tag)
  129. {
  130. STARPU_ASSERT(handle != STARPU_POISON_PTR);
  131. struct recv_when_done_callback_arg *arg =
  132. malloc(sizeof(struct recv_when_done_callback_arg));
  133. arg->source = source;
  134. arg->mpi_tag = mpi_tag;
  135. arg->handle = handle;
  136. arg->unlocked_tag = unlocked_tag;
  137. if (ndeps == 0)
  138. {
  139. callback_receive_when_done(arg);
  140. return;
  141. }
  142. starpu_create_sync_task(partial_tag, ndeps, deps_tags,
  143. callback_receive_when_done, arg);
  144. }
  145. /*
  146. * Task 11 (diagonal factorization)
  147. */
  148. static void create_task_11_recv(unsigned k)
  149. {
  150. /* The current node is not computing that task, so we receive the block
  151. * with MPI */
  152. /* We don't issue a MPI receive request until everyone using the
  153. * temporary buffer is done : 11_(k-1) can be used by 12_(k-1)j and
  154. * 21(k-1)i with i,j >= k */
  155. unsigned ndeps = 0;
  156. starpu_tag_t tag_array[2*nblocks];
  157. #ifdef SINGLE_TMP11
  158. if (k > 0)
  159. {
  160. unsigned i;
  161. for (i = (k-1)+1; i < nblocks; i++)
  162. {
  163. if (rank == get_block_rank(i, k-1))
  164. tag_array[ndeps++] = TAG21(k-1, i);
  165. }
  166. }
  167. if (k > 0)
  168. {
  169. unsigned j;
  170. for (j = (k-1)+1; j < nblocks; j++)
  171. {
  172. if (rank == get_block_rank(k-1, j))
  173. tag_array[ndeps++] = TAG12(k-1, j);
  174. }
  175. }
  176. #endif
  177. int source = get_block_rank(k, k);
  178. #ifdef SINGLE_TMP11
  179. starpu_data_handle_t block_handle = STARPU_PLU(get_tmp_11_block_handle)();
  180. #else
  181. starpu_data_handle_t block_handle = STARPU_PLU(get_tmp_11_block_handle)(k);
  182. #endif
  183. int mpi_tag = MPI_TAG11(k);
  184. starpu_tag_t partial_tag = TAG11_SAVE_PARTIAL(k);
  185. starpu_tag_t unlocked_tag = TAG11_SAVE(k);
  186. // fprintf(stderr, "NODE %d - 11 (%d) - recv when done ndeps %d - tag array %lx\n", rank, k, ndeps, tag_array[0]);
  187. receive_when_deps_are_done(ndeps, tag_array, source, mpi_tag, block_handle, partial_tag, unlocked_tag);
  188. }
  189. static void find_nodes_using_11(unsigned k, int *rank_mask)
  190. {
  191. memset(rank_mask, 0, world_size*sizeof(int));
  192. /* Block 11_k is used to compute 12_kj + 12ki with i,j > k */
  193. unsigned i;
  194. for (i = k+1; i < nblocks; i++)
  195. {
  196. int r = get_block_rank(i, k);
  197. rank_mask[r] = 1;
  198. }
  199. unsigned j;
  200. for (j = k+1; j < nblocks; j++)
  201. {
  202. int r = get_block_rank(k, j);
  203. rank_mask[r] = 1;
  204. }
  205. }
  206. static void callback_task_11_real(void *_arg)
  207. {
  208. struct callback_arg *arg = _arg;
  209. unsigned k = arg->k;
  210. /* Find all the nodes potentially requiring this block */
  211. int rank_mask[world_size];
  212. find_nodes_using_11(k, rank_mask);
  213. rank_mask[rank] = 0;
  214. /* Send the block to those nodes */
  215. starpu_data_handle_t block_handle = STARPU_PLU(get_block_handle)(k, k);
  216. starpu_tag_t tag = TAG11_SAVE(k);
  217. int mpi_tag = MPI_TAG11(k);
  218. send_data_to_mask(block_handle, rank_mask, mpi_tag, tag);
  219. free(arg);
  220. }
  221. static void create_task_11_real(unsigned k)
  222. {
  223. struct starpu_task *task = create_task(TAG11(k));
  224. task->cl = &STARPU_PLU(cl11);
  225. task->cl_arg = create_debug_info(k, k, k);
  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. int 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. int 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->cl_arg = create_debug_info(j, j, k);
  357. unsigned diag_block_is_local = (get_block_rank(k, k) == rank);
  358. starpu_tag_t tag_11_dep;
  359. /* which sub-data is manipulated ? */
  360. starpu_data_handle_t diag_block;
  361. if (diag_block_is_local)
  362. {
  363. diag_block = STARPU_PLU(get_block_handle)(k, k);
  364. tag_11_dep = TAG11(k);
  365. }
  366. else
  367. {
  368. #ifdef SINGLE_TMP11
  369. diag_block = STARPU_PLU(get_tmp_11_block_handle)();
  370. #else
  371. diag_block = STARPU_PLU(get_tmp_11_block_handle)(k);
  372. #endif
  373. tag_11_dep = TAG11_SAVE(k);
  374. }
  375. task->handles[0] = diag_block;
  376. task->handles[1] = STARPU_PLU(get_block_handle)(k, j);
  377. STARPU_ASSERT(get_block_rank(k, j) == rank);
  378. STARPU_ASSERT(task->handles[0] != STARPU_POISON_PTR);
  379. STARPU_ASSERT(task->handles[1] != STARPU_POISON_PTR);
  380. struct callback_arg *arg = malloc(sizeof(struct callback_arg));
  381. arg->j = j;
  382. arg->k = k;
  383. task->callback_func = callback_task_12_real;
  384. task->callback_arg = arg;
  385. if (!no_prio && (j == k+1))
  386. {
  387. task->priority = STARPU_MAX_PRIO;
  388. }
  389. /* enforce dependencies ... */
  390. if (k > 0)
  391. {
  392. starpu_tag_declare_deps(TAG12(k, j), 2, tag_11_dep, TAG22(k-1, k, j));
  393. }
  394. else
  395. {
  396. starpu_tag_declare_deps(TAG12(k, j), 1, tag_11_dep);
  397. }
  398. int ret = starpu_task_submit(task);
  399. STARPU_CHECK_RETURN_VALUE(ret, "starpu_task_submit");
  400. }
  401. static void create_task_12(unsigned k, unsigned j)
  402. {
  403. if (get_block_rank(k, j) == rank)
  404. {
  405. #ifdef VERBOSE_INIT
  406. fprintf(stderr, "CREATE real task 12(k = %u, j = %u) on node %d\n", k, j, rank);
  407. #endif
  408. create_task_12_real(k, j);
  409. }
  410. else
  411. {
  412. /* We don't handle the task, but perhaps we have to generate MPI transfers. */
  413. int rank_mask[world_size];
  414. find_nodes_using_12(k, j, rank_mask);
  415. if (rank_mask[rank])
  416. {
  417. #ifdef VERBOSE_INIT
  418. fprintf(stderr, "create RECV task 12(k = %u, j = %u) on node %d\n", k, j, rank);
  419. #endif
  420. create_task_12_recv(k, j);
  421. }
  422. else
  423. {
  424. #ifdef VERBOSE_INIT
  425. fprintf(stderr, "Node %d needs not 12(k=%u, i=%u)\n", rank, k, j);
  426. #endif
  427. }
  428. }
  429. }
  430. /*
  431. * Task 21 (Update upper right (TRSM))
  432. */
  433. static void create_task_21_recv(unsigned k, unsigned i)
  434. {
  435. /* The current node is not computing that task, so we receive the block
  436. * with MPI */
  437. /* We don't issue a MPI receive request until everyone using the
  438. * temporary buffer is done : 21_(k-1)i can be used by 22_(k-1)ij with
  439. * j >= k */
  440. unsigned ndeps = 0;
  441. starpu_tag_t tag_array[nblocks];
  442. unsigned bound;
  443. unsigned start;
  444. #ifdef SINGLE_TMP1221
  445. bound = 0;
  446. start = (k-1)+1;
  447. #else
  448. bound = 1;
  449. start = (k-2)+1;
  450. #endif
  451. if (k > bound)
  452. {
  453. unsigned j;
  454. for (j = start; j < nblocks; j++)
  455. {
  456. if (rank == get_block_rank(i, j))
  457. #ifdef SINGLE_TMP1221
  458. tag_array[ndeps++] = TAG22(k-1, i, j);
  459. #else
  460. tag_array[ndeps++] = TAG22(k-2, i, j);
  461. #endif
  462. }
  463. }
  464. int source = get_block_rank(i, k);
  465. #ifdef SINGLE_TMP1221
  466. starpu_data_handle_t block_handle = STARPU_PLU(get_tmp_21_block_handle)(i);
  467. #else
  468. starpu_data_handle_t block_handle = STARPU_PLU(get_tmp_21_block_handle)(i, k);
  469. #endif
  470. int mpi_tag = MPI_TAG21(k, i);
  471. starpu_tag_t partial_tag = TAG21_SAVE_PARTIAL(k, i);
  472. starpu_tag_t unlocked_tag = TAG21_SAVE(k, i);
  473. // fprintf(stderr, "NODE %d - 21 (%d, %d) - recv when done ndeps %d - tag array %lx\n", rank, k, i, ndeps, tag_array[0]);
  474. receive_when_deps_are_done(ndeps, tag_array, source, mpi_tag, block_handle, partial_tag, unlocked_tag);
  475. }
  476. static void find_nodes_using_21(unsigned k, unsigned i, int *rank_mask)
  477. {
  478. memset(rank_mask, 0, world_size*sizeof(int));
  479. /* Block 21_ki is used to compute 22_kij with j > k */
  480. unsigned j;
  481. for (j = k+1; j < nblocks; j++)
  482. {
  483. int r = get_block_rank(i, j);
  484. rank_mask[r] = 1;
  485. }
  486. }
  487. static void callback_task_21_real(void *_arg)
  488. {
  489. struct callback_arg *arg = _arg;
  490. unsigned k = arg->k;
  491. unsigned i = arg->i;
  492. /* Find all the nodes potentially requiring this block */
  493. int rank_mask[world_size];
  494. find_nodes_using_21(k, i, rank_mask);
  495. rank_mask[rank] = 0;
  496. /* Send the block to those nodes */
  497. starpu_data_handle_t block_handle = STARPU_PLU(get_block_handle)(i, k);
  498. starpu_tag_t tag = TAG21_SAVE(k, i);
  499. int mpi_tag = MPI_TAG21(k, i);
  500. send_data_to_mask(block_handle, rank_mask, mpi_tag, tag);
  501. free(arg);
  502. }
  503. static void create_task_21_real(unsigned k, unsigned i)
  504. {
  505. struct starpu_task *task = create_task(TAG21(k, i));
  506. #ifdef STARPU_DEVEL
  507. #warning temporary fix
  508. #endif
  509. // task->cl = &STARPU_PLU(cl21);
  510. task->cl = &STARPU_PLU(cl12);
  511. task->cl_arg = create_debug_info(i, i, k);
  512. unsigned diag_block_is_local = (get_block_rank(k, k) == rank);
  513. starpu_tag_t tag_11_dep;
  514. /* which sub-data is manipulated ? */
  515. starpu_data_handle_t diag_block;
  516. if (diag_block_is_local)
  517. {
  518. diag_block = STARPU_PLU(get_block_handle)(k, k);
  519. tag_11_dep = TAG11(k);
  520. }
  521. else
  522. {
  523. #ifdef SINGLE_TMP11
  524. diag_block = STARPU_PLU(get_tmp_11_block_handle)();
  525. #else
  526. diag_block = STARPU_PLU(get_tmp_11_block_handle)(k);
  527. #endif
  528. tag_11_dep = TAG11_SAVE(k);
  529. }
  530. task->handles[0] = diag_block;
  531. task->handles[1] = STARPU_PLU(get_block_handle)(i, k);
  532. STARPU_ASSERT(task->handles[0] != STARPU_POISON_PTR);
  533. STARPU_ASSERT(task->handles[1] != STARPU_POISON_PTR);
  534. struct callback_arg *arg = malloc(sizeof(struct callback_arg));
  535. arg->i = i;
  536. arg->k = k;
  537. task->callback_func = callback_task_21_real;
  538. task->callback_arg = arg;
  539. if (!no_prio && (i == k+1))
  540. {
  541. task->priority = STARPU_MAX_PRIO;
  542. }
  543. /* enforce dependencies ... */
  544. if (k > 0)
  545. {
  546. starpu_tag_declare_deps(TAG21(k, i), 2, tag_11_dep, TAG22(k-1, i, k));
  547. }
  548. else
  549. {
  550. starpu_tag_declare_deps(TAG21(k, i), 1, tag_11_dep);
  551. }
  552. int ret = starpu_task_submit(task);
  553. STARPU_CHECK_RETURN_VALUE(ret, "starpu_task_submit");
  554. }
  555. static void create_task_21(unsigned k, unsigned i)
  556. {
  557. if (get_block_rank(i, k) == rank)
  558. {
  559. #ifdef VERBOSE_INIT
  560. fprintf(stderr, "CREATE real task 21(k = %u, i = %u) on node %d\n", k, i, rank);
  561. #endif
  562. create_task_21_real(k, i);
  563. }
  564. else
  565. {
  566. /* We don't handle the task, but perhaps we have to generate MPI transfers. */
  567. int rank_mask[world_size];
  568. find_nodes_using_21(k, i, rank_mask);
  569. if (rank_mask[rank])
  570. {
  571. #ifdef VERBOSE_INIT
  572. fprintf(stderr, "create RECV task 21(k = %u, i = %u) on node %d\n", k, i, rank);
  573. #endif
  574. create_task_21_recv(k, i);
  575. }
  576. else
  577. {
  578. #ifdef VERBOSE_INIT
  579. fprintf(stderr, "Node %d needs not 21(k=%u, i=%u)\n", rank, k,i);
  580. #endif
  581. }
  582. }
  583. }
  584. /*
  585. * Task 22 (GEMM)
  586. */
  587. static void create_task_22_real(unsigned k, unsigned i, unsigned j)
  588. {
  589. // printf("task 22 k,i,j = %d,%d,%d TAG = %llx\n", k,i,j, TAG22(k,i,j));
  590. struct starpu_task *task = create_task(TAG22(k, i, j));
  591. task->cl = &STARPU_PLU(cl22);
  592. task->cl_arg = create_debug_info(i, j, k);
  593. /* which sub-data is manipulated ? */
  594. /* produced by TAG21_SAVE(k, i) */
  595. unsigned block21_is_local = (get_block_rank(i, k) == rank);
  596. starpu_tag_t tag_21_dep;
  597. starpu_data_handle_t block21;
  598. if (block21_is_local)
  599. {
  600. block21 = STARPU_PLU(get_block_handle)(i, k);
  601. tag_21_dep = TAG21(k, i);
  602. }
  603. else
  604. {
  605. #ifdef SINGLE_TMP1221
  606. block21 = STARPU_PLU(get_tmp_21_block_handle)(i);
  607. #else
  608. block21 = STARPU_PLU(get_tmp_21_block_handle)(i, k);
  609. #endif
  610. tag_21_dep = TAG21_SAVE(k, i);
  611. }
  612. /* produced by TAG12_SAVE(k, j) */
  613. unsigned block12_is_local = (get_block_rank(k, j) == rank);
  614. starpu_tag_t tag_12_dep;
  615. starpu_data_handle_t block12;
  616. if (block12_is_local)
  617. {
  618. // block12 = STARPU_PLU(get_block_handle)(j, k);
  619. block12 = STARPU_PLU(get_block_handle)(k, j);
  620. tag_12_dep = TAG12(k, j);
  621. }
  622. else
  623. {
  624. #ifdef SINGLE_TMP1221
  625. block12 = STARPU_PLU(get_tmp_12_block_handle)(j);
  626. #else
  627. block12 = STARPU_PLU(get_tmp_12_block_handle)(j, k);
  628. #endif
  629. tag_12_dep = TAG12_SAVE(k, j);
  630. }
  631. #ifdef STARPU_DEVEL
  632. #warning temporary fix :/
  633. #endif
  634. //task->handles[0] = block21;
  635. task->handles[0] = block12;
  636. //task->handles[1] = block12;
  637. task->handles[1] = block21;
  638. /* produced by TAG22(k-1, i, j) */
  639. task->handles[2] = STARPU_PLU(get_block_handle)(i, j);
  640. STARPU_ASSERT(task->handles[0] != STARPU_POISON_PTR);
  641. STARPU_ASSERT(task->handles[1] != STARPU_POISON_PTR);
  642. STARPU_ASSERT(task->handles[2] != STARPU_POISON_PTR);
  643. if (!no_prio && (i == k + 1) && (j == k +1) )
  644. {
  645. task->priority = STARPU_MAX_PRIO;
  646. }
  647. /* enforce dependencies ... */
  648. if (k > 0)
  649. {
  650. starpu_tag_declare_deps(TAG22(k, i, j), 3, TAG22(k-1, i, j), tag_12_dep, tag_21_dep);
  651. }
  652. else
  653. {
  654. starpu_tag_declare_deps(TAG22(k, i, j), 2, tag_12_dep, tag_21_dep);
  655. }
  656. int ret = starpu_task_submit(task);
  657. STARPU_CHECK_RETURN_VALUE(ret, "starpu_task_submit");
  658. }
  659. static void create_task_22(unsigned k, unsigned i, unsigned j)
  660. {
  661. if (get_block_rank(i, j) == rank)
  662. {
  663. // fprintf(stderr, "CREATE real task 22(k = %d, i = %d, j = %d) on node %d\n", k, i, j, rank);
  664. create_task_22_real(k, i, j);
  665. }
  666. // else
  667. // {
  668. // fprintf(stderr, "Node %d needs not 22(k=%d, i=%d, j = %d)\n", rank, k,i,j);
  669. // }
  670. }
  671. static void wait_tag_and_fetch_handle(starpu_tag_t tag, starpu_data_handle_t handle)
  672. {
  673. STARPU_ASSERT(handle != STARPU_POISON_PTR);
  674. starpu_tag_wait(tag);
  675. // fprintf(stderr, "Rank %d : tag %lx is done\n", rank, tag);
  676. starpu_data_acquire(handle, STARPU_R);
  677. // starpu_data_unregister(handle);
  678. }
  679. static void wait_termination(void)
  680. {
  681. unsigned k, i, j;
  682. for (k = 0; k < nblocks; k++)
  683. {
  684. /* Wait task 11k if needed */
  685. if (get_block_rank(k, k) == rank)
  686. {
  687. starpu_data_handle_t diag_block = STARPU_PLU(get_block_handle)(k, k);
  688. wait_tag_and_fetch_handle(TAG11_SAVE(k), diag_block);
  689. }
  690. for (i = k + 1; i < nblocks; i++)
  691. {
  692. /* Wait task 21ki if needed */
  693. if (get_block_rank(i, k) == rank)
  694. {
  695. starpu_data_handle_t block21 = STARPU_PLU(get_block_handle)(i, k);
  696. //starpu_data_handle_t block21 = STARPU_PLU(get_block_handle)(k, i);
  697. //fprintf(stderr, "BLOCK21 i %d k %d -> handle %p\n", i, k, block21);
  698. wait_tag_and_fetch_handle(TAG21_SAVE(k, i), block21);
  699. }
  700. }
  701. for (j = k + 1; j < nblocks; j++)
  702. {
  703. /* Wait task 12kj if needed */
  704. if (get_block_rank(k, j) == rank)
  705. {
  706. //starpu_data_handle_t block12 = STARPU_PLU(get_block_handle)(j, k);
  707. starpu_data_handle_t block12 = STARPU_PLU(get_block_handle)(k, j);
  708. //fprintf(stderr, "BLOCK12 j %d k %d -> handle %p\n", j, k, block12);
  709. wait_tag_and_fetch_handle(TAG12_SAVE(k, j), block12);
  710. }
  711. }
  712. }
  713. }
  714. /*
  715. * code to bootstrap the factorization
  716. */
  717. double STARPU_PLU(plu_main)(unsigned _nblocks, int _rank, int _world_size, unsigned _no_prio)
  718. {
  719. double start;
  720. double end;
  721. nblocks = _nblocks;
  722. rank = _rank;
  723. world_size = _world_size;
  724. no_prio = _no_prio;
  725. /* create all the DAG nodes */
  726. unsigned i,j,k;
  727. for (k = 0; k < nblocks; k++)
  728. {
  729. starpu_iteration_push(k);
  730. create_task_11(k);
  731. for (i = k+1; i<nblocks; i++)
  732. {
  733. create_task_12(k, i);
  734. create_task_21(k, i);
  735. }
  736. for (i = k+1; i<nblocks; i++)
  737. {
  738. for (j = k+1; j<nblocks; j++)
  739. {
  740. create_task_22(k, i, j);
  741. }
  742. }
  743. starpu_iteration_pop();
  744. }
  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. }