insert_task_compute.c 6.1 KB

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