insert_task_compute.c 6.0 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238
  1. /* StarPU --- Runtime system for heterogeneous multicore architectures.
  2. *
  3. * Copyright (C) 2013-2020 Université de Bordeaux, CNRS (LaBRI UMR 5800), Inria
  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 <starpu_mpi.h>
  17. #include "helper.h"
  18. void func_cpu(void *descr[], void *_args)
  19. {
  20. int rank;
  21. int *x = (int *)STARPU_VARIABLE_GET_PTR(descr[0]);
  22. int *y = (int *)STARPU_VARIABLE_GET_PTR(descr[1]);
  23. starpu_codelet_unpack_args(_args, &rank);
  24. FPRINTF(stdout, "[%d] VALUES: %d %d\n", rank, *x, *y);
  25. *x = *x * *y;
  26. }
  27. struct starpu_codelet mycodelet =
  28. {
  29. .cpu_funcs = {func_cpu},
  30. .nbuffers = 2,
  31. .modes = {STARPU_RW, STARPU_R},
  32. .model = &starpu_perfmodel_nop,
  33. };
  34. int test(int rank, int node, int *before, int *after, int task_insert, int data_array)
  35. {
  36. int ok, ret, i, x[2];
  37. starpu_data_handle_t data_handles[2];
  38. struct starpu_data_descr descrs[2];
  39. int barrier_ret;
  40. ret = starpu_mpi_init_conf(NULL, NULL, 0, MPI_COMM_WORLD, NULL);
  41. STARPU_CHECK_RETURN_VALUE(ret, "starpu_mpi_init_conf");
  42. if (starpu_cpu_worker_get_count() <= 0)
  43. {
  44. // If there is no cpu to execute the codelet, mpi will block trying to do the post-execution communication
  45. ret = -ENODEV;
  46. FPRINTF_MPI(stderr, "No CPU is available\n");
  47. goto nodata;
  48. }
  49. FPRINTF_MPI(stderr, "Testing with node=%d - task_insert=%d - data_array=%d - \n", node, task_insert, data_array);
  50. for(i=0 ; i<2 ; i++)
  51. {
  52. if (rank <= 1)
  53. {
  54. x[i] = before[rank*2+i];
  55. FPRINTF_MPI(stderr, "before computation x[%d] = %d\n", i, x[i]);
  56. }
  57. else
  58. x[i] = rank*2+i;
  59. if (rank == i)
  60. starpu_variable_data_register(&data_handles[i], 0, (uintptr_t)&x[i], sizeof(int));
  61. else
  62. starpu_variable_data_register(&data_handles[i], -1, (uintptr_t)NULL, sizeof(int));
  63. starpu_mpi_data_register(data_handles[i], i, i);
  64. descrs[i].handle = data_handles[i];
  65. }
  66. descrs[0].mode = STARPU_RW;
  67. descrs[1].mode = STARPU_R;
  68. switch(task_insert)
  69. {
  70. case 0:
  71. {
  72. struct starpu_task *task = NULL;
  73. switch(data_array)
  74. {
  75. case 0:
  76. {
  77. task = starpu_mpi_task_build(MPI_COMM_WORLD, &mycodelet,
  78. STARPU_RW, data_handles[0], STARPU_R, data_handles[1],
  79. STARPU_VALUE, &rank, sizeof(rank),
  80. STARPU_EXECUTE_ON_NODE, node, 0);
  81. break;
  82. }
  83. case 1:
  84. {
  85. task = starpu_mpi_task_build(MPI_COMM_WORLD, &mycodelet,
  86. STARPU_DATA_ARRAY, data_handles, 2,
  87. STARPU_VALUE, &rank, sizeof(rank),
  88. STARPU_EXECUTE_ON_NODE, node, 0);
  89. break;
  90. }
  91. case 2:
  92. {
  93. task = starpu_mpi_task_build(MPI_COMM_WORLD, &mycodelet,
  94. STARPU_DATA_MODE_ARRAY, descrs, 2,
  95. STARPU_VALUE, &rank, sizeof(rank),
  96. STARPU_EXECUTE_ON_NODE, node, 0);
  97. break;
  98. }
  99. }
  100. if (task)
  101. {
  102. ret = starpu_task_submit(task);
  103. if (ret == -ENODEV)
  104. goto enodev;
  105. STARPU_CHECK_RETURN_VALUE(ret, "starpu_task_submit");
  106. }
  107. switch(data_array)
  108. {
  109. case 0:
  110. {
  111. starpu_mpi_task_post_build(MPI_COMM_WORLD, &mycodelet,
  112. STARPU_RW, data_handles[0], STARPU_R, data_handles[1],
  113. STARPU_EXECUTE_ON_NODE, node, 0);
  114. break;
  115. }
  116. case 1:
  117. {
  118. starpu_mpi_task_post_build(MPI_COMM_WORLD, &mycodelet,
  119. STARPU_DATA_ARRAY, data_handles, 2,
  120. STARPU_EXECUTE_ON_NODE, node, 0);
  121. break;
  122. }
  123. case 2:
  124. {
  125. starpu_mpi_task_post_build(MPI_COMM_WORLD, &mycodelet,
  126. STARPU_DATA_MODE_ARRAY, descrs, 2,
  127. STARPU_EXECUTE_ON_NODE, node, 0);
  128. break;
  129. }
  130. }
  131. break;
  132. }
  133. case 1:
  134. {
  135. switch(data_array)
  136. {
  137. case 0:
  138. {
  139. ret = starpu_mpi_task_insert(MPI_COMM_WORLD, &mycodelet,
  140. STARPU_RW, data_handles[0], STARPU_R, data_handles[1],
  141. STARPU_VALUE, &rank, sizeof(rank),
  142. STARPU_EXECUTE_ON_NODE, node, 0);
  143. break;
  144. }
  145. case 1:
  146. {
  147. ret = starpu_mpi_task_insert(MPI_COMM_WORLD, &mycodelet,
  148. STARPU_DATA_ARRAY, data_handles, 2,
  149. STARPU_VALUE, &rank, sizeof(rank),
  150. STARPU_EXECUTE_ON_NODE, node, 0);
  151. break;
  152. }
  153. case 2:
  154. {
  155. ret = starpu_mpi_task_insert(MPI_COMM_WORLD, &mycodelet,
  156. STARPU_DATA_MODE_ARRAY, descrs, 2,
  157. STARPU_VALUE, &rank, sizeof(rank),
  158. STARPU_EXECUTE_ON_NODE, node, 0);
  159. break;
  160. }
  161. }
  162. STARPU_CHECK_RETURN_VALUE(ret, "starpu_mpi_task_insert");
  163. break;
  164. }
  165. }
  166. starpu_task_wait_for_all();
  167. enodev:
  168. for(i=0; i<2; i++)
  169. {
  170. starpu_data_unregister(data_handles[i]);
  171. }
  172. ok = 1;
  173. #ifndef STARPU_SIMGRID
  174. if (rank <= 1)
  175. {
  176. for(i=0; i<2; i++)
  177. {
  178. ok = ok && (x[i] == after[rank*2+i]);
  179. FPRINTF_MPI(stderr, "after computation x[%d] = %d, should be %d\n", i, x[i], after[rank*2+i]);
  180. }
  181. FPRINTF_MPI(stderr, "result is %s\n", ok?"CORRECT":"NOT CORRECT");
  182. }
  183. #endif
  184. nodata:
  185. barrier_ret = MPI_Barrier(MPI_COMM_WORLD);
  186. STARPU_ASSERT(barrier_ret == MPI_SUCCESS);
  187. starpu_mpi_shutdown();
  188. return ret == -ENODEV ? ret : !ok;
  189. }
  190. int main(int argc, char **argv)
  191. {
  192. int rank;
  193. int global_ret, ret;
  194. int before[4] = {10, 20, 11, 22};
  195. int after_node[2][4] = {{220, 20, 11, 22}, {220, 20, 11, 22}};
  196. int node, insert_task, data_array;
  197. MPI_INIT_THREAD_real(&argc, &argv, MPI_THREAD_SERIALIZED);
  198. starpu_mpi_comm_rank(MPI_COMM_WORLD, &rank);
  199. global_ret = 0;
  200. for(node=0 ; node<=1 ; node++)
  201. {
  202. for(insert_task=0 ; insert_task<=1 ; insert_task++)
  203. {
  204. for(data_array=0 ; data_array<=2 ; data_array++)
  205. {
  206. ret = test(rank, node, before, after_node[node], insert_task, data_array);
  207. if (ret == -ENODEV || ret)
  208. global_ret = ret;
  209. }
  210. }
  211. }
  212. MPI_Finalize();
  213. return global_ret==-ENODEV?STARPU_TEST_SKIPPED:global_ret;
  214. }