starpu_mpi_insert_task.c 18 KB

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