starpu_mpi_insert_task.c 17 KB

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