starpu_mpi_insert_task.c 18 KB

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