insert_task_compute.c 6.1 KB

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