starpu_mpi_insert_task.c 15 KB

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