pxlu.c 21 KB

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