pxlu.c 21 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412413414415416417418419420421422423424425426427428429430431432433434435436437438439440441442443444445446447448449450451452453454455456457458459460461462463464465466467468469470471472473474475476477478479480481482483484485486487488489490491492493494495496497498499500501502503504505506507508509510511512513514515516517518519520521522523524525526527528529530531532533534535536537538539540541542543544545546547548549550551552553554555556557558559560561562563564565566567568569570571572573574575576577578579580581582583584585586587588589590591592593594595596597598599600601602603604605606607608609610611612613614615616617618619620621622623624625626627628629630631632633634635636637638639640641642643644645646647648649650651652653654655656657658659660661662663664665666667668669670671672673674675676677678679680681682683684685686687688689690691692693694695696697698699700701702703704705706707708709710711712713714715716717718719720721722723724725726727728729730731732733734735736737738739740741742743744745746747748749750751752753754755756757758759760761762763764765766767768769770771772773774775776777778779780781782783784785786787788789790791792793794795796797798799800801802803804805806807808809810811812813814815816817818819820821822823824825826827828829830831832833834835836837838839840841842843844845846847848849850851852853854855856857858859860861862863864865866867868869870871
  1. /* StarPU --- Runtime system for heterogeneous multicore architectures.
  2. *
  3. * Copyright (C) 2010, 2011 Université de Bordeaux 1
  4. * Copyright (C) 2010, 2012 Centre National de la Recherche Scientifique
  5. *
  6. * StarPU is free software; you can redistribute it and/or modify
  7. * it under the terms of the GNU Lesser General Public License as published by
  8. * the Free Software Foundation; either version 2.1 of the License, or (at
  9. * your option) any later version.
  10. *
  11. * StarPU is distributed in the hope that it will be useful, but
  12. * WITHOUT ANY WARRANTY; without even the implied warranty of
  13. * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.
  14. *
  15. * See the GNU Lesser General Public License in COPYING.LGPL for more details.
  16. */
  17. #include "pxlu.h"
  18. #include "pxlu_kernels.h"
  19. #include <sys/time.h>
  20. #define MPI_TAG11(k) ((1U << 16) | (k))
  21. #define MPI_TAG12(k, j) ((2U << 16) | (k)<<8 | (j))
  22. #define MPI_TAG21(k, i) ((3U << 16) | (i)<<8 | (k))
  23. // 11 21
  24. // 12 22
  25. #define TAG11(k) ((starpu_tag_t)( (1ULL<<50) | (unsigned long long)(k)))
  26. #define TAG12(k,j) ((starpu_tag_t)(((2ULL<<50) | (((unsigned long long)(k))<<32) \
  27. | (unsigned long long)(j))))
  28. #define TAG21(k,i) ((starpu_tag_t)(((3ULL<<50) | (((unsigned long long)(k))<<32) \
  29. | (unsigned long long)(i))))
  30. #define TAG22(k,i,j) ((starpu_tag_t)(((4ULL<<50) | ((unsigned long long)(k)<<32) \
  31. | ((unsigned long long)(i)<<16) \
  32. | (unsigned long long)(j))))
  33. #define TAG11_SAVE(k) ((starpu_tag_t)( (5ULL<<50) | (unsigned long long)(k)))
  34. #define TAG12_SAVE(k,j) ((starpu_tag_t)(((6ULL<<50) | (((unsigned long long)(k))<<32) \
  35. | (unsigned long long)(j))))
  36. #define TAG21_SAVE(k,i) ((starpu_tag_t)(((7ULL<<50) | (((unsigned long long)(k))<<32) \
  37. | (unsigned long long)(i))))
  38. #define TAG11_SAVE_PARTIAL(k) ((starpu_tag_t)( (8ULL<<50) | (unsigned long long)(k)))
  39. #define TAG12_SAVE_PARTIAL(k,j) ((starpu_tag_t)(((9ULL<<50) | (((unsigned long long)(k))<<32) \
  40. | (unsigned long long)(j))))
  41. #define TAG21_SAVE_PARTIAL(k,i) ((starpu_tag_t)(((10ULL<<50) | (((unsigned long long)(k))<<32) \
  42. | (unsigned long long)(i))))
  43. #define STARPU_TAG_INIT ((starpu_tag_t)(11ULL<<50))
  44. //#define VERBOSE_INIT 1
  45. //#define DEBUG 1
  46. static unsigned no_prio = 0;
  47. static unsigned nblocks = 0;
  48. static int rank = -1;
  49. static int world_size = -1;
  50. struct callback_arg {
  51. unsigned i, j, k;
  52. };
  53. /*
  54. * Various
  55. */
  56. static struct debug_info *create_debug_info(unsigned i, unsigned j, unsigned k)
  57. {
  58. struct debug_info *info = malloc(sizeof(struct debug_info));
  59. info->i = i;
  60. info->j = j;
  61. info->k = k;
  62. return info;
  63. }
  64. static struct starpu_task *create_task(starpu_tag_t id)
  65. {
  66. struct starpu_task *task = starpu_task_create();
  67. task->cl_arg = NULL;
  68. task->use_tag = 1;
  69. task->tag_id = id;
  70. return task;
  71. }
  72. /* Send handle to every node appearing in the mask, and unlock tag once the
  73. * transfers are done. */
  74. static void send_data_to_mask(starpu_data_handle_t handle, int *rank_mask, int mpi_tag, starpu_tag_t tag)
  75. {
  76. unsigned cnt = 0;
  77. STARPU_ASSERT(handle != STARPU_POISON_PTR);
  78. int rank_array[world_size];
  79. MPI_Comm comm_array[world_size];
  80. int mpi_tag_array[world_size];
  81. starpu_data_handle_t handle_array[world_size];
  82. unsigned r;
  83. for (r = 0; r < world_size; r++)
  84. {
  85. if (rank_mask[r]) {
  86. rank_array[cnt] = r;
  87. comm_array[cnt] = MPI_COMM_WORLD;
  88. mpi_tag_array[cnt] = mpi_tag;
  89. handle_array[cnt] = handle;
  90. cnt++;
  91. }
  92. }
  93. if (cnt == 0)
  94. {
  95. /* In case there is no message to send, we release the tag at
  96. * once */
  97. starpu_tag_notify_from_apps(tag);
  98. }
  99. else {
  100. starpu_mpi_isend_array_detached_unlock_tag(cnt, handle_array,
  101. rank_array, mpi_tag_array, comm_array, tag);
  102. }
  103. }
  104. /* Initiate a receive request once all dependencies are fulfilled and unlock
  105. * tag 'unlocked_tag' once it's done. */
  106. struct recv_when_done_callback_arg {
  107. int source;
  108. int mpi_tag;
  109. starpu_data_handle_t handle;
  110. starpu_tag_t unlocked_tag;
  111. };
  112. static void callback_receive_when_done(void *_arg)
  113. {
  114. struct recv_when_done_callback_arg *arg = _arg;
  115. starpu_mpi_irecv_detached_unlock_tag(arg->handle, arg->source,
  116. arg->mpi_tag, MPI_COMM_WORLD, arg->unlocked_tag);
  117. free(arg);
  118. }
  119. static void receive_when_deps_are_done(unsigned ndeps, starpu_tag_t *deps_tags,
  120. int source, int mpi_tag,
  121. starpu_data_handle_t handle,
  122. starpu_tag_t partial_tag,
  123. starpu_tag_t unlocked_tag)
  124. {
  125. STARPU_ASSERT(handle != STARPU_POISON_PTR);
  126. struct recv_when_done_callback_arg *arg =
  127. malloc(sizeof(struct recv_when_done_callback_arg));
  128. arg->source = source;
  129. arg->mpi_tag = mpi_tag;
  130. arg->handle = handle;
  131. arg->unlocked_tag = unlocked_tag;
  132. if (ndeps == 0)
  133. {
  134. callback_receive_when_done(arg);
  135. return;
  136. }
  137. starpu_create_sync_task(partial_tag, ndeps, deps_tags,
  138. callback_receive_when_done, arg);
  139. }
  140. /*
  141. * Task 11 (diagonal factorization)
  142. */
  143. static void create_task_11_recv(unsigned k)
  144. {
  145. /* The current node is not computing that task, so we receive the block
  146. * with MPI */
  147. /* We don't issue a MPI receive request until everyone using the
  148. * temporary buffer is done : 11_(k-1) can be used by 12_(k-1)j and
  149. * 21(k-1)i with i,j >= k */
  150. unsigned ndeps = 0;
  151. starpu_tag_t tag_array[2*nblocks];
  152. #ifdef SINGLE_TMP11
  153. unsigned i, j;
  154. if (k > 0)
  155. for (i = (k-1)+1; i < nblocks; i++)
  156. {
  157. if (rank == get_block_rank(i, k-1))
  158. tag_array[ndeps++] = TAG21(k-1, i);
  159. }
  160. if (k > 0)
  161. for (j = (k-1)+1; j < nblocks; j++)
  162. {
  163. if (rank == get_block_rank(k-1, j))
  164. tag_array[ndeps++] = TAG12(k-1, j);
  165. }
  166. #endif
  167. int source = get_block_rank(k, k);
  168. #ifdef SINGLE_TMP11
  169. starpu_data_handle_t block_handle = STARPU_PLU(get_tmp_11_block_handle)();
  170. #else
  171. starpu_data_handle_t block_handle = STARPU_PLU(get_tmp_11_block_handle)(k);
  172. #endif
  173. int mpi_tag = MPI_TAG11(k);
  174. starpu_tag_t partial_tag = TAG11_SAVE_PARTIAL(k);
  175. starpu_tag_t unlocked_tag = TAG11_SAVE(k);
  176. // fprintf(stderr, "NODE %d - 11 (%d) - recv when done ndeps %d - tag array %lx\n", rank, k, ndeps, tag_array[0]);
  177. receive_when_deps_are_done(ndeps, tag_array, source, mpi_tag, block_handle, partial_tag, unlocked_tag);
  178. }
  179. static void find_nodes_using_11(unsigned k, int *rank_mask)
  180. {
  181. memset(rank_mask, 0, world_size*sizeof(int));
  182. /* Block 11_k is used to compute 12_kj + 12ki with i,j > k */
  183. unsigned i;
  184. for (i = k+1; i < nblocks; i++)
  185. {
  186. int r = get_block_rank(i, k);
  187. rank_mask[r] = 1;
  188. }
  189. unsigned j;
  190. for (j = k+1; j < nblocks; j++)
  191. {
  192. int r = get_block_rank(k, j);
  193. rank_mask[r] = 1;
  194. }
  195. }
  196. static void callback_task_11_real(void *_arg)
  197. {
  198. struct callback_arg *arg = _arg;
  199. unsigned k = arg->k;
  200. /* Find all the nodes potentially requiring this block */
  201. int rank_mask[world_size];
  202. find_nodes_using_11(k, rank_mask);
  203. rank_mask[rank] = 0;
  204. /* Send the block to those nodes */
  205. starpu_data_handle_t block_handle = STARPU_PLU(get_block_handle)(k, k);
  206. starpu_tag_t tag = TAG11_SAVE(k);
  207. int mpi_tag = MPI_TAG11(k);
  208. send_data_to_mask(block_handle, rank_mask, mpi_tag, tag);
  209. free(arg);
  210. }
  211. static void create_task_11_real(unsigned k)
  212. {
  213. struct starpu_task *task = create_task(TAG11(k));
  214. task->cl = &STARPU_PLU(cl11);
  215. task->cl_arg = create_debug_info(k, k, k);
  216. /* which sub-data is manipulated ? */
  217. task->handles[0] = STARPU_PLU(get_block_handle)(k, k);
  218. struct callback_arg *arg = malloc(sizeof(struct callback_arg));
  219. arg->k = k;
  220. task->callback_func = callback_task_11_real;
  221. task->callback_arg = arg;
  222. /* this is an important task */
  223. if (!no_prio)
  224. task->priority = STARPU_MAX_PRIO;
  225. /* enforce dependencies ... */
  226. if (k > 0) {
  227. starpu_tag_declare_deps(TAG11(k), 1, TAG22(k-1, k, k));
  228. }
  229. else {
  230. starpu_tag_declare_deps(TAG11(k), 1, STARPU_TAG_INIT);
  231. }
  232. int ret = starpu_task_submit(task);
  233. STARPU_CHECK_RETURN_VALUE(ret, "starpu_task_submit");
  234. }
  235. static void create_task_11(unsigned k)
  236. {
  237. if (get_block_rank(k, k) == rank)
  238. {
  239. #ifdef VERBOSE_INIT
  240. fprintf(stderr, "CREATE real task 11(%d) (TAG11_SAVE(%d) = %lx) on node %d\n", k, k, TAG11_SAVE(k), rank);
  241. #endif
  242. create_task_11_real(k);
  243. }
  244. else {
  245. /* We don't handle the task, but perhaps we have to generate MPI transfers. */
  246. int rank_mask[world_size];
  247. find_nodes_using_11(k, rank_mask);
  248. if (rank_mask[rank])
  249. {
  250. #ifdef VERBOSE_INIT
  251. fprintf(stderr, "create RECV task 11(%d) on node %d\n", k, rank);
  252. #endif
  253. create_task_11_recv(k);
  254. }
  255. else {
  256. #ifdef VERBOSE_INIT
  257. fprintf(stderr, "Node %d needs not 11(%d)\n", rank, k);
  258. #endif
  259. }
  260. }
  261. }
  262. /*
  263. * Task 12 (Update lower left (TRSM))
  264. */
  265. static void create_task_12_recv(unsigned k, unsigned j)
  266. {
  267. unsigned i;
  268. /* The current node is not computing that task, so we receive the block
  269. * with MPI */
  270. /* We don't issue a MPI receive request until everyone using the
  271. * temporary buffer is done : 12_(k-1)j can be used by 22_(k-1)ij with
  272. * i >= k */
  273. unsigned ndeps = 0;
  274. starpu_tag_t tag_array[nblocks];
  275. #ifdef SINGLE_TMP1221
  276. if (k > 0)
  277. for (i = (k-1)+1; i < nblocks; i++)
  278. #else
  279. if (k > 1)
  280. for (i = (k-2)+1; i < nblocks; i++)
  281. #endif
  282. {
  283. if (rank == get_block_rank(i, j))
  284. #ifdef SINGLE_TMP1221
  285. tag_array[ndeps++] = TAG22(k-1, i, j);
  286. #else
  287. tag_array[ndeps++] = TAG22(k-2, i, j);
  288. #endif
  289. }
  290. int source = get_block_rank(k, j);
  291. #ifdef SINGLE_TMP1221
  292. starpu_data_handle_t block_handle = STARPU_PLU(get_tmp_12_block_handle)(j);
  293. #else
  294. starpu_data_handle_t block_handle = STARPU_PLU(get_tmp_12_block_handle)(j,k);
  295. #endif
  296. int mpi_tag = MPI_TAG12(k, j);
  297. starpu_tag_t partial_tag = TAG12_SAVE_PARTIAL(k, j);
  298. starpu_tag_t unlocked_tag = TAG12_SAVE(k, j);
  299. receive_when_deps_are_done(ndeps, tag_array, source, mpi_tag, block_handle, partial_tag, unlocked_tag);
  300. }
  301. static void find_nodes_using_12(unsigned k, unsigned j, int *rank_mask)
  302. {
  303. memset(rank_mask, 0, world_size*sizeof(int));
  304. /* Block 12_kj is used to compute 22_kij with i > k */
  305. unsigned i;
  306. for (i = k+1; i < nblocks; i++)
  307. {
  308. int r = get_block_rank(i, j);
  309. rank_mask[r] = 1;
  310. }
  311. }
  312. static void callback_task_12_real(void *_arg)
  313. {
  314. struct callback_arg *arg = _arg;
  315. unsigned k = arg->k;
  316. unsigned j = arg->j;
  317. /* Find all the nodes potentially requiring this block */
  318. int rank_mask[world_size];
  319. find_nodes_using_12(k, j, rank_mask);
  320. rank_mask[rank] = 0;
  321. /* Send the block to those nodes */
  322. starpu_data_handle_t block_handle = STARPU_PLU(get_block_handle)(k, j);
  323. starpu_tag_t tag = TAG12_SAVE(k, j);
  324. int mpi_tag = MPI_TAG12(k, j);
  325. send_data_to_mask(block_handle, rank_mask, mpi_tag, tag);
  326. free(arg);
  327. }
  328. static void create_task_12_real(unsigned k, unsigned j)
  329. {
  330. struct starpu_task *task = create_task(TAG12(k, j));
  331. #warning temporary fix :/
  332. // task->cl = &STARPU_PLU(cl12);
  333. task->cl = &STARPU_PLU(cl21);
  334. task->cl_arg = create_debug_info(j, j, k);
  335. unsigned diag_block_is_local = (get_block_rank(k, k) == rank);
  336. starpu_tag_t tag_11_dep;
  337. /* which sub-data is manipulated ? */
  338. starpu_data_handle_t diag_block;
  339. if (diag_block_is_local)
  340. {
  341. diag_block = STARPU_PLU(get_block_handle)(k, k);
  342. tag_11_dep = TAG11(k);
  343. }
  344. else
  345. {
  346. #ifdef SINGLE_TMP11
  347. diag_block = STARPU_PLU(get_tmp_11_block_handle)();
  348. #else
  349. diag_block = STARPU_PLU(get_tmp_11_block_handle)(k);
  350. #endif
  351. tag_11_dep = TAG11_SAVE(k);
  352. }
  353. task->handles[0] = diag_block;
  354. task->handles[1] = STARPU_PLU(get_block_handle)(k, j);
  355. STARPU_ASSERT(get_block_rank(k, j) == rank);
  356. STARPU_ASSERT(task->handles[0] != STARPU_POISON_PTR);
  357. STARPU_ASSERT(task->handles[1] != 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. int ret = starpu_task_submit(task);
  374. STARPU_CHECK_RETURN_VALUE(ret, "starpu_task_submit");
  375. }
  376. static void create_task_12(unsigned k, unsigned j)
  377. {
  378. if (get_block_rank(k, j) == rank)
  379. {
  380. #ifdef VERBOSE_INIT
  381. fprintf(stderr, "CREATE real task 12(k = %d, j = %d) on node %d\n", k, j, rank);
  382. #endif
  383. create_task_12_real(k, j);
  384. }
  385. else {
  386. /* We don't handle the task, but perhaps we have to generate MPI transfers. */
  387. int rank_mask[world_size];
  388. find_nodes_using_12(k, j, rank_mask);
  389. if (rank_mask[rank])
  390. {
  391. #ifdef VERBOSE_INIT
  392. fprintf(stderr, "create RECV task 12(k = %d, j = %d) on node %d\n", k, j, rank);
  393. #endif
  394. create_task_12_recv(k, j);
  395. }
  396. else {
  397. #ifdef VERBOSE_INIT
  398. fprintf(stderr, "Node %d needs not 12(k=%d, i=%d)\n", rank, k, j);
  399. #endif
  400. }
  401. }
  402. }
  403. /*
  404. * Task 21 (Update upper right (TRSM))
  405. */
  406. static void create_task_21_recv(unsigned k, unsigned i)
  407. {
  408. unsigned j;
  409. /* The current node is not computing that task, so we receive the block
  410. * with MPI */
  411. /* We don't issue a MPI receive request until everyone using the
  412. * temporary buffer is done : 21_(k-1)i can be used by 22_(k-1)ij with
  413. * j >= k */
  414. unsigned ndeps = 0;
  415. starpu_tag_t tag_array[nblocks];
  416. #ifdef SINGLE_TMP1221
  417. if (k > 0)
  418. for (j = (k-1)+1; j < nblocks; j++)
  419. #else
  420. if (k > 1)
  421. for (j = (k-2)+1; j < nblocks; j++)
  422. #endif
  423. {
  424. if (rank == get_block_rank(i, j))
  425. #ifdef SINGLE_TMP1221
  426. tag_array[ndeps++] = TAG22(k-1, i, j);
  427. #else
  428. tag_array[ndeps++] = TAG22(k-2, i, j);
  429. #endif
  430. }
  431. int source = get_block_rank(i, k);
  432. #ifdef SINGLE_TMP1221
  433. starpu_data_handle_t block_handle = STARPU_PLU(get_tmp_21_block_handle)(i);
  434. #else
  435. starpu_data_handle_t block_handle = STARPU_PLU(get_tmp_21_block_handle)(i, k);
  436. #endif
  437. int mpi_tag = MPI_TAG21(k, i);
  438. starpu_tag_t partial_tag = TAG21_SAVE_PARTIAL(k, i);
  439. starpu_tag_t unlocked_tag = TAG21_SAVE(k, i);
  440. // fprintf(stderr, "NODE %d - 21 (%d, %d) - recv when done ndeps %d - tag array %lx\n", rank, k, i, ndeps, tag_array[0]);
  441. receive_when_deps_are_done(ndeps, tag_array, source, mpi_tag, block_handle, partial_tag, unlocked_tag);
  442. }
  443. static void find_nodes_using_21(unsigned k, unsigned i, int *rank_mask)
  444. {
  445. memset(rank_mask, 0, world_size*sizeof(int));
  446. /* Block 21_ki is used to compute 22_kij with j > k */
  447. unsigned j;
  448. for (j = k+1; j < nblocks; j++)
  449. {
  450. int r = get_block_rank(i, j);
  451. rank_mask[r] = 1;
  452. }
  453. }
  454. static void callback_task_21_real(void *_arg)
  455. {
  456. struct callback_arg *arg = _arg;
  457. unsigned k = arg->k;
  458. unsigned i = arg->i;
  459. /* Find all the nodes potentially requiring this block */
  460. int rank_mask[world_size];
  461. find_nodes_using_21(k, i, rank_mask);
  462. rank_mask[rank] = 0;
  463. /* Send the block to those nodes */
  464. starpu_data_handle_t block_handle = STARPU_PLU(get_block_handle)(i, k);
  465. starpu_tag_t tag = TAG21_SAVE(k, i);
  466. int mpi_tag = MPI_TAG21(k, i);
  467. send_data_to_mask(block_handle, rank_mask, mpi_tag, tag);
  468. free(arg);
  469. }
  470. static void create_task_21_real(unsigned k, unsigned i)
  471. {
  472. struct starpu_task *task = create_task(TAG21(k, i));
  473. #warning temporary fix
  474. // task->cl = &STARPU_PLU(cl21);
  475. task->cl = &STARPU_PLU(cl12);
  476. task->cl_arg = create_debug_info(i, i, k);
  477. unsigned diag_block_is_local = (get_block_rank(k, k) == rank);
  478. starpu_tag_t tag_11_dep;
  479. /* which sub-data is manipulated ? */
  480. starpu_data_handle_t diag_block;
  481. if (diag_block_is_local)
  482. {
  483. diag_block = STARPU_PLU(get_block_handle)(k, k);
  484. tag_11_dep = TAG11(k);
  485. }
  486. else
  487. {
  488. #ifdef SINGLE_TMP11
  489. diag_block = STARPU_PLU(get_tmp_11_block_handle)();
  490. #else
  491. diag_block = STARPU_PLU(get_tmp_11_block_handle)(k);
  492. #endif
  493. tag_11_dep = TAG11_SAVE(k);
  494. }
  495. task->handles[0] = diag_block;
  496. task->handles[1] = STARPU_PLU(get_block_handle)(i, k);
  497. STARPU_ASSERT(task->handles[0] != STARPU_POISON_PTR);
  498. STARPU_ASSERT(task->handles[1] != STARPU_POISON_PTR);
  499. struct callback_arg *arg = malloc(sizeof(struct callback_arg));
  500. arg->i = i;
  501. arg->k = k;
  502. task->callback_func = callback_task_21_real;
  503. task->callback_arg = arg;
  504. if (!no_prio && (i == k+1)) {
  505. task->priority = STARPU_MAX_PRIO;
  506. }
  507. /* enforce dependencies ... */
  508. if (k > 0) {
  509. starpu_tag_declare_deps(TAG21(k, i), 2, tag_11_dep, TAG22(k-1, i, k));
  510. }
  511. else {
  512. starpu_tag_declare_deps(TAG21(k, i), 1, tag_11_dep);
  513. }
  514. int ret = starpu_task_submit(task);
  515. STARPU_CHECK_RETURN_VALUE(ret, "starpu_task_submit");
  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_t 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_t 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->handles[0] = block21;
  593. task->handles[0] = block12;
  594. //task->handles[1] = block12;
  595. task->handles[1] = block21;
  596. /* produced by TAG22(k-1, i, j) */
  597. task->handles[2] = STARPU_PLU(get_block_handle)(i, j);
  598. STARPU_ASSERT(task->handles[0] != STARPU_POISON_PTR);
  599. STARPU_ASSERT(task->handles[1] != STARPU_POISON_PTR);
  600. STARPU_ASSERT(task->handles[2] != STARPU_POISON_PTR);
  601. if (!no_prio && (i == k + 1) && (j == k +1) ) {
  602. task->priority = STARPU_MAX_PRIO;
  603. }
  604. /* enforce dependencies ... */
  605. if (k > 0) {
  606. starpu_tag_declare_deps(TAG22(k, i, j), 3, TAG22(k-1, i, j), tag_12_dep, tag_21_dep);
  607. }
  608. else {
  609. starpu_tag_declare_deps(TAG22(k, i, j), 2, tag_12_dep, tag_21_dep);
  610. }
  611. int ret = starpu_task_submit(task);
  612. STARPU_CHECK_RETURN_VALUE(ret, "starpu_task_submit");
  613. }
  614. static void create_task_22(unsigned k, unsigned i, unsigned j)
  615. {
  616. if (get_block_rank(i, j) == rank)
  617. {
  618. // fprintf(stderr, "CREATE real task 22(k = %d, i = %d, j = %d) on node %d\n", k, i, j, rank);
  619. create_task_22_real(k, i, j);
  620. }
  621. // else {
  622. // fprintf(stderr, "Node %d needs not 22(k=%d, i=%d, j = %d)\n", rank, k,i,j);
  623. // }
  624. }
  625. static void wait_tag_and_fetch_handle(starpu_tag_t tag, starpu_data_handle_t handle)
  626. {
  627. STARPU_ASSERT(handle != STARPU_POISON_PTR);
  628. starpu_tag_wait(tag);
  629. // fprintf(stderr, "Rank %d : tag %lx is done\n", rank, tag);
  630. starpu_data_acquire(handle, STARPU_R);
  631. // starpu_data_unregister(handle);
  632. }
  633. static void wait_termination(void)
  634. {
  635. unsigned k, i, j;
  636. for (k = 0; k < nblocks; k++)
  637. {
  638. /* Wait task 11k if needed */
  639. if (get_block_rank(k, k) == rank)
  640. {
  641. starpu_data_handle_t diag_block = STARPU_PLU(get_block_handle)(k, k);
  642. wait_tag_and_fetch_handle(TAG11_SAVE(k), diag_block);
  643. }
  644. for (i = k + 1; i < nblocks; i++)
  645. {
  646. /* Wait task 21ki if needed */
  647. if (get_block_rank(i, k) == rank)
  648. {
  649. starpu_data_handle_t block21 = STARPU_PLU(get_block_handle)(i, k);
  650. //starpu_data_handle_t block21 = STARPU_PLU(get_block_handle)(k, i);
  651. //fprintf(stderr, "BLOCK21 i %d k %d -> handle %p\n", i, k, block21);
  652. wait_tag_and_fetch_handle(TAG21_SAVE(k, i), block21);
  653. }
  654. }
  655. for (j = k + 1; j < nblocks; j++)
  656. {
  657. /* Wait task 12kj if needed */
  658. if (get_block_rank(k, j) == rank)
  659. {
  660. //starpu_data_handle_t block12 = STARPU_PLU(get_block_handle)(j, k);
  661. starpu_data_handle_t block12 = STARPU_PLU(get_block_handle)(k, j);
  662. //fprintf(stderr, "BLOCK12 j %d k %d -> handle %p\n", j, k, block12);
  663. wait_tag_and_fetch_handle(TAG12_SAVE(k, j), block12);
  664. }
  665. }
  666. }
  667. }
  668. /*
  669. * code to bootstrap the factorization
  670. */
  671. double STARPU_PLU(plu_main)(unsigned _nblocks, int _rank, int _world_size)
  672. {
  673. struct timeval start;
  674. struct timeval end;
  675. nblocks = _nblocks;
  676. rank = _rank;
  677. world_size = _world_size;
  678. /* create all the DAG nodes */
  679. unsigned i,j,k;
  680. for (k = 0; k < nblocks; k++)
  681. {
  682. create_task_11(k);
  683. for (i = k+1; i<nblocks; i++)
  684. {
  685. create_task_12(k, i);
  686. create_task_21(k, i);
  687. }
  688. for (i = k+1; i<nblocks; i++)
  689. {
  690. for (j = k+1; j<nblocks; j++)
  691. {
  692. create_task_22(k, i, j);
  693. }
  694. }
  695. }
  696. int barrier_ret = starpu_mpi_barrier(MPI_COMM_WORLD);
  697. STARPU_ASSERT(barrier_ret == MPI_SUCCESS);
  698. /* schedule the codelet */
  699. gettimeofday(&start, NULL);
  700. starpu_tag_notify_from_apps(STARPU_TAG_INIT);
  701. wait_termination();
  702. gettimeofday(&end, NULL);
  703. double timing = (double)((end.tv_sec - start.tv_sec)*1000000 + (end.tv_usec - start.tv_usec));
  704. // fprintf(stderr, "RANK %d -> took %f ms\n", rank, timing/1000);
  705. return timing;
  706. }