pxlu.c 21 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412413414415416417418419420421422423424425426427428429430431432433434435436437438439440441442443444445446447448449450451452453454455456457458459460461462463464465466467468469470471472473474475476477478479480481482483484485486487488489490491492493494495496497498499500501502503504505506507508509510511512513514515516517518519520521522523524525526527528529530531532533534535536537538539540541542543544545546547548549550551552553554555556557558559560561562563564565566567568569570571572573574575576577578579580581582583584585586587588589590591592593594595596597598599600601602603604605606607608609610611612613614615616617618619620621622623624625626627628629630631632633634635636637638639640641642643644645646647648649650651652653654655656657658659660661662663664665666667668669670671672673674675676677678679680681682683684685686687688689690691692693694695696697698699700701702703704705706707708709710711712713714715716717718719720721722723724725726727728729730731732733734735736737738739740741742743744745746747748749750751752753754755756757758759760761762763764765766767768769770771772773774775776777778779780781782783784785786787788789790791792793794795796797798799800801802803804805806807808809810811812813814815816817818819820821822823824825826827828829830831832833834835836837838839840841842843844845846847848849850851852853854855856857858859860861862863864865866867868869870871872873874875876877
  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. #include <sys/time.h>
  19. #define MPI_TAG11(k) ((1U << 16) | (k))
  20. #define MPI_TAG12(k, j) ((2U << 16) | (k)<<8 | (j))
  21. #define MPI_TAG21(k, i) ((3U << 16) | (i)<<8 | (k))
  22. // 11 21
  23. // 12 22
  24. #define TAG11(k) ((starpu_tag_t)( (1ULL<<50) | (unsigned long long)(k)))
  25. #define TAG12(k,j) ((starpu_tag_t)(((2ULL<<50) | (((unsigned long long)(k))<<32) \
  26. | (unsigned long long)(j))))
  27. #define TAG21(k,i) ((starpu_tag_t)(((3ULL<<50) | (((unsigned long long)(k))<<32) \
  28. | (unsigned long long)(i))))
  29. #define TAG22(k,i,j) ((starpu_tag_t)(((4ULL<<50) | ((unsigned long long)(k)<<32) \
  30. | ((unsigned long long)(i)<<16) \
  31. | (unsigned long long)(j))))
  32. #define TAG11_SAVE(k) ((starpu_tag_t)( (5ULL<<50) | (unsigned long long)(k)))
  33. #define TAG12_SAVE(k,j) ((starpu_tag_t)(((6ULL<<50) | (((unsigned long long)(k))<<32) \
  34. | (unsigned long long)(j))))
  35. #define TAG21_SAVE(k,i) ((starpu_tag_t)(((7ULL<<50) | (((unsigned long long)(k))<<32) \
  36. | (unsigned long long)(i))))
  37. #define TAG11_SAVE_PARTIAL(k) ((starpu_tag_t)( (8ULL<<50) | (unsigned long long)(k)))
  38. #define TAG12_SAVE_PARTIAL(k,j) ((starpu_tag_t)(((9ULL<<50) | (((unsigned long long)(k))<<32) \
  39. | (unsigned long long)(j))))
  40. #define TAG21_SAVE_PARTIAL(k,i) ((starpu_tag_t)(((10ULL<<50) | (((unsigned long long)(k))<<32) \
  41. | (unsigned long long)(i))))
  42. #define STARPU_TAG_INIT ((starpu_tag_t)(11ULL<<50))
  43. //#define VERBOSE_INIT 1
  44. //#define DEBUG 1
  45. static unsigned no_prio = 0;
  46. static unsigned nblocks = 0;
  47. static int rank = -1;
  48. static int world_size = -1;
  49. struct callback_arg {
  50. unsigned i, j, k;
  51. };
  52. /*
  53. * Various
  54. */
  55. static struct debug_info *create_debug_info(unsigned i, unsigned j, unsigned k)
  56. {
  57. struct debug_info *info = malloc(sizeof(struct debug_info));
  58. info->i = i;
  59. info->j = j;
  60. info->k = k;
  61. return info;
  62. }
  63. static struct starpu_task *create_task(starpu_tag_t id)
  64. {
  65. struct starpu_task *task = starpu_task_create();
  66. task->cl_arg = NULL;
  67. task->use_tag = 1;
  68. task->tag_id = id;
  69. return task;
  70. }
  71. /* Send handle to every node appearing in the mask, and unlock tag once the
  72. * transfers are done. */
  73. static void send_data_to_mask(starpu_data_handle handle, int *rank_mask, int mpi_tag, starpu_tag_t tag)
  74. {
  75. unsigned cnt = 0;
  76. STARPU_ASSERT(handle != STARPU_POISON_PTR);
  77. int rank_array[world_size];
  78. int comm_array[world_size];
  79. int mpi_tag_array[world_size];
  80. starpu_data_handle handle_array[world_size];
  81. unsigned r;
  82. for (r = 0; r < world_size; r++)
  83. {
  84. if (rank_mask[r]) {
  85. rank_array[cnt] = r;
  86. comm_array[cnt] = MPI_COMM_WORLD;
  87. mpi_tag_array[cnt] = mpi_tag;
  88. handle_array[cnt] = handle;
  89. cnt++;
  90. }
  91. }
  92. if (cnt == 0)
  93. {
  94. /* In case there is no message to send, we release the tag at
  95. * once */
  96. starpu_tag_notify_from_apps(tag);
  97. }
  98. else {
  99. starpu_mpi_isend_array_detached_unlock_tag(cnt, handle_array,
  100. rank_array, mpi_tag_array, comm_array, tag);
  101. }
  102. }
  103. /* Initiate a receive request once all dependencies are fulfilled and unlock
  104. * tag 'unlocked_tag' once it's done. */
  105. struct recv_when_done_callback_arg {
  106. int source;
  107. int mpi_tag;
  108. starpu_data_handle handle;
  109. starpu_tag_t unlocked_tag;
  110. };
  111. static void callback_receive_when_done(void *_arg)
  112. {
  113. struct recv_when_done_callback_arg *arg = _arg;
  114. starpu_mpi_irecv_detached_unlock_tag(arg->handle, arg->source,
  115. arg->mpi_tag, MPI_COMM_WORLD, arg->unlocked_tag);
  116. free(arg);
  117. }
  118. static void receive_when_deps_are_done(unsigned ndeps, starpu_tag_t *deps_tags,
  119. int source, int mpi_tag,
  120. starpu_data_handle handle,
  121. starpu_tag_t partial_tag,
  122. starpu_tag_t unlocked_tag)
  123. {
  124. STARPU_ASSERT(handle != STARPU_POISON_PTR);
  125. struct recv_when_done_callback_arg *arg =
  126. malloc(sizeof(struct recv_when_done_callback_arg));
  127. arg->source = source;
  128. arg->mpi_tag = mpi_tag;
  129. arg->handle = handle;
  130. arg->unlocked_tag = unlocked_tag;
  131. if (ndeps == 0)
  132. {
  133. callback_receive_when_done(arg);
  134. return;
  135. }
  136. starpu_create_sync_task(partial_tag, ndeps, deps_tags,
  137. callback_receive_when_done, arg);
  138. }
  139. /*
  140. * Task 11 (diagonal factorization)
  141. */
  142. static void create_task_11_recv(unsigned k)
  143. {
  144. unsigned i, j;
  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. if (k > 0)
  154. for (i = (k-1)+1; i < nblocks; i++)
  155. {
  156. if (rank == get_block_rank(i, k-1))
  157. tag_array[ndeps++] = TAG21(k-1, i);
  158. }
  159. if (k > 0)
  160. for (j = (k-1)+1; j < nblocks; j++)
  161. {
  162. if (rank == get_block_rank(k-1, j))
  163. tag_array[ndeps++] = TAG12(k-1, j);
  164. }
  165. #endif
  166. int source = get_block_rank(k, k);
  167. #ifdef SINGLE_TMP11
  168. starpu_data_handle block_handle = STARPU_PLU(get_tmp_11_block_handle)();
  169. #else
  170. starpu_data_handle block_handle = STARPU_PLU(get_tmp_11_block_handle)(k);
  171. #endif
  172. int mpi_tag = MPI_TAG11(k);
  173. starpu_tag_t partial_tag = TAG11_SAVE_PARTIAL(k);
  174. starpu_tag_t unlocked_tag = TAG11_SAVE(k);
  175. // fprintf(stderr, "NODE %d - 11 (%d) - recv when done ndeps %d - tag array %lx\n", rank, k, ndeps, tag_array[0]);
  176. receive_when_deps_are_done(ndeps, tag_array, source, mpi_tag, block_handle, partial_tag, unlocked_tag);
  177. }
  178. static void find_nodes_using_11(unsigned k, int *rank_mask)
  179. {
  180. memset(rank_mask, 0, world_size*sizeof(int));
  181. /* Block 11_k is used to compute 12_kj + 12ki with i,j > k */
  182. unsigned i;
  183. for (i = k+1; i < nblocks; i++)
  184. {
  185. int r = get_block_rank(i, k);
  186. rank_mask[r] = 1;
  187. }
  188. unsigned j;
  189. for (j = k+1; j < nblocks; j++)
  190. {
  191. int r = get_block_rank(k, j);
  192. rank_mask[r] = 1;
  193. }
  194. }
  195. static void callback_task_11_real(void *_arg)
  196. {
  197. struct callback_arg *arg = _arg;
  198. unsigned k = arg->k;
  199. /* Find all the nodes potentially requiring this block */
  200. int rank_mask[world_size];
  201. find_nodes_using_11(k, rank_mask);
  202. rank_mask[rank] = 0;
  203. /* Send the block to those nodes */
  204. starpu_data_handle block_handle = STARPU_PLU(get_block_handle)(k, k);
  205. starpu_tag_t tag = TAG11_SAVE(k);
  206. int mpi_tag = MPI_TAG11(k);
  207. send_data_to_mask(block_handle, rank_mask, mpi_tag, tag);
  208. free(arg);
  209. }
  210. static void create_task_11_real(unsigned k)
  211. {
  212. struct starpu_task *task = create_task(TAG11(k));
  213. task->cl = &STARPU_PLU(cl11);
  214. task->cl_arg = create_debug_info(k, k, k);
  215. /* which sub-data is manipulated ? */
  216. task->buffers[0].handle = STARPU_PLU(get_block_handle)(k, k);
  217. task->buffers[0].mode = STARPU_RW;
  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. starpu_task_submit(task);
  233. }
  234. static void create_task_11(unsigned k)
  235. {
  236. if (get_block_rank(k, k) == rank)
  237. {
  238. #ifdef VERBOSE_INIT
  239. fprintf(stderr, "CREATE real task 11(%d) (TAG11_SAVE(%d) = %lx) on node %d\n", k, k, TAG11_SAVE(k), rank);
  240. #endif
  241. create_task_11_real(k);
  242. }
  243. else {
  244. /* We don't handle the task, but perhaps we have to generate MPI transfers. */
  245. int rank_mask[world_size];
  246. find_nodes_using_11(k, rank_mask);
  247. if (rank_mask[rank])
  248. {
  249. #ifdef VERBOSE_INIT
  250. fprintf(stderr, "create RECV task 11(%d) on node %d\n", k, rank);
  251. #endif
  252. create_task_11_recv(k);
  253. }
  254. else {
  255. #ifdef VERBOSE_INIT
  256. fprintf(stderr, "Node %d needs not 11(%d)\n", rank, k);
  257. #endif
  258. }
  259. }
  260. }
  261. /*
  262. * Task 12 (Update lower left (TRSM))
  263. */
  264. static void create_task_12_recv(unsigned k, unsigned j)
  265. {
  266. unsigned i;
  267. /* The current node is not computing that task, so we receive the block
  268. * with MPI */
  269. /* We don't issue a MPI receive request until everyone using the
  270. * temporary buffer is done : 12_(k-1)j can be used by 22_(k-1)ij with
  271. * i >= k */
  272. unsigned ndeps = 0;
  273. starpu_tag_t tag_array[nblocks];
  274. #ifdef SINGLE_TMP1221
  275. if (k > 0)
  276. for (i = (k-1)+1; i < nblocks; i++)
  277. #else
  278. if (k > 1)
  279. for (i = (k-2)+1; i < nblocks; i++)
  280. #endif
  281. {
  282. if (rank == get_block_rank(i, j))
  283. #ifdef SINGLE_TMP1221
  284. tag_array[ndeps++] = TAG22(k-1, i, j);
  285. #else
  286. tag_array[ndeps++] = TAG22(k-2, i, j);
  287. #endif
  288. }
  289. int source = get_block_rank(k, j);
  290. #ifdef SINGLE_TMP1221
  291. starpu_data_handle block_handle = STARPU_PLU(get_tmp_12_block_handle)(j);
  292. #else
  293. starpu_data_handle block_handle = STARPU_PLU(get_tmp_12_block_handle)(j,k);
  294. #endif
  295. int mpi_tag = MPI_TAG12(k, j);
  296. starpu_tag_t partial_tag = TAG12_SAVE_PARTIAL(k, j);
  297. starpu_tag_t unlocked_tag = TAG12_SAVE(k, j);
  298. receive_when_deps_are_done(ndeps, tag_array, source, mpi_tag, block_handle, partial_tag, unlocked_tag);
  299. }
  300. static void find_nodes_using_12(unsigned k, unsigned j, int *rank_mask)
  301. {
  302. memset(rank_mask, 0, world_size*sizeof(int));
  303. /* Block 12_kj is used to compute 22_kij with i > k */
  304. unsigned i;
  305. for (i = k+1; i < nblocks; i++)
  306. {
  307. int r = get_block_rank(i, j);
  308. rank_mask[r] = 1;
  309. }
  310. }
  311. static void callback_task_12_real(void *_arg)
  312. {
  313. struct callback_arg *arg = _arg;
  314. unsigned k = arg->k;
  315. unsigned j = arg->j;
  316. /* Find all the nodes potentially requiring this block */
  317. int rank_mask[world_size];
  318. find_nodes_using_12(k, j, rank_mask);
  319. rank_mask[rank] = 0;
  320. /* Send the block to those nodes */
  321. starpu_data_handle block_handle = STARPU_PLU(get_block_handle)(k, j);
  322. starpu_tag_t tag = TAG12_SAVE(k, j);
  323. int mpi_tag = MPI_TAG12(k, j);
  324. send_data_to_mask(block_handle, rank_mask, mpi_tag, tag);
  325. free(arg);
  326. }
  327. static void create_task_12_real(unsigned k, unsigned j)
  328. {
  329. struct starpu_task *task = create_task(TAG12(k, j));
  330. #warning temporary fix :/
  331. // task->cl = &STARPU_PLU(cl12);
  332. task->cl = &STARPU_PLU(cl21);
  333. task->cl_arg = create_debug_info(j, j, k);
  334. unsigned diag_block_is_local = (get_block_rank(k, k) == rank);
  335. starpu_tag_t tag_11_dep;
  336. /* which sub-data is manipulated ? */
  337. starpu_data_handle diag_block;
  338. if (diag_block_is_local)
  339. {
  340. diag_block = STARPU_PLU(get_block_handle)(k, k);
  341. tag_11_dep = TAG11(k);
  342. }
  343. else
  344. {
  345. #ifdef SINGLE_TMP11
  346. diag_block = STARPU_PLU(get_tmp_11_block_handle)();
  347. #else
  348. diag_block = STARPU_PLU(get_tmp_11_block_handle)(k);
  349. #endif
  350. tag_11_dep = TAG11_SAVE(k);
  351. }
  352. task->buffers[0].handle = diag_block;
  353. task->buffers[0].mode = STARPU_R;
  354. task->buffers[1].handle = STARPU_PLU(get_block_handle)(k, j);
  355. task->buffers[1].mode = STARPU_RW;
  356. STARPU_ASSERT(get_block_rank(k, j) == rank);
  357. STARPU_ASSERT(task->buffers[0].handle != STARPU_POISON_PTR);
  358. STARPU_ASSERT(task->buffers[1].handle != STARPU_POISON_PTR);
  359. struct callback_arg *arg = malloc(sizeof(struct callback_arg));
  360. arg->j = j;
  361. arg->k = k;
  362. task->callback_func = callback_task_12_real;
  363. task->callback_arg = arg;
  364. if (!no_prio && (j == k+1)) {
  365. task->priority = STARPU_MAX_PRIO;
  366. }
  367. /* enforce dependencies ... */
  368. if (k > 0) {
  369. starpu_tag_declare_deps(TAG12(k, j), 2, tag_11_dep, TAG22(k-1, k, j));
  370. }
  371. else {
  372. starpu_tag_declare_deps(TAG12(k, j), 1, tag_11_dep);
  373. }
  374. starpu_task_submit(task);
  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 block_handle = STARPU_PLU(get_tmp_21_block_handle)(i);
  434. #else
  435. starpu_data_handle 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 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 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->buffers[0].handle = diag_block;
  496. task->buffers[0].mode = STARPU_R;
  497. task->buffers[1].handle = STARPU_PLU(get_block_handle)(i, k);
  498. task->buffers[1].mode = STARPU_RW;
  499. STARPU_ASSERT(task->buffers[0].handle != STARPU_POISON_PTR);
  500. STARPU_ASSERT(task->buffers[1].handle != STARPU_POISON_PTR);
  501. struct callback_arg *arg = malloc(sizeof(struct callback_arg));
  502. arg->i = i;
  503. arg->k = k;
  504. task->callback_func = callback_task_21_real;
  505. task->callback_arg = arg;
  506. if (!no_prio && (i == k+1)) {
  507. task->priority = STARPU_MAX_PRIO;
  508. }
  509. /* enforce dependencies ... */
  510. if (k > 0) {
  511. starpu_tag_declare_deps(TAG21(k, i), 2, tag_11_dep, TAG22(k-1, i, k));
  512. }
  513. else {
  514. starpu_tag_declare_deps(TAG21(k, i), 1, tag_11_dep);
  515. }
  516. starpu_task_submit(task);
  517. }
  518. static void create_task_21(unsigned k, unsigned i)
  519. {
  520. if (get_block_rank(i, k) == rank)
  521. {
  522. #ifdef VERBOSE_INIT
  523. fprintf(stderr, "CREATE real task 21(k = %d, i = %d) on node %d\n", k, i, rank);
  524. #endif
  525. create_task_21_real(k, i);
  526. }
  527. else {
  528. /* We don't handle the task, but perhaps we have to generate MPI transfers. */
  529. int rank_mask[world_size];
  530. find_nodes_using_21(k, i, rank_mask);
  531. if (rank_mask[rank])
  532. {
  533. #ifdef VERBOSE_INIT
  534. fprintf(stderr, "create RECV task 21(k = %d, i = %d) on node %d\n", k, i, rank);
  535. #endif
  536. create_task_21_recv(k, i);
  537. }
  538. else {
  539. #ifdef VERBOSE_INIT
  540. fprintf(stderr, "Node %d needs not 21(k=%d, i=%d)\n", rank, k,i);
  541. #endif
  542. }
  543. }
  544. }
  545. /*
  546. * Task 22 (GEMM)
  547. */
  548. static void create_task_22_real(unsigned k, unsigned i, unsigned j)
  549. {
  550. // printf("task 22 k,i,j = %d,%d,%d TAG = %llx\n", k,i,j, TAG22(k,i,j));
  551. struct starpu_task *task = create_task(TAG22(k, i, j));
  552. task->cl = &STARPU_PLU(cl22);
  553. task->cl_arg = create_debug_info(i, j, k);
  554. /* which sub-data is manipulated ? */
  555. /* produced by TAG21_SAVE(k, i) */
  556. unsigned block21_is_local = (get_block_rank(i, k) == rank);
  557. starpu_tag_t tag_21_dep;
  558. starpu_data_handle block21;
  559. if (block21_is_local)
  560. {
  561. block21 = STARPU_PLU(get_block_handle)(i, k);
  562. tag_21_dep = TAG21(k, i);
  563. }
  564. else
  565. {
  566. #ifdef SINGLE_TMP1221
  567. block21 = STARPU_PLU(get_tmp_21_block_handle)(i);
  568. #else
  569. block21 = STARPU_PLU(get_tmp_21_block_handle)(i, k);
  570. #endif
  571. tag_21_dep = TAG21_SAVE(k, i);
  572. }
  573. /* produced by TAG12_SAVE(k, j) */
  574. unsigned block12_is_local = (get_block_rank(k, j) == rank);
  575. starpu_tag_t tag_12_dep;
  576. starpu_data_handle block12;
  577. if (block12_is_local)
  578. {
  579. // block12 = STARPU_PLU(get_block_handle)(j, k);
  580. block12 = STARPU_PLU(get_block_handle)(k, j);
  581. tag_12_dep = TAG12(k, j);
  582. }
  583. else
  584. {
  585. #ifdef SINGLE_TMP1221
  586. block12 = STARPU_PLU(get_tmp_12_block_handle)(j);
  587. #else
  588. block12 = STARPU_PLU(get_tmp_12_block_handle)(j, k);
  589. #endif
  590. tag_12_dep = TAG12_SAVE(k, j);
  591. }
  592. #warning temporary fix :/
  593. //task->buffers[0].handle = block21;
  594. task->buffers[0].handle = block12;
  595. task->buffers[0].mode = STARPU_R;
  596. //task->buffers[1].handle = block12;
  597. task->buffers[1].handle = block21;
  598. task->buffers[1].mode = STARPU_R;
  599. /* produced by TAG22(k-1, i, j) */
  600. task->buffers[2].handle = STARPU_PLU(get_block_handle)(i, j);
  601. task->buffers[2].mode = STARPU_RW;
  602. STARPU_ASSERT(task->buffers[0].handle != STARPU_POISON_PTR);
  603. STARPU_ASSERT(task->buffers[1].handle != STARPU_POISON_PTR);
  604. STARPU_ASSERT(task->buffers[2].handle != STARPU_POISON_PTR);
  605. if (!no_prio && (i == k + 1) && (j == k +1) ) {
  606. task->priority = STARPU_MAX_PRIO;
  607. }
  608. /* enforce dependencies ... */
  609. if (k > 0) {
  610. starpu_tag_declare_deps(TAG22(k, i, j), 3, TAG22(k-1, i, j), tag_12_dep, tag_21_dep);
  611. }
  612. else {
  613. starpu_tag_declare_deps(TAG22(k, i, j), 2, tag_12_dep, tag_21_dep);
  614. }
  615. starpu_task_submit(task);
  616. }
  617. static void create_task_22(unsigned k, unsigned i, unsigned j)
  618. {
  619. if (get_block_rank(i, j) == rank)
  620. {
  621. // fprintf(stderr, "CREATE real task 22(k = %d, i = %d, j = %d) on node %d\n", k, i, j, rank);
  622. create_task_22_real(k, i, j);
  623. }
  624. // else {
  625. // fprintf(stderr, "Node %d needs not 22(k=%d, i=%d, j = %d)\n", rank, k,i,j);
  626. // }
  627. }
  628. static void wait_tag_and_fetch_handle(starpu_tag_t tag, starpu_data_handle handle)
  629. {
  630. STARPU_ASSERT(handle != STARPU_POISON_PTR);
  631. starpu_tag_wait(tag);
  632. // fprintf(stderr, "Rank %d : tag %lx is done\n", rank, tag);
  633. starpu_data_acquire(handle, STARPU_R);
  634. // starpu_data_unregister(handle);
  635. }
  636. static void wait_termination(void)
  637. {
  638. unsigned k, i, j;
  639. for (k = 0; k < nblocks; k++)
  640. {
  641. /* Wait task 11k if needed */
  642. if (get_block_rank(k, k) == rank)
  643. {
  644. starpu_data_handle diag_block = STARPU_PLU(get_block_handle)(k, k);
  645. wait_tag_and_fetch_handle(TAG11_SAVE(k), diag_block);
  646. }
  647. for (i = k + 1; i < nblocks; i++)
  648. {
  649. /* Wait task 21ki if needed */
  650. if (get_block_rank(i, k) == rank)
  651. {
  652. starpu_data_handle block21 = STARPU_PLU(get_block_handle)(i, k);
  653. //starpu_data_handle block21 = STARPU_PLU(get_block_handle)(k, i);
  654. //fprintf(stderr, "BLOCK21 i %d k %d -> handle %p\n", i, k, block21);
  655. wait_tag_and_fetch_handle(TAG21_SAVE(k, i), block21);
  656. }
  657. }
  658. for (j = k + 1; j < nblocks; j++)
  659. {
  660. /* Wait task 12kj if needed */
  661. if (get_block_rank(k, j) == rank)
  662. {
  663. //starpu_data_handle block12 = STARPU_PLU(get_block_handle)(j, k);
  664. starpu_data_handle block12 = STARPU_PLU(get_block_handle)(k, j);
  665. //fprintf(stderr, "BLOCK12 j %d k %d -> handle %p\n", j, k, block12);
  666. wait_tag_and_fetch_handle(TAG12_SAVE(k, j), block12);
  667. }
  668. }
  669. }
  670. }
  671. /*
  672. * code to bootstrap the factorization
  673. */
  674. double STARPU_PLU(plu_main)(unsigned _nblocks, int _rank, int _world_size)
  675. {
  676. struct timeval start;
  677. struct timeval end;
  678. nblocks = _nblocks;
  679. rank = _rank;
  680. world_size = _world_size;
  681. struct starpu_task *entry_task = NULL;
  682. /* create all the DAG nodes */
  683. unsigned i,j,k;
  684. for (k = 0; k < nblocks; k++)
  685. {
  686. create_task_11(k);
  687. for (i = k+1; i<nblocks; i++)
  688. {
  689. create_task_12(k, i);
  690. create_task_21(k, i);
  691. }
  692. for (i = k+1; i<nblocks; i++)
  693. {
  694. for (j = k+1; j<nblocks; j++)
  695. {
  696. create_task_22(k, i, j);
  697. }
  698. }
  699. }
  700. int barrier_ret = starpu_mpi_barrier(MPI_COMM_WORLD);
  701. STARPU_ASSERT(barrier_ret == MPI_SUCCESS);
  702. /* schedule the codelet */
  703. gettimeofday(&start, NULL);
  704. starpu_tag_notify_from_apps(STARPU_TAG_INIT);
  705. wait_termination();
  706. gettimeofday(&end, NULL);
  707. double timing = (double)((end.tv_sec - start.tv_sec)*1000000 + (end.tv_usec - start.tv_usec));
  708. // fprintf(stderr, "RANK %d -> took %lf ms\n", rank, timing/1000);
  709. return timing;
  710. }