starpu_mpi_insert_task.c 18 KB

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