insert_task_compute.c 6.0 KB

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