starpu_mpi_insert_task.c 20 KB

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