stencil-tasks.c 9.4 KB

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