stencil-tasks.c 9.1 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319
  1. /* StarPU --- Runtime system for heterogeneous multicore architectures.
  2. *
  3. * Copyright (C) 2010 Université de Bordeaux 1
  4. *
  5. * StarPU is free software; you can redistribute it and/or modify
  6. * it under the terms of the GNU Lesser General Public License as published by
  7. * the Free Software Foundation; either version 2.1 of the License, or (at
  8. * your option) any later version.
  9. *
  10. * StarPU is distributed in the hope that it will be useful, but
  11. * WITHOUT ANY WARRANTY; without even the implied warranty of
  12. * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.
  13. *
  14. * See the GNU Lesser General Public License in COPYING.LGPL for more details.
  15. */
  16. #include "stencil.h"
  17. #define BIND_LAST 1
  18. /*
  19. * Schedule tasks for updates and saves
  20. */
  21. /*
  22. * NB: iter = 0: initialization phase, TAG_U(z, 0) = TAG_INIT
  23. *
  24. * dir is -1 or +1.
  25. */
  26. #if 0
  27. # define DEBUG(fmt, ...) fprintf(stderr,fmt,##__VA_ARGS__)
  28. #else
  29. # define DEBUG(fmt, ...)
  30. #endif
  31. /*
  32. * SAVE
  33. */
  34. /* R(z) = R(z+d) = local, just call the save kernel */
  35. static void create_task_save_local(unsigned iter, unsigned z, int dir, unsigned local_rank)
  36. {
  37. struct starpu_task *save_task = starpu_task_create();
  38. struct block_description *descr = get_block_description(z);
  39. save_task->cl = (dir == -1)?&save_cl_bottom:&save_cl_top;
  40. save_task->cl_arg = descr;
  41. /* Saving our border... */
  42. save_task->buffers[0].handle = descr->layers_handle[0];
  43. save_task->buffers[0].mode = STARPU_R;
  44. save_task->buffers[1].handle = descr->layers_handle[1];
  45. save_task->buffers[1].mode = STARPU_R;
  46. /* ... to the neighbour's copy */
  47. struct block_description *neighbour = descr->boundary_blocks[(1+dir)/2];
  48. save_task->buffers[2].handle = neighbour->boundaries_handle[(1-dir)/2][0];
  49. save_task->buffers[2].mode = STARPU_W;
  50. save_task->buffers[3].handle = neighbour->boundaries_handle[(1-dir)/2][1];
  51. save_task->buffers[3].mode = STARPU_W;
  52. /* Bind */
  53. if (iter <= BIND_LAST)
  54. save_task->execute_on_a_specific_worker = get_bind_tasks();
  55. save_task->workerid = descr->preferred_worker;
  56. int ret = starpu_task_submit(save_task);
  57. if (ret)
  58. {
  59. fprintf(stderr, "Could not submit task save: %d\n", ret);
  60. STARPU_ASSERT(0);
  61. }
  62. }
  63. /* R(z) = local & R(z+d) != local */
  64. /* We need to send our save over MPI */
  65. static void send_done(void *arg)
  66. {
  67. uintptr_t z = (uintptr_t) arg;
  68. DEBUG("DO SEND %d\n", (int)z);
  69. }
  70. #ifdef STARPU_USE_MPI
  71. /* Post MPI send */
  72. static void create_task_save_mpi_send(unsigned iter, unsigned z, int dir, unsigned 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. DEBUG("DO RECV %d\n", (int)z);
  91. }
  92. /* Post MPI recv */
  93. static void create_task_save_mpi_recv(unsigned iter, unsigned z, int dir, unsigned local_rank)
  94. {
  95. struct block_description *descr = get_block_description(z);
  96. STARPU_ASSERT(descr->mpi_node != local_rank);
  97. struct block_description *neighbour = descr->boundary_blocks[(1+dir)/2];
  98. int source = descr->mpi_node;
  99. STARPU_ASSERT(neighbour->mpi_node == local_rank);
  100. /* Receive our neighbour's border in our neighbour copy */
  101. starpu_data_handle_t handle0 = neighbour->boundaries_handle[(1-dir)/2][0];
  102. starpu_data_handle_t handle1 = neighbour->boundaries_handle[(1-dir)/2][1];
  103. starpu_mpi_irecv_detached(handle0, source, MPI_TAG0(z, iter, dir), MPI_COMM_WORLD, recv_done, (void*)(uintptr_t)z);
  104. starpu_mpi_irecv_detached(handle1, source, MPI_TAG1(z, iter, dir), MPI_COMM_WORLD, recv_done, (void*)(uintptr_t)z);
  105. }
  106. #endif /* STARPU_USE_MPI */
  107. /*
  108. * Schedule saving boundaries of blocks to communication buffers
  109. */
  110. void create_task_save(unsigned iter, unsigned z, int dir, unsigned local_rank)
  111. {
  112. unsigned node_z = get_block_mpi_node(z);
  113. unsigned node_z_and_d = get_block_mpi_node(z+dir);
  114. #ifdef STARPU_USE_MPI
  115. if (node_z == local_rank)
  116. {
  117. /* Save data from update */
  118. create_task_save_local(iter, z, dir, local_rank);
  119. if (node_z_and_d != local_rank)
  120. { /* R(z) = local & R(z+d) != local, We have to send the data */
  121. create_task_save_mpi_send(iter, z, dir, local_rank);
  122. }
  123. }
  124. else
  125. { /* node_z != local_rank, this MPI node doesn't have the saved data */
  126. if (node_z_and_d == local_rank)
  127. {
  128. create_task_save_mpi_recv(iter, z, dir, local_rank);
  129. }
  130. else
  131. { /* R(z) != local & R(z+d) != local We don't have
  132. the saved data and don't need it, we shouldn't
  133. even have been called! */
  134. STARPU_ASSERT(0);
  135. }
  136. }
  137. #else /* !STARPU_USE_MPI */
  138. STARPU_ASSERT((node_z == local_rank) && (node_z_and_d == local_rank));
  139. create_task_save_local(iter, z, dir, local_rank);
  140. #endif /* STARPU_USE_MPI */
  141. }
  142. /*
  143. * Schedule update computation in computation buffer
  144. */
  145. void create_task_update(unsigned iter, unsigned z, unsigned local_rank)
  146. {
  147. STARPU_ASSERT(iter != 0);
  148. struct starpu_task *task = starpu_task_create();
  149. unsigned niter = get_niter();
  150. /* We are going to synchronize with the last tasks */
  151. if (iter == niter)
  152. {
  153. task->detach = 0;
  154. task->use_tag = 1;
  155. task->tag_id = TAG_FINISH(z);
  156. }
  157. unsigned old_layer = (K*(iter-1)) % 2;
  158. unsigned new_layer = (old_layer + 1) % 2;
  159. struct block_description *descr = get_block_description(z);
  160. task->buffers[0].handle = descr->layers_handle[new_layer];
  161. task->buffers[0].mode = STARPU_RW;
  162. task->buffers[1].handle = descr->layers_handle[old_layer];
  163. task->buffers[1].mode = STARPU_RW;
  164. task->buffers[2].handle = descr->boundaries_handle[T][new_layer];
  165. task->buffers[2].mode = STARPU_R;
  166. task->buffers[3].handle = descr->boundaries_handle[T][old_layer];
  167. task->buffers[3].mode = STARPU_R;
  168. task->buffers[4].handle = descr->boundaries_handle[B][new_layer];
  169. task->buffers[4].mode = STARPU_R;
  170. task->buffers[5].handle = descr->boundaries_handle[B][old_layer];
  171. task->buffers[5].mode = STARPU_R;
  172. task->cl = &cl_update;
  173. task->cl_arg = descr;
  174. if (iter <= BIND_LAST)
  175. task->execute_on_a_specific_worker = get_bind_tasks();
  176. task->workerid = descr->preferred_worker;
  177. int ret = starpu_task_submit(task);
  178. if (ret)
  179. {
  180. fprintf(stderr, "Could not submit task update block: %d\n", ret);
  181. STARPU_ASSERT(0);
  182. }
  183. }
  184. /* Dummy empty codelet taking one buffer */
  185. static void null_func(void *descr[] __attribute__((unused)), void *arg __attribute__((unused))) { }
  186. static struct starpu_codelet null =
  187. {
  188. .where = STARPU_CPU|STARPU_CUDA|STARPU_OPENCL,
  189. .cpu_funcs = {null_func, NULL},
  190. .cuda_funcs = {null_func, NULL},
  191. .opencl_funcs = {null_func, NULL},
  192. .nbuffers = 2
  193. };
  194. void create_start_task(int z, int dir)
  195. {
  196. /* Dumb task depending on the init task and simulating writing the
  197. neighbour buffers, to avoid communications and computation running
  198. before we start measuring time */
  199. struct starpu_task *wait_init = starpu_task_create();
  200. struct block_description *descr = get_block_description(z);
  201. starpu_tag_t tag_init = TAG_INIT_TASK;
  202. wait_init->cl = &null;
  203. wait_init->use_tag = 1;
  204. wait_init->tag_id = TAG_START(z, dir);
  205. wait_init->buffers[0].handle = descr->boundaries_handle[(1+dir)/2][0];
  206. wait_init->buffers[0].mode = STARPU_W;
  207. wait_init->buffers[1].handle = descr->boundaries_handle[(1+dir)/2][1];
  208. wait_init->buffers[1].mode = STARPU_W;
  209. starpu_tag_declare_deps_array(wait_init->tag_id, 1, &tag_init);
  210. int ret = starpu_task_submit(wait_init);
  211. if (ret)
  212. {
  213. fprintf(stderr, "Could not submit task initial wait: %d\n", ret);
  214. STARPU_ASSERT(0);
  215. }
  216. }
  217. /*
  218. * Create all the tasks
  219. */
  220. void create_tasks(int rank)
  221. {
  222. unsigned iter;
  223. unsigned bz;
  224. int niter = get_niter();
  225. int nbz = get_nbz();
  226. for (bz = 0; bz < nbz; bz++)
  227. {
  228. if ((get_block_mpi_node(bz) == rank) || (get_block_mpi_node(bz+1) == rank))
  229. create_start_task(bz, +1);
  230. if ((get_block_mpi_node(bz) == rank) || (get_block_mpi_node(bz-1) == rank))
  231. create_start_task(bz, -1);
  232. }
  233. for (iter = 0; iter <= niter; iter++)
  234. for (bz = 0; bz < nbz; bz++)
  235. {
  236. if ((iter > 0) && (get_block_mpi_node(bz) == rank))
  237. create_task_update(iter, bz, rank);
  238. if (iter != niter)
  239. {
  240. if ((get_block_mpi_node(bz) == rank) || (get_block_mpi_node(bz+1) == rank))
  241. create_task_save(iter, bz, +1, rank);
  242. if ((get_block_mpi_node(bz) == rank) || (get_block_mpi_node(bz-1) == rank))
  243. create_task_save(iter, bz, -1, rank);
  244. }
  245. }
  246. }
  247. /*
  248. * Wait for termination
  249. */
  250. void wait_end_tasks(int rank)
  251. {
  252. unsigned bz;
  253. int nbz = get_nbz();
  254. for (bz = 0; bz < nbz; bz++)
  255. {
  256. if (get_block_mpi_node(bz) == rank)
  257. {
  258. /* Wait for the task producing block "bz" */
  259. starpu_tag_wait(TAG_FINISH(bz));
  260. /* Get the result back to memory */
  261. struct block_description *block = get_block_description(bz);
  262. starpu_data_acquire(block->layers_handle[0], STARPU_R);
  263. starpu_data_acquire(block->layers_handle[1], STARPU_R);
  264. }
  265. }
  266. }