starpu_mpi_task_insert.c 27 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412413414415416417418419420421422423424425426427428429430431432433434435436437438439440441442443444445446447448449450451452453454455456457458459460461462463464465466467468469470471472473474475476477478479480481482483484485486487488489490491492493494495496497498499500501502503504505506507508509510511512513514515516517518519520521522523524525526527528529530531532533534535536537538539540541542543544545546547548549550551552553554555556557558559560561562563564565566567568569570571572573574575576577578579580581582583584585586587588589590591592593594595596597598599600601602603604605606607608609610611612613614615616617618619620621622623624625626627628629630631632633634635636637638639640641642643644645646647648649650651652653654655656657658659660661662663664665666667668669670671672673674675676677678679680681682683684685686687688689690691692693694695696697698699700701702703704705706707708709710711712713714715716717718719720721722723724725726727728729730731732733734735736737738739740741742743744745746747748749750751752753754755756757758759760761762763764765766767768769770771772773774775776777778779780781782783784785786787788789790791792793794795796797798799800801802803804805806807808809810811812813814815816817818819820821822823824825826827828829830831832833834835836837838839840841842843844845846847848849850851852853854855856857858859860861862863864865866867868869870871872873874875876877878879880881882883884885886887888889890891892893894895896
  1. /* StarPU --- Runtime system for heterogeneous multicore architectures.
  2. *
  3. * Copyright (C) 2011-2020 Université de Bordeaux, CNRS (LaBRI UMR 5800), Inria
  4. *
  5. * StarPU 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. * StarPU 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 <stdarg.h>
  17. #include <mpi.h>
  18. #include <starpu.h>
  19. #include <starpu_data.h>
  20. #include <common/utils.h>
  21. #include <util/starpu_task_insert_utils.h>
  22. #include <datawizard/coherency.h>
  23. #include <core/task.h>
  24. #include <starpu_mpi_private.h>
  25. #include <starpu_mpi_cache.h>
  26. #include <starpu_mpi_select_node.h>
  27. #include "starpu_mpi_task_insert.h"
  28. #define _SEND_DATA(data, mode, dest, data_tag, prio, comm, callback, arg) \
  29. do { \
  30. if (mode & STARPU_SSEND) \
  31. starpu_mpi_issend_detached_prio(data, dest, data_tag, prio, comm, callback, arg); \
  32. else \
  33. starpu_mpi_isend_detached_prio(data, dest, data_tag, prio, comm, callback, arg); \
  34. } while (0)
  35. static void (*pre_submit_hook)(struct starpu_task *task) = NULL;
  36. int starpu_mpi_pre_submit_hook_register(void (*f)(struct starpu_task *))
  37. {
  38. if (pre_submit_hook)
  39. _STARPU_MSG("Warning: a pre_submit_hook has already been registered. Please check if you really want to erase the previously registered hook.\n");
  40. pre_submit_hook = f;
  41. return 0;
  42. }
  43. int starpu_mpi_pre_submit_hook_unregister()
  44. {
  45. pre_submit_hook = NULL;
  46. return 0;
  47. }
  48. int _starpu_mpi_find_executee_node(starpu_data_handle_t data, enum starpu_data_access_mode mode, int me, int *do_execute, int *inconsistent_execute, int *xrank)
  49. {
  50. if (mode & STARPU_W || mode & STARPU_REDUX)
  51. {
  52. if (!data)
  53. {
  54. /* We don't have anything allocated for this.
  55. * The application knows we won't do anything
  56. * about this task */
  57. /* Yes, the app could actually not call
  58. * task_insert at all itself, this is just a
  59. * safeguard. */
  60. _STARPU_MPI_DEBUG(3, "oh oh\n");
  61. _STARPU_MPI_LOG_OUT();
  62. return -EINVAL;
  63. }
  64. int mpi_rank = starpu_mpi_data_get_rank(data);
  65. if (mpi_rank == -1)
  66. {
  67. _STARPU_ERROR("Data %p with mode STARPU_W needs to have a valid rank", data);
  68. }
  69. if (*xrank == -1)
  70. {
  71. // No node has been selected yet
  72. *xrank = mpi_rank;
  73. _STARPU_MPI_DEBUG(100, "Codelet is going to be executed by node %d\n", *xrank);
  74. *do_execute = mpi_rank == STARPU_MPI_PER_NODE || (mpi_rank == me);
  75. }
  76. else if (mpi_rank != *xrank)
  77. {
  78. _STARPU_MPI_DEBUG(100, "Another node %d had already been selected to execute the codelet, can't now set %d\n", *xrank, mpi_rank);
  79. *inconsistent_execute = 1;
  80. }
  81. }
  82. _STARPU_MPI_DEBUG(100, "Executing: inconsistent=%d, do_execute=%d, xrank=%d\n", *inconsistent_execute, *do_execute, *xrank);
  83. return 0;
  84. }
  85. void _starpu_mpi_exchange_data_before_execution(starpu_data_handle_t data, enum starpu_data_access_mode mode, int me, int xrank, int do_execute, int prio, MPI_Comm comm)
  86. {
  87. if (data && xrank == STARPU_MPI_PER_NODE)
  88. {
  89. STARPU_ASSERT_MSG(starpu_mpi_data_get_rank(data) == STARPU_MPI_PER_NODE, "If task is replicated, it has to access only per-node data");
  90. }
  91. if (data && mode & STARPU_R)
  92. {
  93. int mpi_rank = starpu_mpi_data_get_rank(data);
  94. starpu_mpi_tag_t data_tag = starpu_mpi_data_get_tag(data);
  95. if (mpi_rank == -1)
  96. {
  97. _STARPU_ERROR("StarPU needs to be told the MPI rank of this data, using starpu_mpi_data_register\n");
  98. }
  99. if (do_execute && mpi_rank != STARPU_MPI_PER_NODE && mpi_rank != me)
  100. {
  101. /* The node is going to execute the codelet, but it does not own the data, it needs to receive the data from the owner node */
  102. int already_received = starpu_mpi_cached_receive_set(data);
  103. if (already_received == 0)
  104. {
  105. if (data_tag == -1)
  106. _STARPU_ERROR("StarPU needs to be told the MPI tag of this data, using starpu_mpi_data_register\n");
  107. _STARPU_MPI_DEBUG(1, "Receiving data %p from %d\n", data, mpi_rank);
  108. starpu_mpi_irecv_detached(data, mpi_rank, data_tag, comm, NULL, NULL);
  109. }
  110. // else the node has already received the data
  111. }
  112. if (!do_execute && mpi_rank == me)
  113. {
  114. /* The node owns the data, but another node is going to execute the codelet, the node needs to send the data to the executee node. */
  115. int already_sent = starpu_mpi_cached_send_set(data, xrank);
  116. if (already_sent == 0)
  117. {
  118. if (data_tag == -1)
  119. _STARPU_ERROR("StarPU needs to be told the MPI tag of this data, using starpu_mpi_data_register\n");
  120. _STARPU_MPI_DEBUG(1, "Sending data %p to %d\n", data, xrank);
  121. _SEND_DATA(data, mode, xrank, data_tag, prio, comm, NULL, NULL);
  122. }
  123. // Else the data has already been sent
  124. }
  125. }
  126. }
  127. static
  128. void _starpu_mpi_exchange_data_after_execution(starpu_data_handle_t data, enum starpu_data_access_mode mode, int me, int xrank, int do_execute, int prio, MPI_Comm comm)
  129. {
  130. if (mode & STARPU_W)
  131. {
  132. int mpi_rank = starpu_mpi_data_get_rank(data);
  133. starpu_mpi_tag_t data_tag = starpu_mpi_data_get_tag(data);
  134. if(mpi_rank == -1)
  135. {
  136. _STARPU_ERROR("StarPU needs to be told the MPI rank of this data, using starpu_mpi_data_register\n");
  137. }
  138. if (mpi_rank == STARPU_MPI_PER_NODE)
  139. {
  140. mpi_rank = me;
  141. }
  142. if (mpi_rank == me)
  143. {
  144. if (xrank != -1 && (xrank != STARPU_MPI_PER_NODE && me != xrank))
  145. {
  146. _STARPU_MPI_DEBUG(1, "Receive data %p back from the task %d which executed the codelet ...\n", data, xrank);
  147. if(data_tag == -1)
  148. _STARPU_ERROR("StarPU needs to be told the MPI tag of this data, using starpu_mpi_data_register\n");
  149. starpu_mpi_irecv_detached(data, xrank, data_tag, comm, NULL, NULL);
  150. }
  151. }
  152. else if (do_execute)
  153. {
  154. if(data_tag == -1)
  155. _STARPU_ERROR("StarPU needs to be told the MPI tag of this data, using starpu_mpi_data_register\n");
  156. _STARPU_MPI_DEBUG(1, "Send data %p back to its owner %d...\n", data, mpi_rank);
  157. _SEND_DATA(data, mode, mpi_rank, data_tag, prio, comm, NULL, NULL);
  158. }
  159. }
  160. }
  161. static
  162. void _starpu_mpi_clear_data_after_execution(starpu_data_handle_t data, enum starpu_data_access_mode mode, int me, int do_execute)
  163. {
  164. if (_starpu_cache_enabled)
  165. {
  166. if (mode & STARPU_W || mode & STARPU_REDUX)
  167. {
  168. /* The data has been modified, it MUST be removed from the cache */
  169. starpu_mpi_cached_send_clear(data);
  170. starpu_mpi_cached_receive_clear(data);
  171. }
  172. }
  173. else
  174. {
  175. /* We allocated a temporary buffer for the received data, now drop it */
  176. if ((mode & STARPU_R) && do_execute)
  177. {
  178. int mpi_rank = starpu_mpi_data_get_rank(data);
  179. if (mpi_rank == STARPU_MPI_PER_NODE)
  180. {
  181. mpi_rank = me;
  182. }
  183. if (mpi_rank != me && mpi_rank != -1)
  184. {
  185. starpu_data_invalidate_submit(data);
  186. }
  187. }
  188. }
  189. }
  190. static
  191. int _starpu_mpi_task_decode_v(struct starpu_codelet *codelet, int me, int nb_nodes, int *xrank, int *do_execute, struct starpu_data_descr **descrs_p, int *nb_data_p, int *prio_p, va_list varg_list)
  192. {
  193. /* XXX: _fstarpu_mpi_task_decode_v needs to be updated at the same time */
  194. va_list varg_list_copy;
  195. int inconsistent_execute = 0;
  196. int arg_type;
  197. int node_selected = 0;
  198. int nb_allocated_data = 16;
  199. struct starpu_data_descr *descrs;
  200. int nb_data;
  201. int prio = 0;
  202. int select_node_policy = STARPU_MPI_NODE_SELECTION_CURRENT_POLICY;
  203. _STARPU_TRACE_TASK_MPI_DECODE_START();
  204. _STARPU_MPI_MALLOC(descrs, nb_allocated_data * sizeof(struct starpu_data_descr));
  205. nb_data = 0;
  206. *do_execute = -1;
  207. *xrank = -1;
  208. va_copy(varg_list_copy, varg_list);
  209. while ((arg_type = va_arg(varg_list_copy, int)) != 0)
  210. {
  211. int arg_type_nocommute = arg_type & ~STARPU_COMMUTE;
  212. if (arg_type==STARPU_EXECUTE_ON_NODE)
  213. {
  214. *xrank = va_arg(varg_list_copy, int);
  215. if (node_selected == 0)
  216. {
  217. _STARPU_MPI_DEBUG(100, "Executing on node %d\n", *xrank);
  218. *do_execute = 1;
  219. node_selected = 1;
  220. inconsistent_execute = 0;
  221. }
  222. }
  223. else if (arg_type==STARPU_EXECUTE_ON_DATA)
  224. {
  225. starpu_data_handle_t data = va_arg(varg_list_copy, starpu_data_handle_t);
  226. if (node_selected == 0)
  227. {
  228. *xrank = starpu_mpi_data_get_rank(data);
  229. STARPU_ASSERT_MSG(*xrank != -1, "Rank of the data must be set using starpu_mpi_data_register() or starpu_data_set_rank()");
  230. _STARPU_MPI_DEBUG(100, "Executing on data node %d\n", *xrank);
  231. STARPU_ASSERT_MSG(*xrank <= nb_nodes, "Node %d to execute codelet is not a valid node (%d)", *xrank, nb_nodes);
  232. *do_execute = 1;
  233. node_selected = 1;
  234. inconsistent_execute = 0;
  235. }
  236. }
  237. else if (arg_type_nocommute & STARPU_R || arg_type_nocommute & STARPU_W || arg_type_nocommute & STARPU_RW || arg_type & STARPU_SCRATCH || arg_type & STARPU_REDUX)
  238. {
  239. starpu_data_handle_t data = va_arg(varg_list_copy, starpu_data_handle_t);
  240. enum starpu_data_access_mode mode = (enum starpu_data_access_mode) arg_type;
  241. if (node_selected == 0)
  242. {
  243. int ret = _starpu_mpi_find_executee_node(data, mode, me, do_execute, &inconsistent_execute, xrank);
  244. if (ret == -EINVAL)
  245. {
  246. free(descrs);
  247. va_end(varg_list_copy);
  248. _STARPU_TRACE_TASK_MPI_DECODE_END();
  249. return ret;
  250. }
  251. }
  252. if (nb_data >= nb_allocated_data)
  253. {
  254. nb_allocated_data *= 2;
  255. _STARPU_MPI_REALLOC(descrs, nb_allocated_data * sizeof(struct starpu_data_descr));
  256. }
  257. descrs[nb_data].handle = data;
  258. descrs[nb_data].mode = mode;
  259. nb_data ++;
  260. }
  261. else if (arg_type == STARPU_DATA_ARRAY)
  262. {
  263. starpu_data_handle_t *datas = va_arg(varg_list_copy, starpu_data_handle_t *);
  264. int nb_handles = va_arg(varg_list_copy, int);
  265. int i;
  266. for(i=0 ; i<nb_handles ; i++)
  267. {
  268. STARPU_ASSERT_MSG(codelet->nbuffers == STARPU_VARIABLE_NBUFFERS || nb_data < codelet->nbuffers, "Too many data passed to starpu_mpi_task_insert");
  269. enum starpu_data_access_mode mode = STARPU_CODELET_GET_MODE(codelet, nb_data);
  270. if (node_selected == 0)
  271. {
  272. int ret = _starpu_mpi_find_executee_node(datas[i], mode, me, do_execute, &inconsistent_execute, xrank);
  273. if (ret == -EINVAL)
  274. {
  275. free(descrs);
  276. va_end(varg_list_copy);
  277. _STARPU_TRACE_TASK_MPI_DECODE_END();
  278. return ret;
  279. }
  280. }
  281. if (nb_data >= nb_allocated_data)
  282. {
  283. nb_allocated_data *= 2;
  284. _STARPU_MPI_REALLOC(descrs, nb_allocated_data * sizeof(struct starpu_data_descr));
  285. }
  286. descrs[nb_data].handle = datas[i];
  287. descrs[nb_data].mode = mode;
  288. nb_data ++;
  289. }
  290. }
  291. else if (arg_type == STARPU_DATA_MODE_ARRAY)
  292. {
  293. struct starpu_data_descr *_descrs = va_arg(varg_list_copy, struct starpu_data_descr*);
  294. int nb_handles = va_arg(varg_list_copy, int);
  295. int i;
  296. for(i=0 ; i<nb_handles ; i++)
  297. {
  298. enum starpu_data_access_mode mode = _descrs[i].mode;
  299. if (node_selected == 0)
  300. {
  301. int ret = _starpu_mpi_find_executee_node(_descrs[i].handle, mode, me, do_execute, &inconsistent_execute, xrank);
  302. if (ret == -EINVAL)
  303. {
  304. free(descrs);
  305. va_end(varg_list_copy);
  306. _STARPU_TRACE_TASK_MPI_DECODE_END();
  307. return ret;
  308. }
  309. }
  310. if (nb_data >= nb_allocated_data)
  311. {
  312. nb_allocated_data *= 2;
  313. _STARPU_MPI_REALLOC(descrs, nb_allocated_data * sizeof(struct starpu_data_descr));
  314. }
  315. descrs[nb_data].handle = _descrs[i].handle;
  316. descrs[nb_data].mode = mode;
  317. nb_data ++;
  318. }
  319. }
  320. else if (arg_type==STARPU_VALUE)
  321. {
  322. (void)va_arg(varg_list_copy, void *);
  323. (void)va_arg(varg_list_copy, size_t);
  324. }
  325. else if (arg_type==STARPU_CL_ARGS)
  326. {
  327. (void)va_arg(varg_list_copy, void *);
  328. (void)va_arg(varg_list_copy, size_t);
  329. }
  330. else if (arg_type==STARPU_CL_ARGS_NFREE)
  331. {
  332. (void)va_arg(varg_list_copy, void *);
  333. (void)va_arg(varg_list_copy, size_t);
  334. }
  335. else if (arg_type==STARPU_TASK_DEPS_ARRAY)
  336. {
  337. (void)va_arg(varg_list_copy, unsigned);
  338. (void)va_arg(varg_list_copy, struct starpu_task **);
  339. }
  340. else if (arg_type==STARPU_TASK_END_DEPS_ARRAY)
  341. {
  342. (void)va_arg(varg_list_copy, unsigned);
  343. (void)va_arg(varg_list_copy, struct starpu_task **);
  344. }
  345. else if (arg_type==STARPU_CALLBACK)
  346. {
  347. (void)va_arg(varg_list_copy, _starpu_callback_func_t);
  348. }
  349. else if (arg_type==STARPU_CALLBACK_WITH_ARG)
  350. {
  351. (void)va_arg(varg_list_copy, _starpu_callback_func_t);
  352. (void)va_arg(varg_list_copy, void *);
  353. }
  354. else if (arg_type==STARPU_CALLBACK_WITH_ARG_NFREE)
  355. {
  356. (void)va_arg(varg_list_copy, _starpu_callback_func_t);
  357. (void)va_arg(varg_list_copy, void *);
  358. }
  359. else if (arg_type==STARPU_CALLBACK_ARG)
  360. {
  361. (void)va_arg(varg_list_copy, void *);
  362. }
  363. else if (arg_type==STARPU_CALLBACK_ARG_NFREE)
  364. {
  365. (void)va_arg(varg_list_copy, void *);
  366. }
  367. else if (arg_type==STARPU_PRIORITY)
  368. {
  369. prio = va_arg(varg_list_copy, int);
  370. }
  371. /* STARPU_EXECUTE_ON_NODE handled above */
  372. /* STARPU_EXECUTE_ON_DATA handled above */
  373. /* STARPU_DATA_ARRAY handled above */
  374. /* STARPU_DATA_MODE_ARRAY handled above */
  375. else if (arg_type==STARPU_TAG)
  376. {
  377. (void)va_arg(varg_list_copy, starpu_tag_t);
  378. }
  379. else if (arg_type==STARPU_HYPERVISOR_TAG)
  380. {
  381. (void)va_arg(varg_list_copy, int);
  382. }
  383. else if (arg_type==STARPU_FLOPS)
  384. {
  385. (void)va_arg(varg_list_copy, double);
  386. }
  387. else if (arg_type==STARPU_SCHED_CTX)
  388. {
  389. (void)va_arg(varg_list_copy, unsigned);
  390. }
  391. else if (arg_type==STARPU_PROLOGUE_CALLBACK)
  392. {
  393. (void)va_arg(varg_list_copy, _starpu_callback_func_t);
  394. }
  395. else if (arg_type==STARPU_PROLOGUE_CALLBACK_ARG)
  396. {
  397. (void)va_arg(varg_list_copy, void *);
  398. }
  399. else if (arg_type==STARPU_PROLOGUE_CALLBACK_ARG_NFREE)
  400. {
  401. (void)va_arg(varg_list_copy, void *);
  402. }
  403. else if (arg_type==STARPU_PROLOGUE_CALLBACK_POP)
  404. {
  405. (void)va_arg(varg_list_copy, _starpu_callback_func_t);
  406. }
  407. else if (arg_type==STARPU_PROLOGUE_CALLBACK_POP_ARG)
  408. {
  409. (void)va_arg(varg_list_copy, void *);
  410. }
  411. else if (arg_type==STARPU_PROLOGUE_CALLBACK_POP_ARG_NFREE)
  412. {
  413. (void)va_arg(varg_list_copy, void *);
  414. }
  415. else if (arg_type==STARPU_EXECUTE_WHERE)
  416. {
  417. // the flag is decoded and set later when
  418. // calling function _starpu_task_insert_create()
  419. (void)va_arg(varg_list_copy, unsigned long long);
  420. }
  421. else if (arg_type==STARPU_EXECUTE_ON_WORKER)
  422. {
  423. // the flag is decoded and set later when
  424. // calling function _starpu_task_insert_create()
  425. (void)va_arg(varg_list_copy, int);
  426. }
  427. else if (arg_type==STARPU_TAG_ONLY)
  428. {
  429. (void)va_arg(varg_list_copy, starpu_tag_t);
  430. }
  431. else if (arg_type==STARPU_NAME)
  432. {
  433. (void)va_arg(varg_list_copy, const char *);
  434. }
  435. else if (arg_type==STARPU_POSSIBLY_PARALLEL)
  436. {
  437. (void)va_arg(varg_list_copy, unsigned);
  438. }
  439. else if (arg_type==STARPU_WORKER_ORDER)
  440. {
  441. // the flag is decoded and set later when
  442. // calling function _starpu_task_insert_create()
  443. (void)va_arg(varg_list_copy, unsigned);
  444. }
  445. else if (arg_type==STARPU_NODE_SELECTION_POLICY)
  446. {
  447. select_node_policy = va_arg(varg_list_copy, int);
  448. }
  449. else if (arg_type==STARPU_TASK_COLOR)
  450. {
  451. (void)va_arg(varg_list_copy, int);
  452. }
  453. else if (arg_type==STARPU_TASK_SYNCHRONOUS)
  454. {
  455. (void)va_arg(varg_list_copy, int);
  456. }
  457. else if (arg_type==STARPU_HANDLES_SEQUENTIAL_CONSISTENCY)
  458. {
  459. (void)va_arg(varg_list_copy, char *);
  460. }
  461. else if (arg_type==STARPU_TASK_END_DEP)
  462. {
  463. (void)va_arg(varg_list_copy, int);
  464. }
  465. else if (arg_type==STARPU_TASK_WORKERIDS)
  466. {
  467. (void)va_arg(varg_list_copy, unsigned);
  468. (void)va_arg(varg_list_copy, uint32_t*);
  469. }
  470. else if (arg_type==STARPU_SEQUENTIAL_CONSISTENCY)
  471. {
  472. (void)va_arg(varg_list_copy, unsigned);
  473. }
  474. else if (arg_type==STARPU_TASK_PROFILING_INFO)
  475. {
  476. (void)va_arg(varg_list_copy, struct starpu_profiling_task_info *);
  477. }
  478. else if (arg_type==STARPU_TASK_NO_SUBMITORDER)
  479. {
  480. (void)va_arg(varg_list_copy, unsigned);
  481. }
  482. else if (arg_type==STARPU_TASK_SCHED_DATA)
  483. {
  484. (void)va_arg(varg_list_copy, void *);
  485. }
  486. else
  487. {
  488. STARPU_ABORT_MSG("Unrecognized argument %d, did you perhaps forget to end arguments with 0?\n", arg_type);
  489. }
  490. }
  491. va_end(varg_list_copy);
  492. if (inconsistent_execute == 1 || *xrank == -1)
  493. {
  494. // We need to find out which node is going to execute the codelet.
  495. _STARPU_MPI_DEBUG(100, "Different nodes are owning W data. The node to execute the codelet is going to be selected with the current selection node policy. See starpu_mpi_node_selection_set_current_policy() to change the policy, or use STARPU_EXECUTE_ON_NODE or STARPU_EXECUTE_ON_DATA to specify the node\n");
  496. *xrank = _starpu_mpi_select_node(me, nb_nodes, descrs, nb_data, select_node_policy);
  497. *do_execute = *xrank == STARPU_MPI_PER_NODE || (me == *xrank);
  498. }
  499. else
  500. {
  501. _STARPU_MPI_DEBUG(100, "Inconsistent=%d - xrank=%d\n", inconsistent_execute, *xrank);
  502. *do_execute = *xrank == STARPU_MPI_PER_NODE || (me == *xrank);
  503. }
  504. _STARPU_MPI_DEBUG(100, "do_execute=%d\n", *do_execute);
  505. *descrs_p = descrs;
  506. *nb_data_p = nb_data;
  507. *prio_p = prio;
  508. _STARPU_TRACE_TASK_MPI_DECODE_END();
  509. return 0;
  510. }
  511. static
  512. int _starpu_mpi_task_build_v(MPI_Comm comm, struct starpu_codelet *codelet, struct starpu_task **task, int *xrank_p, struct starpu_data_descr **descrs_p, int *nb_data_p, int *prio_p, va_list varg_list)
  513. {
  514. int me, do_execute, xrank, nb_nodes;
  515. int ret;
  516. int i;
  517. struct starpu_data_descr *descrs;
  518. int nb_data;
  519. int prio;
  520. _STARPU_MPI_LOG_IN();
  521. starpu_mpi_comm_rank(comm, &me);
  522. starpu_mpi_comm_size(comm, &nb_nodes);
  523. /* Find out whether we are to execute the data because we own the data to be written to. */
  524. ret = _starpu_mpi_task_decode_v(codelet, me, nb_nodes, &xrank, &do_execute, &descrs, &nb_data, &prio, varg_list);
  525. if (ret < 0)
  526. return ret;
  527. _STARPU_TRACE_TASK_MPI_PRE_START();
  528. /* Send and receive data as requested */
  529. for(i=0 ; i<nb_data ; i++)
  530. {
  531. _starpu_mpi_exchange_data_before_execution(descrs[i].handle, descrs[i].mode, me, xrank, do_execute, prio, comm);
  532. }
  533. if (xrank_p)
  534. *xrank_p = xrank;
  535. if (nb_data_p)
  536. *nb_data_p = nb_data;
  537. if (prio_p)
  538. *prio_p = prio;
  539. if (descrs_p)
  540. *descrs_p = descrs;
  541. else
  542. free(descrs);
  543. _STARPU_TRACE_TASK_MPI_PRE_END();
  544. if (do_execute == 0)
  545. {
  546. return 1;
  547. }
  548. else
  549. {
  550. va_list varg_list_copy;
  551. _STARPU_MPI_DEBUG(100, "Execution of the codelet %p (%s)\n", codelet, codelet?codelet->name:NULL);
  552. *task = starpu_task_create();
  553. (*task)->cl_arg_free = 1;
  554. (*task)->callback_arg_free = 1;
  555. (*task)->prologue_callback_arg_free = 1;
  556. (*task)->prologue_callback_pop_arg_free = 1;
  557. va_copy(varg_list_copy, varg_list);
  558. _starpu_task_insert_create(codelet, *task, varg_list_copy);
  559. va_end(varg_list_copy);
  560. return 0;
  561. }
  562. }
  563. int _starpu_mpi_task_postbuild_v(MPI_Comm comm, int xrank, int do_execute, struct starpu_data_descr *descrs, int nb_data, int prio)
  564. {
  565. int me, i;
  566. _STARPU_TRACE_TASK_MPI_POST_START();
  567. starpu_mpi_comm_rank(comm, &me);
  568. for(i=0 ; i<nb_data ; i++)
  569. {
  570. _starpu_mpi_exchange_data_after_execution(descrs[i].handle, descrs[i].mode, me, xrank, do_execute, prio, comm);
  571. _starpu_mpi_clear_data_after_execution(descrs[i].handle, descrs[i].mode, me, do_execute);
  572. }
  573. free(descrs);
  574. _STARPU_TRACE_TASK_MPI_POST_END();
  575. _STARPU_MPI_LOG_OUT();
  576. return 0;
  577. }
  578. static
  579. int _starpu_mpi_task_insert_v(MPI_Comm comm, struct starpu_codelet *codelet, va_list varg_list)
  580. {
  581. struct starpu_task *task;
  582. int ret;
  583. int xrank;
  584. int do_execute = 0;
  585. struct starpu_data_descr *descrs;
  586. int nb_data;
  587. int prio;
  588. ret = _starpu_mpi_task_build_v(comm, codelet, &task, &xrank, &descrs, &nb_data, &prio, varg_list);
  589. if (ret < 0)
  590. return ret;
  591. if (ret == 0)
  592. {
  593. do_execute = 1;
  594. ret = starpu_task_submit(task);
  595. if (STARPU_UNLIKELY(ret == -ENODEV))
  596. {
  597. _STARPU_MSG("submission of task %p wih codelet %p failed (symbol `%s') (err: ENODEV)\n",
  598. task, task->cl,
  599. (codelet == NULL) ? "none" :
  600. task->cl->name ? task->cl->name :
  601. (task->cl->model && task->cl->model->symbol)?task->cl->model->symbol:"none");
  602. task->destroy = 0;
  603. starpu_task_destroy(task);
  604. }
  605. }
  606. int val = _starpu_mpi_task_postbuild_v(comm, xrank, do_execute, descrs, nb_data, prio);
  607. if (ret == 0 && pre_submit_hook)
  608. pre_submit_hook(task);
  609. return val;
  610. }
  611. int starpu_mpi_task_insert(MPI_Comm comm, struct starpu_codelet *codelet, ...)
  612. {
  613. va_list varg_list;
  614. int ret;
  615. va_start(varg_list, codelet);
  616. ret = _starpu_mpi_task_insert_v(comm, codelet, varg_list);
  617. va_end(varg_list);
  618. return ret;
  619. }
  620. int starpu_mpi_insert_task(MPI_Comm comm, struct starpu_codelet *codelet, ...)
  621. {
  622. va_list varg_list;
  623. int ret;
  624. va_start(varg_list, codelet);
  625. ret = _starpu_mpi_task_insert_v(comm, codelet, varg_list);
  626. va_end(varg_list);
  627. return ret;
  628. }
  629. struct starpu_task *starpu_mpi_task_build(MPI_Comm comm, struct starpu_codelet *codelet, ...)
  630. {
  631. va_list varg_list;
  632. struct starpu_task *task;
  633. int ret;
  634. va_start(varg_list, codelet);
  635. ret = _starpu_mpi_task_build_v(comm, codelet, &task, NULL, NULL, NULL, NULL, varg_list);
  636. va_end(varg_list);
  637. STARPU_ASSERT(ret >= 0);
  638. return (ret > 0) ? NULL : task;
  639. }
  640. int starpu_mpi_task_post_build(MPI_Comm comm, struct starpu_codelet *codelet, ...)
  641. {
  642. int xrank, do_execute;
  643. int ret, me, nb_nodes;
  644. va_list varg_list;
  645. struct starpu_data_descr *descrs;
  646. int nb_data;
  647. int prio;
  648. starpu_mpi_comm_rank(comm, &me);
  649. starpu_mpi_comm_size(comm, &nb_nodes);
  650. va_start(varg_list, codelet);
  651. /* Find out whether we are to execute the data because we own the data to be written to. */
  652. ret = _starpu_mpi_task_decode_v(codelet, me, nb_nodes, &xrank, &do_execute, &descrs, &nb_data, &prio, varg_list);
  653. va_end(varg_list);
  654. if (ret < 0)
  655. return ret;
  656. return _starpu_mpi_task_postbuild_v(comm, xrank, do_execute, descrs, nb_data, prio);
  657. }
  658. struct _starpu_mpi_redux_data_args
  659. {
  660. starpu_data_handle_t data_handle;
  661. starpu_data_handle_t new_handle;
  662. starpu_mpi_tag_t data_tag;
  663. int node;
  664. MPI_Comm comm;
  665. struct starpu_task *taskB;
  666. };
  667. void _starpu_mpi_redux_data_dummy_func(void *buffers[], void *cl_arg)
  668. {
  669. (void)buffers;
  670. (void)cl_arg;
  671. }
  672. /* Dummy cost function for simgrid */
  673. static double cost_function(struct starpu_task *task, unsigned nimpl)
  674. {
  675. (void)task;
  676. (void)nimpl;
  677. return 0.000001;
  678. }
  679. static struct starpu_perfmodel dumb_model =
  680. {
  681. .type = STARPU_COMMON,
  682. .cost_function = cost_function
  683. };
  684. static
  685. struct starpu_codelet _starpu_mpi_redux_data_read_cl =
  686. {
  687. .cpu_funcs = {_starpu_mpi_redux_data_dummy_func},
  688. .cuda_funcs = {_starpu_mpi_redux_data_dummy_func},
  689. .opencl_funcs = {_starpu_mpi_redux_data_dummy_func},
  690. .nbuffers = 1,
  691. .modes = {STARPU_R},
  692. .model = &dumb_model,
  693. .name = "_starpu_mpi_redux_data_read_cl"
  694. };
  695. struct starpu_codelet _starpu_mpi_redux_data_readwrite_cl =
  696. {
  697. .cpu_funcs = {_starpu_mpi_redux_data_dummy_func},
  698. .cuda_funcs = {_starpu_mpi_redux_data_dummy_func},
  699. .opencl_funcs = {_starpu_mpi_redux_data_dummy_func},
  700. .nbuffers = 1,
  701. .modes = {STARPU_RW},
  702. .model = &dumb_model,
  703. .name = "_starpu_mpi_redux_data_write_cl"
  704. };
  705. static
  706. void _starpu_mpi_redux_data_detached_callback(void *arg)
  707. {
  708. struct _starpu_mpi_redux_data_args *args = (struct _starpu_mpi_redux_data_args *) arg;
  709. STARPU_TASK_SET_HANDLE(args->taskB, args->new_handle, 1);
  710. int ret = starpu_task_submit(args->taskB);
  711. STARPU_ASSERT(ret == 0);
  712. starpu_data_unregister_submit(args->new_handle);
  713. free(args);
  714. }
  715. static
  716. void _starpu_mpi_redux_data_recv_callback(void *callback_arg)
  717. {
  718. struct _starpu_mpi_redux_data_args *args = (struct _starpu_mpi_redux_data_args *) callback_arg;
  719. starpu_data_register_same(&args->new_handle, args->data_handle);
  720. starpu_mpi_irecv_detached_sequential_consistency(args->new_handle, args->node, args->data_tag, args->comm, _starpu_mpi_redux_data_detached_callback, args, 0);
  721. }
  722. /* TODO: this should rather be implicitly called by starpu_mpi_task_insert when
  723. * a data previously accessed in REDUX mode gets accessed in R mode. */
  724. void starpu_mpi_redux_data_prio(MPI_Comm comm, starpu_data_handle_t data_handle, int prio)
  725. {
  726. int me, rank, nb_nodes;
  727. starpu_mpi_tag_t tag;
  728. rank = starpu_mpi_data_get_rank(data_handle);
  729. tag = starpu_mpi_data_get_tag(data_handle);
  730. if (rank == -1)
  731. {
  732. _STARPU_ERROR("StarPU needs to be told the MPI rank of this data, using starpu_mpi_data_register\n");
  733. }
  734. if (tag == -1)
  735. {
  736. _STARPU_ERROR("StarPU needs to be told the MPI tag of this data, using starpu_mpi_data_register\n");
  737. }
  738. starpu_mpi_comm_rank(comm, &me);
  739. starpu_mpi_comm_size(comm, &nb_nodes);
  740. _STARPU_MPI_DEBUG(1, "Doing reduction for data %p on node %d with %d nodes ...\n", data_handle, rank, nb_nodes);
  741. // need to count how many nodes have the data in redux mode
  742. if (me == rank)
  743. {
  744. int i;
  745. // taskC depends on all taskBs created
  746. struct starpu_task *taskC = starpu_task_create();
  747. taskC->cl = &_starpu_mpi_redux_data_readwrite_cl;
  748. STARPU_TASK_SET_HANDLE(taskC, data_handle, 0);
  749. for(i=0 ; i<nb_nodes ; i++)
  750. {
  751. if (i != rank)
  752. {
  753. /* We need to make sure all is
  754. * executed after data_handle finished
  755. * its last read access, we hence do
  756. * the following:
  757. * - submit an empty task A reading
  758. * data_handle whose callback submits
  759. * the mpi comm with sequential
  760. * consistency set to 0, whose
  761. * callback submits the redux_cl task
  762. * B with sequential consistency set
  763. * to 0,
  764. * - submit an empty task C reading
  765. * and writing data_handle and
  766. * depending on task B, just to replug
  767. * with implicit data dependencies
  768. * with tasks inserted after this
  769. * reduction.
  770. */
  771. struct _starpu_mpi_redux_data_args *args;
  772. _STARPU_MPI_MALLOC(args, sizeof(struct _starpu_mpi_redux_data_args));
  773. args->data_handle = data_handle;
  774. args->data_tag = tag;
  775. args->node = i;
  776. args->comm = comm;
  777. // We need to create taskB early as
  778. // taskC declares a dependancy on it
  779. args->taskB = starpu_task_create();
  780. args->taskB->cl = args->data_handle->redux_cl;
  781. args->taskB->sequential_consistency = 0;
  782. STARPU_TASK_SET_HANDLE(args->taskB, args->data_handle, 0);
  783. starpu_task_declare_deps_array(taskC, 1, &args->taskB);
  784. // Submit taskA
  785. starpu_task_insert(&_starpu_mpi_redux_data_read_cl,
  786. STARPU_R, data_handle,
  787. STARPU_CALLBACK_WITH_ARG_NFREE, _starpu_mpi_redux_data_recv_callback, args,
  788. 0);
  789. }
  790. }
  791. int ret = starpu_task_submit(taskC);
  792. STARPU_ASSERT(ret == 0);
  793. }
  794. else
  795. {
  796. _STARPU_MPI_DEBUG(1, "Sending redux handle to %d ...\n", rank);
  797. starpu_mpi_isend_detached_prio(data_handle, rank, tag, prio, comm, NULL, NULL);
  798. starpu_task_insert(data_handle->init_cl, STARPU_W, data_handle, 0);
  799. }
  800. /* FIXME: In order to prevent simultaneous receive submissions
  801. * on the same handle, we need to wait that all the starpu_mpi
  802. * tasks are done before submitting next tasks. The current
  803. * version of the implementation does not support multiple
  804. * simultaneous receive requests on the same handle.*/
  805. starpu_task_wait_for_all();
  806. }
  807. void starpu_mpi_redux_data(MPI_Comm comm, starpu_data_handle_t data_handle)
  808. {
  809. return starpu_mpi_redux_data_prio(comm, data_handle, 0);
  810. }