stencil-tasks.c 9.6 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350
  1. /* StarPU --- Runtime system for heterogeneous multicore architectures.
  2. *
  3. * Copyright (C) 2010, 2013-2015, 2017 Université de Bordeaux
  4. * Copyright (C) 2012, 2013, 2015, 2017 CNRS
  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 "stencil.h"
  18. #define BIND_LAST 1
  19. /*
  20. * Schedule tasks for updates and saves
  21. */
  22. /*
  23. * NB: iter = 0: initialization phase, TAG_U(z, 0) = TAG_INIT
  24. *
  25. * dir is -1 or +1.
  26. */
  27. #if 0
  28. # define DEBUG(fmt, ...) fprintf(stderr,fmt,##__VA_ARGS__)
  29. #else
  30. # define DEBUG(fmt, ...)
  31. #endif
  32. /*
  33. * SAVE
  34. */
  35. /* R(z) = R(z+d) = local, just call the save kernel */
  36. static void create_task_save_local(unsigned iter, unsigned z, int dir, int local_rank)
  37. {
  38. struct starpu_task *save_task = starpu_task_create();
  39. struct block_description *descr = get_block_description(z);
  40. save_task->cl = (dir == -1)?&save_cl_bottom:&save_cl_top;
  41. save_task->cl_arg = descr;
  42. /* Saving our border... */
  43. save_task->handles[0] = descr->layers_handle[0];
  44. save_task->handles[1] = descr->layers_handle[1];
  45. /* ... to the neighbour's copy */
  46. struct block_description *neighbour = descr->boundary_blocks[(1+dir)/2];
  47. save_task->handles[2] = neighbour->boundaries_handle[(1-dir)/2][0];
  48. save_task->handles[3] = neighbour->boundaries_handle[(1-dir)/2][1];
  49. /* Bind */
  50. if (iter <= BIND_LAST)
  51. save_task->execute_on_a_specific_worker = get_bind_tasks();
  52. save_task->workerid = descr->preferred_worker;
  53. int ret = starpu_task_submit(save_task);
  54. if (ret)
  55. {
  56. FPRINTF(stderr, "Could not submit task save: %d\n", ret);
  57. if (ret == -ENODEV)
  58. exit(77);
  59. STARPU_ABORT();
  60. }
  61. }
  62. /* R(z) = local & R(z+d) != local */
  63. /* We need to send our save over MPI */
  64. static void send_done(void *arg)
  65. {
  66. uintptr_t z = (uintptr_t) arg;
  67. (void) z;
  68. DEBUG("DO SEND %d\n", (int)z);
  69. }
  70. #if defined(STARPU_USE_MPI) && !defined(STARPU_USE_MPI_MASTER_SLAVE)
  71. /* Post MPI send */
  72. static void create_task_save_mpi_send(unsigned iter, unsigned z, int dir, int local_rank)
  73. {
  74. struct block_description *descr = get_block_description(z);
  75. STARPU_ASSERT(descr->mpi_node == local_rank);
  76. struct block_description *neighbour = descr->boundary_blocks[(1+dir)/2];
  77. int dest = neighbour->mpi_node;
  78. STARPU_ASSERT(neighbour->mpi_node != local_rank);
  79. /* Send neighbour's border copy to the neighbour */
  80. starpu_data_handle_t handle0 = neighbour->boundaries_handle[(1-dir)/2][0];
  81. starpu_data_handle_t handle1 = neighbour->boundaries_handle[(1-dir)/2][1];
  82. starpu_mpi_isend_detached(handle0, dest, MPI_TAG0(z, iter, dir), MPI_COMM_WORLD, send_done, (void*)(uintptr_t)z);
  83. starpu_mpi_isend_detached(handle1, dest, MPI_TAG1(z, iter, dir), MPI_COMM_WORLD, send_done, (void*)(uintptr_t)z);
  84. }
  85. /* R(z) != local & R(z+d) = local */
  86. /* We need to receive over MPI */
  87. static void recv_done(void *arg)
  88. {
  89. uintptr_t z = (uintptr_t) arg;
  90. (void) z;
  91. DEBUG("DO RECV %d\n", (int)z);
  92. }
  93. /* Post MPI recv */
  94. static void create_task_save_mpi_recv(unsigned iter, unsigned z, int dir, int local_rank)
  95. {
  96. struct block_description *descr = get_block_description(z);
  97. STARPU_ASSERT(descr->mpi_node != local_rank);
  98. struct block_description *neighbour = descr->boundary_blocks[(1+dir)/2];
  99. int source = descr->mpi_node;
  100. STARPU_ASSERT(neighbour->mpi_node == local_rank);
  101. /* Receive our neighbour's border in our neighbour copy */
  102. starpu_data_handle_t handle0 = neighbour->boundaries_handle[(1-dir)/2][0];
  103. starpu_data_handle_t handle1 = neighbour->boundaries_handle[(1-dir)/2][1];
  104. starpu_mpi_irecv_detached(handle0, source, MPI_TAG0(z, iter, dir), MPI_COMM_WORLD, recv_done, (void*)(uintptr_t)z);
  105. starpu_mpi_irecv_detached(handle1, source, MPI_TAG1(z, iter, dir), MPI_COMM_WORLD, recv_done, (void*)(uintptr_t)z);
  106. }
  107. #endif /* STARPU_USE_MPI */
  108. /*
  109. * Schedule saving boundaries of blocks to communication buffers
  110. */
  111. void create_task_save(unsigned iter, unsigned z, int dir, int local_rank)
  112. {
  113. int node_z = get_block_mpi_node(z);
  114. int node_z_and_d = get_block_mpi_node(z+dir);
  115. #if defined(STARPU_USE_MPI) && !defined(STARPU_USE_MPI_MASTER_SLAVE)
  116. if (node_z == local_rank)
  117. {
  118. /* Save data from update */
  119. create_task_save_local(iter, z, dir, local_rank);
  120. if (node_z_and_d != local_rank)
  121. {
  122. /* R(z) = local & R(z+d) != local, We have to send the data */
  123. create_task_save_mpi_send(iter, z, dir, local_rank);
  124. }
  125. }
  126. else
  127. { /* node_z != local_rank, this MPI node doesn't have the saved data */
  128. if (node_z_and_d == local_rank)
  129. {
  130. create_task_save_mpi_recv(iter, z, dir, local_rank);
  131. }
  132. else
  133. {
  134. /* R(z) != local & R(z+d) != local We don't have
  135. the saved data and don't need it, we shouldn't
  136. even have been called! */
  137. STARPU_ABORT();
  138. }
  139. }
  140. #else /* !STARPU_USE_MPI */
  141. STARPU_ASSERT((node_z == local_rank) && (node_z_and_d == local_rank));
  142. create_task_save_local(iter, z, dir, local_rank);
  143. #endif /* STARPU_USE_MPI */
  144. }
  145. /*
  146. * Schedule update computation in computation buffer
  147. */
  148. void create_task_update(unsigned iter, unsigned z, int local_rank)
  149. {
  150. STARPU_ASSERT(iter != 0);
  151. struct starpu_task *task = starpu_task_create();
  152. unsigned niter = get_niter();
  153. /* We are going to synchronize with the last tasks */
  154. if (iter == niter)
  155. {
  156. task->use_tag = 1;
  157. task->tag_id = TAG_FINISH(z);
  158. }
  159. unsigned old_layer = (K*(iter-1)) % 2;
  160. unsigned new_layer = (old_layer + 1) % 2;
  161. struct block_description *descr = get_block_description(z);
  162. task->handles[0] = descr->layers_handle[new_layer];
  163. task->handles[1] = descr->layers_handle[old_layer];
  164. task->handles[2] = descr->boundaries_handle[T][new_layer];
  165. task->handles[3] = descr->boundaries_handle[T][old_layer];
  166. task->handles[4] = descr->boundaries_handle[B][new_layer];
  167. task->handles[5] = descr->boundaries_handle[B][old_layer];
  168. task->cl = &cl_update;
  169. task->cl_arg = descr;
  170. if (iter <= BIND_LAST)
  171. task->execute_on_a_specific_worker = get_bind_tasks();
  172. task->workerid = descr->preferred_worker;
  173. int ret = starpu_task_submit(task);
  174. if (ret)
  175. {
  176. FPRINTF(stderr, "Could not submit task update block: %d\n", ret);
  177. if (ret == -ENODEV)
  178. exit(77);
  179. STARPU_ABORT();
  180. }
  181. }
  182. /* Dummy empty codelet taking one buffer */
  183. void null_func(void *descr[] STARPU_ATTRIBUTE_UNUSED, void *arg STARPU_ATTRIBUTE_UNUSED)
  184. {
  185. }
  186. static double null_cost_function(struct starpu_task *task, unsigned nimpl)
  187. {
  188. (void) task;
  189. (void) nimpl;
  190. return 0.000001;
  191. }
  192. static struct starpu_perfmodel null_model =
  193. {
  194. .type = STARPU_COMMON,
  195. .cost_function = null_cost_function,
  196. .symbol = "null"
  197. };
  198. static struct starpu_codelet null =
  199. {
  200. .modes = { STARPU_W, STARPU_W },
  201. .cpu_funcs = {null_func},
  202. .cpu_funcs_name = {"null_func"},
  203. .cuda_funcs = {null_func},
  204. .opencl_funcs = {null_func},
  205. .nbuffers = 2,
  206. .model = &null_model,
  207. .name = "start"
  208. };
  209. void create_start_task(int z, int dir)
  210. {
  211. /* Dumb task depending on the init task and simulating writing the
  212. neighbour buffers, to avoid communications and computation running
  213. before we start measuring time */
  214. struct starpu_task *wait_init = starpu_task_create();
  215. struct block_description *descr = get_block_description(z);
  216. starpu_tag_t tag_init = TAG_INIT_TASK;
  217. wait_init->cl = &null;
  218. wait_init->use_tag = 1;
  219. wait_init->tag_id = TAG_START(z, dir);
  220. wait_init->handles[0] = descr->boundaries_handle[(1 + dir) / 2][0];
  221. wait_init->handles[1] = descr->boundaries_handle[(1 + dir) / 2][1];
  222. starpu_tag_declare_deps_array(wait_init->tag_id, 1, &tag_init);
  223. int ret = starpu_task_submit(wait_init);
  224. if (ret)
  225. {
  226. FPRINTF(stderr, "Could not submit task initial wait: %d\n", ret);
  227. if (ret == -ENODEV)
  228. exit(77);
  229. STARPU_ABORT();
  230. }
  231. }
  232. /*
  233. * Create all the tasks
  234. */
  235. void create_tasks(int rank)
  236. {
  237. int iter;
  238. int bz;
  239. int niter = get_niter();
  240. int nbz = get_nbz();
  241. for (bz = 0; bz < nbz; bz++)
  242. {
  243. if ((get_block_mpi_node(bz) == rank) || (get_block_mpi_node(bz+1) == rank))
  244. create_start_task(bz, +1);
  245. if ((get_block_mpi_node(bz) == rank) || (get_block_mpi_node(bz-1) == rank))
  246. create_start_task(bz, -1);
  247. }
  248. for (iter = 0; iter <= niter; iter++)
  249. {
  250. starpu_iteration_push(iter);
  251. for (bz = 0; bz < nbz; bz++)
  252. {
  253. if ((iter > 0) && (get_block_mpi_node(bz) == rank))
  254. create_task_update(iter, bz, rank);
  255. }
  256. for (bz = 0; bz < nbz; bz++)
  257. {
  258. if (iter != niter)
  259. {
  260. if ((get_block_mpi_node(bz) == rank) || (get_block_mpi_node(bz+1) == rank))
  261. create_task_save(iter, bz, +1, rank);
  262. if ((get_block_mpi_node(bz) == rank) || (get_block_mpi_node(bz-1) == rank))
  263. create_task_save(iter, bz, -1, rank);
  264. }
  265. }
  266. starpu_iteration_pop();
  267. }
  268. }
  269. /*
  270. * Wait for termination
  271. */
  272. void wait_end_tasks(int rank)
  273. {
  274. int bz;
  275. int nbz = get_nbz();
  276. for (bz = 0; bz < nbz; bz++)
  277. {
  278. if (get_block_mpi_node(bz) == rank)
  279. {
  280. /* Wait for the task producing block "bz" */
  281. starpu_tag_wait(TAG_FINISH(bz));
  282. /* Get the result back to memory */
  283. struct block_description *block = get_block_description(bz);
  284. starpu_data_acquire(block->layers_handle[0], STARPU_R);
  285. starpu_data_acquire(block->layers_handle[1], STARPU_R);
  286. /* the data_acquire here is done to make sure
  287. * the data is sent back to the ram memory, we
  288. * can safely do a data_release, to avoid the
  289. * data_unregister to block later on
  290. */
  291. starpu_data_release(block->layers_handle[0]);
  292. starpu_data_release(block->layers_handle[1]);
  293. }
  294. }
  295. }