starpu_mpi_insert_task.c 18 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412413414415416417418419420421422423424425426427428429430431432433434435
  1. /* StarPU --- Runtime system for heterogeneous multicore architectures.
  2. *
  3. * Copyright (C) 2011, 2012 Centre National de la Recherche Scientifique
  4. * Copyright (C) 2011 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_pack_cl_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_REDUX) {
  90. starpu_data_handle_t data = va_arg(varg_list, starpu_data_handle_t);
  91. if (data) {
  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. do_execute = 1;
  97. }
  98. }
  99. else if (arg_type==STARPU_R || arg_type==STARPU_W || arg_type==STARPU_RW || arg_type == STARPU_SCRATCH) {
  100. starpu_data_handle_t data = va_arg(varg_list, starpu_data_handle_t);
  101. if (arg_type & STARPU_W) {
  102. if (!data) {
  103. /* We don't have anything allocated for this.
  104. * The application knows we won't do anything
  105. * about this task */
  106. /* Yes, the app could actually not call
  107. * insert_task at all itself, this is just a
  108. * safeguard. */
  109. _STARPU_MPI_DEBUG("oh oh\n");
  110. _STARPU_MPI_LOG_OUT();
  111. free(size_on_nodes);
  112. return -EINVAL;
  113. }
  114. int mpi_rank = starpu_data_get_rank(data);
  115. if (mpi_rank == me) {
  116. if (do_execute == 0) {
  117. inconsistent_execute = 1;
  118. }
  119. else {
  120. do_execute = 1;
  121. }
  122. }
  123. else if (mpi_rank != -1) {
  124. if (do_execute == 1) {
  125. inconsistent_execute = 1;
  126. }
  127. else {
  128. do_execute = 0;
  129. dest = mpi_rank;
  130. /* That's the rank which needs the data to be sent to */
  131. }
  132. }
  133. else {
  134. _STARPU_ERROR("rank invalid\n");
  135. }
  136. }
  137. }
  138. else if (arg_type==STARPU_VALUE) {
  139. va_arg(varg_list, void *);
  140. va_arg(varg_list, size_t);
  141. }
  142. else if (arg_type==STARPU_CALLBACK) {
  143. va_arg(varg_list, void (*)(void *));
  144. }
  145. else if (arg_type==STARPU_CALLBACK_WITH_ARG) {
  146. va_arg(varg_list, void (*)(void *));
  147. va_arg(varg_list, void *);
  148. }
  149. else if (arg_type==STARPU_CALLBACK_ARG) {
  150. va_arg(varg_list, void *);
  151. }
  152. else if (arg_type==STARPU_PRIORITY) {
  153. va_arg(varg_list, int);
  154. }
  155. else if (arg_type==STARPU_EXECUTE_ON_NODE) {
  156. va_arg(varg_list, int);
  157. }
  158. else if (arg_type==STARPU_EXECUTE_ON_DATA) {
  159. va_arg(varg_list, int);
  160. }
  161. }
  162. va_end(varg_list);
  163. STARPU_ASSERT(do_execute != -1 && "StarPU needs to see a W or a REDUX data which will tell it where to execute the task");
  164. if (inconsistent_execute == 1) {
  165. if (xrank == -1) {
  166. _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");
  167. free(size_on_nodes);
  168. return -EINVAL;
  169. }
  170. else {
  171. do_execute = (me == xrank);
  172. dest = xrank;
  173. }
  174. }
  175. else if (xrank != -1) {
  176. _STARPU_MPI_DEBUG("Property STARPU_EXECUTE_ON_NODE or STARPU_EXECUTE_ON_DATA overwriting node defined by data model\n");
  177. do_execute = (me == xrank);
  178. dest = xrank;
  179. }
  180. else {
  181. int i;
  182. size_t max_size = size_on_nodes[0];
  183. xrank = 0;
  184. for(i=1 ; i<nb_nodes ; i++) {
  185. if (size_on_nodes[i] > max_size)
  186. {
  187. max_size = size_on_nodes[i];
  188. xrank = i;
  189. }
  190. }
  191. free(size_on_nodes);
  192. _STARPU_MPI_DEBUG("Node %d is having the most REDUX data\n", xrank);
  193. do_execute = (me == xrank);
  194. dest = xrank;
  195. }
  196. _STARPU_MPI_DEBUG("Executing %d - Sending to node %d\n", do_execute, dest);
  197. /* Send and receive data as requested */
  198. va_start(varg_list, codelet);
  199. while ((arg_type = va_arg(varg_list, int)) != 0) {
  200. if (arg_type==STARPU_R || arg_type==STARPU_W || arg_type==STARPU_RW || arg_type == STARPU_SCRATCH) {
  201. starpu_data_handle_t data = va_arg(varg_list, starpu_data_handle_t);
  202. if (data && arg_type & STARPU_R) {
  203. int mpi_rank = starpu_data_get_rank(data);
  204. int mpi_tag = starpu_data_get_tag(data);
  205. STARPU_ASSERT(mpi_tag >= 0 && "StarPU needs to be told the MPI rank of this data, using starpu_data_set_rank");
  206. /* The task needs to read this data */
  207. if (do_execute && mpi_rank != me && mpi_rank != -1) {
  208. /* I will have to execute but I don't have the data, receive */
  209. #ifdef MPI_CACHE
  210. uint32_t key = starpu_crc32_be((uintptr_t)data, 0);
  211. void *already_received = _starpu_htbl_search_32(received_data[mpi_rank], key);
  212. if (!already_received) {
  213. _starpu_htbl_insert_32(&received_data[mpi_rank], key, data);
  214. }
  215. else {
  216. _STARPU_MPI_DEBUG("Do not receive data %p from node %d as it is already available\n", data, mpi_rank);
  217. }
  218. if (!already_received)
  219. #endif
  220. {
  221. _STARPU_MPI_DEBUG("Receive data %p from %d\n", data, mpi_rank);
  222. starpu_mpi_irecv_detached(data, mpi_rank, mpi_tag, comm, NULL, NULL);
  223. }
  224. }
  225. if (!do_execute && mpi_rank == me) {
  226. /* Somebody else will execute it, and I have the data, send it. */
  227. #ifdef MPI_CACHE
  228. uint32_t key = starpu_crc32_be((uintptr_t)data, 0);
  229. void *already_sent = _starpu_htbl_search_32(sent_data[dest], key);
  230. if (!already_sent) {
  231. _starpu_htbl_insert_32(&sent_data[dest], key, data);
  232. }
  233. else {
  234. _STARPU_MPI_DEBUG("Do not sent data %p to node %d as it has already been sent\n", data, dest);
  235. }
  236. if (!already_sent)
  237. #endif
  238. {
  239. _STARPU_MPI_DEBUG("Send data %p to %d\n", data, dest);
  240. starpu_mpi_isend_detached(data, dest, mpi_tag, comm, NULL, NULL);
  241. }
  242. }
  243. }
  244. }
  245. else if (arg_type==STARPU_VALUE) {
  246. va_arg(varg_list, void *);
  247. va_arg(varg_list, size_t);
  248. }
  249. else if (arg_type==STARPU_CALLBACK) {
  250. va_arg(varg_list, void (*)(void *));
  251. }
  252. else if (arg_type==STARPU_CALLBACK_WITH_ARG) {
  253. va_arg(varg_list, void (*)(void *));
  254. va_arg(varg_list, void *);
  255. }
  256. else if (arg_type==STARPU_CALLBACK_ARG) {
  257. va_arg(varg_list, void *);
  258. }
  259. else if (arg_type==STARPU_PRIORITY) {
  260. va_arg(varg_list, int);
  261. }
  262. else if (arg_type==STARPU_EXECUTE_ON_NODE) {
  263. va_arg(varg_list, int);
  264. }
  265. else if (arg_type==STARPU_EXECUTE_ON_DATA) {
  266. va_arg(varg_list, starpu_data_handle_t);
  267. }
  268. }
  269. va_end(varg_list);
  270. if (do_execute) {
  271. _STARPU_MPI_DEBUG("Execution of the codelet %p (%s)\n", codelet, codelet->name);
  272. va_start(varg_list, codelet);
  273. struct starpu_task *task = starpu_task_create();
  274. int ret = _starpu_insert_task_create_and_submit(arg_buffer, codelet, &task, varg_list);
  275. _STARPU_MPI_DEBUG("ret: %d\n", ret);
  276. STARPU_ASSERT(ret==0);
  277. }
  278. if (inconsistent_execute) {
  279. va_start(varg_list, codelet);
  280. while ((arg_type = va_arg(varg_list, int)) != 0) {
  281. if (arg_type==STARPU_R || arg_type==STARPU_W || arg_type==STARPU_RW || arg_type == STARPU_SCRATCH) {
  282. starpu_data_handle_t data = va_arg(varg_list, starpu_data_handle_t);
  283. if (arg_type & STARPU_W) {
  284. int mpi_rank = starpu_data_get_rank(data);
  285. int mpi_tag = starpu_data_get_tag(data);
  286. STARPU_ASSERT(mpi_tag >= 0 && "StarPU needs to be told the MPI rank of this data, using starpu_data_set_rank");
  287. if (mpi_rank == me) {
  288. if (xrank != -1 && me != xrank) {
  289. _STARPU_MPI_DEBUG("Receive data %p back from the task %d which executed the codelet ...\n", data, dest);
  290. starpu_mpi_irecv_detached(data, dest, mpi_tag, comm, NULL, NULL);
  291. }
  292. }
  293. else if (do_execute) {
  294. _STARPU_MPI_DEBUG("Send data %p back to its owner %d...\n", data, mpi_rank);
  295. starpu_mpi_isend_detached(data, mpi_rank, mpi_tag, comm, NULL, NULL);
  296. }
  297. }
  298. }
  299. else if (arg_type==STARPU_VALUE) {
  300. va_arg(varg_list, void *);
  301. va_arg(varg_list, size_t);
  302. }
  303. else if (arg_type==STARPU_CALLBACK) {
  304. va_arg(varg_list, void (*)(void *));
  305. }
  306. else if (arg_type==STARPU_CALLBACK_WITH_ARG) {
  307. va_arg(varg_list, void (*)(void *));
  308. va_arg(varg_list, void *);
  309. }
  310. else if (arg_type==STARPU_CALLBACK_ARG) {
  311. va_arg(varg_list, void *);
  312. }
  313. else if (arg_type==STARPU_PRIORITY) {
  314. va_arg(varg_list, int);
  315. }
  316. else if (arg_type==STARPU_EXECUTE_ON_NODE) {
  317. va_arg(varg_list, int);
  318. }
  319. else if (arg_type==STARPU_EXECUTE_ON_DATA) {
  320. va_arg(varg_list, starpu_data_handle_t);
  321. }
  322. }
  323. va_end(varg_list);
  324. }
  325. va_start(varg_list, codelet);
  326. while ((arg_type = va_arg(varg_list, int)) != 0) {
  327. if (arg_type==STARPU_R || arg_type==STARPU_W || arg_type==STARPU_RW || arg_type == STARPU_SCRATCH) {
  328. starpu_data_handle_t data = va_arg(varg_list, starpu_data_handle_t);
  329. #ifdef MPI_CACHE
  330. if (arg_type & STARPU_W) {
  331. uint32_t key = starpu_crc32_be((uintptr_t)data, 0);
  332. if (do_execute) {
  333. /* Note that all copies I've sent to neighbours are now invalid */
  334. int n, size;
  335. MPI_Comm_size(comm, &size);
  336. for(n=0 ; n<size ; n++) {
  337. void *already_sent = _starpu_htbl_search_32(sent_data[n], key);
  338. if (already_sent) {
  339. _STARPU_MPI_DEBUG("Posting request to clear send cache for data %p\n", data);
  340. _starpu_mpi_clear_cache_request(data, n, _STARPU_MPI_CLEAR_SENT_DATA);
  341. }
  342. }
  343. }
  344. else {
  345. int mpi_rank = starpu_data_get_rank(data);
  346. void *already_received = _starpu_htbl_search_32(received_data[mpi_rank], key);
  347. if (already_received) {
  348. /* Somebody else will write to the data, so discard our cached copy if any */
  349. /* TODO: starpu_mpi could just remember itself. */
  350. _STARPU_MPI_DEBUG("Posting request to clear receive cache for data %p\n", data);
  351. _starpu_mpi_clear_cache_request(data, mpi_rank, _STARPU_MPI_CLEAR_RECEIVED_DATA);
  352. _starpu_data_deallocate(data);
  353. }
  354. }
  355. }
  356. #else
  357. /* We allocated a temporary buffer for the received data, now drop it */
  358. if ((arg_type & STARPU_R) && do_execute) {
  359. int mpi_rank = starpu_data_get_rank(data);
  360. if (mpi_rank != me && mpi_rank != -1) {
  361. _starpu_data_deallocate(data);
  362. }
  363. }
  364. #endif
  365. }
  366. else if (arg_type==STARPU_VALUE) {
  367. va_arg(varg_list, void *);
  368. va_arg(varg_list, size_t);
  369. }
  370. else if (arg_type==STARPU_CALLBACK) {
  371. va_arg(varg_list, void (*)(void *));
  372. }
  373. else if (arg_type==STARPU_CALLBACK_WITH_ARG) {
  374. va_arg(varg_list, void (*)(void *));
  375. va_arg(varg_list, void *);
  376. }
  377. else if (arg_type==STARPU_CALLBACK_ARG) {
  378. va_arg(varg_list, void *);
  379. }
  380. else if (arg_type==STARPU_PRIORITY) {
  381. va_arg(varg_list, int);
  382. }
  383. else if (arg_type==STARPU_EXECUTE_ON_NODE) {
  384. va_arg(varg_list, int);
  385. }
  386. else if (arg_type==STARPU_EXECUTE_ON_DATA) {
  387. va_arg(varg_list, starpu_data_handle_t);
  388. }
  389. }
  390. va_end(varg_list);
  391. _STARPU_MPI_LOG_OUT();
  392. return 0;
  393. }
  394. void starpu_mpi_get_data_on_node(MPI_Comm comm, starpu_data_handle_t data_handle, int node)
  395. {
  396. int me, rank;
  397. rank = starpu_data_get_rank(data_handle);
  398. MPI_Comm_rank(comm, &me);
  399. if (node == rank) return;
  400. if (me == node)
  401. {
  402. starpu_mpi_irecv_detached(data_handle, rank, 42, comm, NULL, NULL);
  403. }
  404. else if (me == rank)
  405. {
  406. starpu_mpi_isend_detached(data_handle, node, 42, comm, NULL, NULL);
  407. }
  408. starpu_task_wait_for_all();
  409. }