pxlu.c 20 KB

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