starpu_mpi_insert_task.c 19 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412413414415416417418419420421422423424425426427428429430431432433434435436437438439440441442443444445446447448449450451452453454455456457458459460461462463464465466467468469470471472473474475476477478479480481482483484485486487488489490491492493494495496497498499500501502503504505506507508509510511512513514515516517518519520521522523524525526527528529530531532533534535536537538539540541542543544545546547548549550551552553554555556557558559560561562563564565566567568569570571572573574575576577578579580581582583584585586587588589590591592593594595596597598599600601602603604605606607608609610611612613614615616617618619620621622623624625626627628629630631
  1. /* StarPU --- Runtime system for heterogeneous multicore architectures.
  2. *
  3. * Copyright (C) 2011, 2012 Centre National de la Recherche Scientifique
  4. * Copyright (C) 2011-2012 Université de Bordeaux 1
  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 <stdarg.h>
  18. #include <mpi.h>
  19. #include <starpu.h>
  20. #include <starpu_data.h>
  21. #include <common/utils.h>
  22. #include <common/uthash.h>
  23. #include <util/starpu_insert_task_utils.h>
  24. #include <datawizard/coherency.h>
  25. //#define STARPU_MPI_VERBOSE 1
  26. #include <starpu_mpi_private.h>
  27. #ifdef STARPU_MPI_CACHE
  28. /* Whether we are allowed to keep copies of remote data. */
  29. struct _starpu_data_entry
  30. {
  31. UT_hash_handle hh;
  32. void *data;
  33. };
  34. struct _starpu_data_entry **sent_data = NULL;
  35. struct _starpu_data_entry **received_data = NULL;
  36. #endif /* STARPU_MPI_CACHE */
  37. static void _starpu_mpi_tables_init()
  38. {
  39. #ifdef STARPU_MPI_CACHE
  40. if (sent_data == NULL) {
  41. int nb_nodes;
  42. int i;
  43. MPI_Comm_size(MPI_COMM_WORLD, &nb_nodes);
  44. _STARPU_MPI_DEBUG("Initialising htable for cache\n");
  45. sent_data = malloc(nb_nodes * sizeof(struct _starpu_data_entry *));
  46. for(i=0 ; i<nb_nodes ; i++) sent_data[i] = NULL;
  47. received_data = malloc(nb_nodes * sizeof(struct _starpu_data_entry *));
  48. for(i=0 ; i<nb_nodes ; i++) received_data[i] = NULL;
  49. }
  50. #endif /* STARPU_MPI_CACHE */
  51. }
  52. static
  53. int _starpu_mpi_find_executee_node(starpu_data_handle_t data, enum starpu_access_mode mode, int me, int *do_execute, int *inconsistent_execute, int *dest, size_t *size_on_nodes)
  54. {
  55. if (data && mode & STARPU_R) {
  56. struct starpu_data_interface_ops *ops;
  57. int rank = starpu_data_get_rank(data);
  58. ops = data->ops;
  59. size_on_nodes[rank] += ops->get_size(data);
  60. }
  61. if (mode & STARPU_W) {
  62. if (!data) {
  63. /* We don't have anything allocated for this.
  64. * The application knows we won't do anything
  65. * about this task */
  66. /* Yes, the app could actually not call
  67. * insert_task at all itself, this is just a
  68. * safeguard. */
  69. _STARPU_MPI_DEBUG("oh oh\n");
  70. _STARPU_MPI_LOG_OUT();
  71. return -EINVAL;
  72. }
  73. int mpi_rank = starpu_data_get_rank(data);
  74. if (mpi_rank == me) {
  75. if (*do_execute == 0) {
  76. *inconsistent_execute = 1;
  77. }
  78. else {
  79. *do_execute = 1;
  80. }
  81. }
  82. else if (mpi_rank != -1) {
  83. if (*do_execute == 1) {
  84. *inconsistent_execute = 1;
  85. }
  86. else {
  87. *do_execute = 0;
  88. *dest = mpi_rank;
  89. /* That's the rank which needs the data to be sent to */
  90. }
  91. }
  92. else {
  93. _STARPU_ERROR("rank invalid\n");
  94. }
  95. }
  96. return 0;
  97. }
  98. void _starpu_mpi_exchange_data_before_execution(starpu_data_handle_t data, enum starpu_access_mode mode, int me, int dest, int do_execute, MPI_Comm comm)
  99. {
  100. if (data && mode & STARPU_R) {
  101. int mpi_rank = starpu_data_get_rank(data);
  102. int mpi_tag = starpu_data_get_tag(data);
  103. if(mpi_rank == -1) {
  104. fprintf(stderr,"StarPU needs to be told the MPI rank of this data, using starpu_data_set_rank\n");
  105. STARPU_ABORT();
  106. }
  107. if(mpi_tag == -1) {
  108. fprintf(stderr,"StarPU needs to be told the MPI tag of this data, using starpu_data_set_tag\n");
  109. STARPU_ABORT();
  110. }
  111. /* The task needs to read this data */
  112. if (do_execute && mpi_rank != me && mpi_rank != -1) {
  113. /* I will have to execute but I don't have the data, receive */
  114. #ifdef STARPU_MPI_CACHE
  115. struct _starpu_data_entry *already_received;
  116. HASH_FIND_PTR(received_data[mpi_rank], &data, already_received);
  117. if (already_received == NULL) {
  118. struct _starpu_data_entry *entry = (struct _starpu_data_entry *)malloc(sizeof(*entry));
  119. entry->data = data;
  120. HASH_ADD_PTR(received_data[mpi_rank], data, entry);
  121. }
  122. else {
  123. _STARPU_MPI_DEBUG("Do not receive data %p from node %d as it is already available\n", data, mpi_rank);
  124. }
  125. if (!already_received)
  126. #endif
  127. {
  128. _STARPU_MPI_DEBUG("Receive data %p from %d\n", data, mpi_rank);
  129. starpu_mpi_irecv_detached(data, mpi_rank, mpi_tag, comm, NULL, NULL);
  130. }
  131. }
  132. if (!do_execute && mpi_rank == me) {
  133. /* Somebody else will execute it, and I have the data, send it. */
  134. #ifdef STARPU_MPI_CACHE
  135. struct _starpu_data_entry *already_sent;
  136. HASH_FIND_PTR(sent_data[dest], &data, already_sent);
  137. if (already_sent == NULL) {
  138. struct _starpu_data_entry *entry = (struct _starpu_data_entry *)malloc(sizeof(*entry));
  139. entry->data = data;
  140. HASH_ADD_PTR(sent_data[dest], data, entry);
  141. _STARPU_MPI_DEBUG("Noting that data %p has already been sent to %d\n", data, dest);
  142. }
  143. else {
  144. _STARPU_MPI_DEBUG("Do not send data %p to node %d as it has already been sent\n", data, dest);
  145. }
  146. if (!already_sent)
  147. #endif
  148. {
  149. _STARPU_MPI_DEBUG("Send data %p to %d\n", data, dest);
  150. starpu_mpi_isend_detached(data, dest, mpi_tag, comm, NULL, NULL);
  151. }
  152. }
  153. }
  154. }
  155. void _starpu_mpi_exchange_data_after_execution(starpu_data_handle_t data, enum starpu_access_mode mode, int me, int xrank, int dest, int do_execute, MPI_Comm comm)
  156. {
  157. if (mode & STARPU_W) {
  158. int mpi_rank = starpu_data_get_rank(data);
  159. int mpi_tag = starpu_data_get_tag(data);
  160. if(mpi_rank == -1) {
  161. fprintf(stderr,"StarPU needs to be told the MPI rank of this data, using starpu_data_set_rank\n");
  162. STARPU_ABORT();
  163. }
  164. if(mpi_tag == -1) {
  165. fprintf(stderr,"StarPU needs to be told the MPI tag of this data, using starpu_data_set_tag\n");
  166. STARPU_ABORT();
  167. }
  168. if (mpi_rank == me) {
  169. if (xrank != -1 && me != xrank) {
  170. _STARPU_MPI_DEBUG("Receive data %p back from the task %d which executed the codelet ...\n", data, dest);
  171. starpu_mpi_irecv_detached(data, dest, mpi_tag, comm, NULL, NULL);
  172. }
  173. }
  174. else if (do_execute) {
  175. _STARPU_MPI_DEBUG("Send data %p back to its owner %d...\n", data, mpi_rank);
  176. starpu_mpi_isend_detached(data, mpi_rank, mpi_tag, comm, NULL, NULL);
  177. }
  178. }
  179. }
  180. void _starpu_mpi_clear_data_after_execution(starpu_data_handle_t data, enum starpu_access_mode mode, int me, int do_execute, MPI_Comm comm)
  181. {
  182. #ifdef STARPU_MPI_CACHE
  183. if (mode & STARPU_W) {
  184. if (do_execute) {
  185. /* Note that all copies I've sent to neighbours are now invalid */
  186. int n, size;
  187. MPI_Comm_size(comm, &size);
  188. for(n=0 ; n<size ; n++) {
  189. struct _starpu_data_entry *already_sent;
  190. HASH_FIND_PTR(sent_data[n], &data, already_sent);
  191. if (already_sent) {
  192. _STARPU_MPI_DEBUG("Clearing send cache for data %p\n", data);
  193. HASH_DEL(sent_data[n], already_sent);
  194. }
  195. }
  196. }
  197. else {
  198. int mpi_rank = starpu_data_get_rank(data);
  199. struct _starpu_data_entry *already_received;
  200. HASH_FIND_PTR(received_data[mpi_rank], &data, already_received);
  201. if (already_received) {
  202. /* Somebody else will write to the data, so discard our cached copy if any */
  203. /* TODO: starpu_mpi could just remember itself. */
  204. _STARPU_MPI_DEBUG("Clearing receive cache for data %p\n", data);
  205. HASH_DEL(received_data[mpi_rank], already_received);
  206. starpu_data_invalidate_submit(data);
  207. }
  208. }
  209. }
  210. #else
  211. /* We allocated a temporary buffer for the received data, now drop it */
  212. if ((mode & STARPU_R) && do_execute) {
  213. int mpi_rank = starpu_data_get_rank(data);
  214. if (mpi_rank != me && mpi_rank != -1) {
  215. starpu_data_invalidate_submit(data);
  216. }
  217. }
  218. #endif
  219. }
  220. int starpu_mpi_insert_task(MPI_Comm comm, struct starpu_codelet *codelet, ...)
  221. {
  222. int arg_type;
  223. va_list varg_list;
  224. int me, do_execute, xrank, nb_nodes;
  225. size_t *size_on_nodes;
  226. size_t arg_buffer_size = 0;
  227. char *arg_buffer;
  228. int dest=0, inconsistent_execute;
  229. int current_data = 0;
  230. _STARPU_MPI_LOG_IN();
  231. MPI_Comm_rank(comm, &me);
  232. MPI_Comm_size(comm, &nb_nodes);
  233. size_on_nodes = (size_t *)calloc(1, nb_nodes * sizeof(size_t));
  234. _starpu_mpi_tables_init();
  235. /* Get the number of buffers and the size of the arguments */
  236. va_start(varg_list, codelet);
  237. arg_buffer_size = _starpu_insert_task_get_arg_size(varg_list);
  238. va_start(varg_list, codelet);
  239. _starpu_codelet_pack_args(arg_buffer_size, &arg_buffer, varg_list);
  240. /* Find out whether we are to execute the data because we own the data to be written to. */
  241. inconsistent_execute = 0;
  242. do_execute = -1;
  243. xrank = -1;
  244. va_start(varg_list, codelet);
  245. while ((arg_type = va_arg(varg_list, int)) != 0) {
  246. if (arg_type==STARPU_EXECUTE_ON_NODE) {
  247. xrank = va_arg(varg_list, int);
  248. _STARPU_MPI_DEBUG("Executing on node %d\n", xrank);
  249. do_execute = 1;
  250. }
  251. else if (arg_type==STARPU_EXECUTE_ON_DATA) {
  252. starpu_data_handle_t data = va_arg(varg_list, starpu_data_handle_t);
  253. xrank = starpu_data_get_rank(data);
  254. _STARPU_MPI_DEBUG("Executing on data node %d\n", xrank);
  255. STARPU_ASSERT(xrank <= nb_nodes);
  256. do_execute = 1;
  257. }
  258. else if (arg_type==STARPU_R || arg_type==STARPU_W || arg_type==STARPU_RW || arg_type==STARPU_SCRATCH || arg_type==STARPU_REDUX) {
  259. starpu_data_handle_t data = va_arg(varg_list, starpu_data_handle_t);
  260. enum starpu_access_mode mode = (enum starpu_access_mode) arg_type;
  261. int ret = _starpu_mpi_find_executee_node(data, mode, me, &do_execute, &inconsistent_execute, &dest, size_on_nodes);
  262. if (ret == -EINVAL)
  263. {
  264. free(size_on_nodes);
  265. return ret;
  266. }
  267. current_data ++;
  268. }
  269. else if (arg_type == STARPU_DATA_ARRAY)
  270. {
  271. starpu_data_handle_t *datas = va_arg(varg_list, starpu_data_handle_t *);
  272. int nb_handles = va_arg(varg_list, int);
  273. int i;
  274. for(i=0 ; i<nb_handles ; i++)
  275. {
  276. enum starpu_access_mode mode = codelet->modes[current_data];
  277. int ret = _starpu_mpi_find_executee_node(datas[i], mode, me, &do_execute, &inconsistent_execute, &dest, size_on_nodes);
  278. if (ret == -EINVAL)
  279. {
  280. free(size_on_nodes);
  281. return ret;
  282. }
  283. current_data ++;
  284. }
  285. }
  286. else if (arg_type==STARPU_VALUE) {
  287. va_arg(varg_list, void *);
  288. va_arg(varg_list, size_t);
  289. }
  290. else if (arg_type==STARPU_CALLBACK) {
  291. va_arg(varg_list, void (*)(void *));
  292. }
  293. else if (arg_type==STARPU_CALLBACK_WITH_ARG) {
  294. va_arg(varg_list, void (*)(void *));
  295. va_arg(varg_list, void *);
  296. }
  297. else if (arg_type==STARPU_CALLBACK_ARG) {
  298. va_arg(varg_list, void *);
  299. }
  300. else if (arg_type==STARPU_PRIORITY) {
  301. va_arg(varg_list, int);
  302. }
  303. else if (arg_type==STARPU_EXECUTE_ON_NODE) {
  304. va_arg(varg_list, int);
  305. }
  306. else if (arg_type==STARPU_EXECUTE_ON_DATA) {
  307. va_arg(varg_list, int);
  308. }
  309. }
  310. va_end(varg_list);
  311. if (do_execute == -1) {
  312. int i;
  313. size_t max_size = 0;
  314. for(i=0 ; i<nb_nodes ; i++) {
  315. if (size_on_nodes[i] > max_size)
  316. {
  317. max_size = size_on_nodes[i];
  318. xrank = i;
  319. }
  320. }
  321. free(size_on_nodes);
  322. if (xrank != -1) {
  323. _STARPU_MPI_DEBUG("Node %d is having the most R data\n", xrank);
  324. do_execute = 1;
  325. }
  326. }
  327. STARPU_ASSERT(do_execute != -1 && "StarPU needs to see a W or a REDUX data which will tell it where to execute the task");
  328. if (inconsistent_execute == 1) {
  329. if (xrank == -1) {
  330. _STARPU_MPI_DEBUG("Different tasks are owning W data. Needs to specify which one is to execute the codelet, using STARPU_EXECUTE_ON_NODE or STARPU_EXECUTE_ON_DATA\n");
  331. free(size_on_nodes);
  332. return -EINVAL;
  333. }
  334. else {
  335. do_execute = (me == xrank);
  336. dest = xrank;
  337. }
  338. }
  339. else if (xrank != -1) {
  340. do_execute = (me == xrank);
  341. dest = xrank;
  342. }
  343. /* Send and receive data as requested */
  344. va_start(varg_list, codelet);
  345. current_data = 0;
  346. while ((arg_type = va_arg(varg_list, int)) != 0) {
  347. if (arg_type==STARPU_R || arg_type==STARPU_W || arg_type==STARPU_RW || arg_type==STARPU_SCRATCH || arg_type==STARPU_REDUX) {
  348. starpu_data_handle_t data = va_arg(varg_list, starpu_data_handle_t);
  349. enum starpu_access_mode mode = (enum starpu_access_mode) arg_type;
  350. _starpu_mpi_exchange_data_before_execution(data, mode, me, dest, do_execute, comm);
  351. current_data ++;
  352. }
  353. else if (arg_type == STARPU_DATA_ARRAY)
  354. {
  355. starpu_data_handle_t *datas = va_arg(varg_list, starpu_data_handle_t *);
  356. int nb_handles = va_arg(varg_list, int);
  357. int i;
  358. for(i=0 ; i<nb_handles ; i++)
  359. {
  360. _starpu_mpi_exchange_data_before_execution(datas[i], codelet->modes[current_data], me, dest, do_execute, comm);
  361. current_data++;
  362. }
  363. }
  364. else if (arg_type==STARPU_VALUE) {
  365. va_arg(varg_list, void *);
  366. va_arg(varg_list, size_t);
  367. }
  368. else if (arg_type==STARPU_CALLBACK) {
  369. va_arg(varg_list, void (*)(void *));
  370. }
  371. else if (arg_type==STARPU_CALLBACK_WITH_ARG) {
  372. va_arg(varg_list, void (*)(void *));
  373. va_arg(varg_list, void *);
  374. }
  375. else if (arg_type==STARPU_CALLBACK_ARG) {
  376. va_arg(varg_list, void *);
  377. }
  378. else if (arg_type==STARPU_PRIORITY) {
  379. va_arg(varg_list, int);
  380. }
  381. else if (arg_type==STARPU_EXECUTE_ON_NODE) {
  382. va_arg(varg_list, int);
  383. }
  384. else if (arg_type==STARPU_EXECUTE_ON_DATA) {
  385. va_arg(varg_list, starpu_data_handle_t);
  386. }
  387. }
  388. va_end(varg_list);
  389. if (do_execute) {
  390. _STARPU_MPI_DEBUG("Execution of the codelet %p (%s)\n", codelet, codelet->name);
  391. va_start(varg_list, codelet);
  392. struct starpu_task *task = starpu_task_create();
  393. int ret = _starpu_insert_task_create_and_submit(arg_buffer, arg_buffer_size, codelet, &task, varg_list);
  394. _STARPU_MPI_DEBUG("ret: %d\n", ret);
  395. STARPU_ASSERT(ret==0);
  396. }
  397. if (inconsistent_execute) {
  398. va_start(varg_list, codelet);
  399. current_data = 0;
  400. while ((arg_type = va_arg(varg_list, int)) != 0) {
  401. if (arg_type==STARPU_R || arg_type==STARPU_W || arg_type==STARPU_RW || arg_type==STARPU_SCRATCH || arg_type==STARPU_REDUX) {
  402. starpu_data_handle_t data = va_arg(varg_list, starpu_data_handle_t);
  403. enum starpu_access_mode mode = (enum starpu_access_mode) arg_type;
  404. _starpu_mpi_exchange_data_after_execution(data, mode, me, xrank, dest, do_execute, comm);
  405. current_data++;
  406. }
  407. else if (arg_type == STARPU_DATA_ARRAY)
  408. {
  409. starpu_data_handle_t *datas = va_arg(varg_list, starpu_data_handle_t *);
  410. int nb_handles = va_arg(varg_list, int);
  411. int i;
  412. for(i=0 ; i<nb_handles ; i++)
  413. {
  414. _starpu_mpi_exchange_data_after_execution(datas[i], codelet->modes[current_data], me, xrank, dest, do_execute, comm);
  415. current_data++;
  416. }
  417. }
  418. else if (arg_type==STARPU_VALUE) {
  419. va_arg(varg_list, void *);
  420. va_arg(varg_list, size_t);
  421. }
  422. else if (arg_type==STARPU_CALLBACK) {
  423. va_arg(varg_list, void (*)(void *));
  424. }
  425. else if (arg_type==STARPU_CALLBACK_WITH_ARG) {
  426. va_arg(varg_list, void (*)(void *));
  427. va_arg(varg_list, void *);
  428. }
  429. else if (arg_type==STARPU_CALLBACK_ARG) {
  430. va_arg(varg_list, void *);
  431. }
  432. else if (arg_type==STARPU_PRIORITY) {
  433. va_arg(varg_list, int);
  434. }
  435. else if (arg_type==STARPU_EXECUTE_ON_NODE) {
  436. va_arg(varg_list, int);
  437. }
  438. else if (arg_type==STARPU_EXECUTE_ON_DATA) {
  439. va_arg(varg_list, starpu_data_handle_t);
  440. }
  441. }
  442. va_end(varg_list);
  443. }
  444. va_start(varg_list, codelet);
  445. current_data = 0;
  446. while ((arg_type = va_arg(varg_list, int)) != 0) {
  447. if (arg_type==STARPU_R || arg_type==STARPU_W || arg_type==STARPU_RW || arg_type == STARPU_SCRATCH || arg_type == STARPU_REDUX) {
  448. starpu_data_handle_t data = va_arg(varg_list, starpu_data_handle_t);
  449. enum starpu_access_mode mode = (enum starpu_access_mode) arg_type;
  450. _starpu_mpi_clear_data_after_execution(data, mode, me, do_execute, comm);
  451. current_data++;
  452. }
  453. else if (arg_type == STARPU_DATA_ARRAY)
  454. {
  455. starpu_data_handle_t *datas = va_arg(varg_list, starpu_data_handle_t *);
  456. int nb_handles = va_arg(varg_list, int);
  457. int i;
  458. for(i=0 ; i<nb_handles ; i++)
  459. {
  460. _starpu_mpi_clear_data_after_execution(datas[i], codelet->modes[current_data], me, do_execute, comm);
  461. current_data++;
  462. }
  463. }
  464. else if (arg_type==STARPU_VALUE) {
  465. va_arg(varg_list, void *);
  466. va_arg(varg_list, size_t);
  467. }
  468. else if (arg_type==STARPU_CALLBACK) {
  469. va_arg(varg_list, void (*)(void *));
  470. }
  471. else if (arg_type==STARPU_CALLBACK_WITH_ARG) {
  472. va_arg(varg_list, void (*)(void *));
  473. va_arg(varg_list, void *);
  474. }
  475. else if (arg_type==STARPU_CALLBACK_ARG) {
  476. va_arg(varg_list, void *);
  477. }
  478. else if (arg_type==STARPU_PRIORITY) {
  479. va_arg(varg_list, int);
  480. }
  481. else if (arg_type==STARPU_EXECUTE_ON_NODE) {
  482. va_arg(varg_list, int);
  483. }
  484. else if (arg_type==STARPU_EXECUTE_ON_DATA) {
  485. va_arg(varg_list, starpu_data_handle_t);
  486. }
  487. }
  488. va_end(varg_list);
  489. _STARPU_MPI_LOG_OUT();
  490. return 0;
  491. }
  492. void starpu_mpi_get_data_on_node_detached(MPI_Comm comm, starpu_data_handle_t data_handle, int node, void (*callback)(void*), void *arg)
  493. {
  494. int me, rank, tag;
  495. rank = starpu_data_get_rank(data_handle);
  496. tag = starpu_data_get_tag(data_handle);
  497. if(rank == -1) {
  498. fprintf(stderr,"StarPU needs to be told the MPI rank of this data, using starpu_data_set_rank\n");
  499. STARPU_ABORT();
  500. }
  501. if(tag == -1) {
  502. fprintf(stderr,"StarPU needs to be told the MPI tag of this data, using starpu_data_set_tag\n");
  503. STARPU_ABORT();
  504. }
  505. MPI_Comm_rank(comm, &me);
  506. if (node == rank) return;
  507. if (me == node)
  508. {
  509. starpu_mpi_irecv_detached(data_handle, rank, tag, comm, callback, arg);
  510. }
  511. else if (me == rank)
  512. {
  513. starpu_mpi_isend_detached(data_handle, node, tag, comm, NULL, NULL);
  514. }
  515. }
  516. void starpu_mpi_get_data_on_node(MPI_Comm comm, starpu_data_handle_t data_handle, int node)
  517. {
  518. int me, rank, tag;
  519. rank = starpu_data_get_rank(data_handle);
  520. tag = starpu_data_get_tag(data_handle);
  521. if(rank == -1) {
  522. fprintf(stderr,"StarPU needs to be told the MPI rank of this data, using starpu_data_set_rank\n");
  523. STARPU_ABORT();
  524. }
  525. if(tag == -1) {
  526. fprintf(stderr,"StarPU needs to be told the MPI tag of this data, using starpu_data_set_tag\n");
  527. STARPU_ABORT();
  528. }
  529. MPI_Comm_rank(comm, &me);
  530. if (node == rank) return;
  531. if (me == node)
  532. {
  533. MPI_Status status;
  534. starpu_mpi_recv(data_handle, rank, tag, comm, &status);
  535. }
  536. else if (me == rank)
  537. {
  538. starpu_mpi_send(data_handle, node, tag, comm);
  539. }
  540. }
  541. void starpu_mpi_redux_data(MPI_Comm comm, starpu_data_handle_t data_handle)
  542. {
  543. int me, rank, tag, nb_nodes;
  544. rank = starpu_data_get_rank(data_handle);
  545. tag = starpu_data_get_tag(data_handle);
  546. if(rank == -1) {
  547. fprintf(stderr,"StarPU needs to be told the MPI rank of this data, using starpu_data_set_rank\n");
  548. STARPU_ABORT();
  549. }
  550. if(tag == -1) {
  551. fprintf(stderr,"StarPU needs to be told the MPI tag of this data, using starpu_data_set_tag\n");
  552. STARPU_ABORT();
  553. }
  554. MPI_Comm_rank(comm, &me);
  555. MPI_Comm_size(comm, &nb_nodes);
  556. _STARPU_MPI_DEBUG("Doing reduction for data %p on node %d with %d nodes ...\n", data_handle, rank, nb_nodes);
  557. // need to count how many nodes have the data in redux mode
  558. if (me == rank) {
  559. int i;
  560. for(i=0 ; i<nb_nodes ; i++) {
  561. if (i != rank) {
  562. starpu_data_handle_t new_handle;
  563. starpu_data_register_same(&new_handle, data_handle);
  564. _STARPU_MPI_DEBUG("Receiving redux handle from %d in %p ...\n", i, new_handle);
  565. starpu_mpi_irecv_detached(new_handle, i, tag, comm, NULL, NULL);
  566. starpu_insert_task(data_handle->redux_cl,
  567. STARPU_RW, data_handle,
  568. STARPU_R, new_handle,
  569. 0);
  570. }
  571. }
  572. }
  573. else {
  574. _STARPU_MPI_DEBUG("Sending redux handle to %d ...\n", rank);
  575. starpu_mpi_isend_detached(data_handle, rank, tag, comm, NULL, NULL);
  576. }
  577. }