insert_task_compute.c 6.1 KB

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