insert_task_compute.c 5.8 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231
  1. /* StarPU --- Runtime system for heterogeneous multicore architectures.
  2. *
  3. * Copyright (C) 2013, 2014, 2015 Centre National de la Recherche Scientifique
  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. struct starpu_codelet mycodelet =
  28. {
  29. .cpu_funcs = {func_cpu},
  30. .nbuffers = 2,
  31. .modes = {STARPU_RW, STARPU_R}
  32. };
  33. int test(int rank, int node, int *before, int *after, int task_insert, int data_array)
  34. {
  35. int ok, ret, i, x[2];
  36. starpu_data_handle_t data_handles[2];
  37. struct starpu_data_descr descrs[2];
  38. ret = starpu_init(NULL);
  39. STARPU_CHECK_RETURN_VALUE(ret, "starpu_init");
  40. ret = starpu_mpi_init(NULL, NULL, 0);
  41. STARPU_CHECK_RETURN_VALUE(ret, "starpu_mpi_init");
  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. x[i] = before[rank*2+i];
  53. if (rank <= 1)
  54. FPRINTF_MPI(stderr, "before computation x[%d] = %d\n", i, x[i]);
  55. if (rank == i)
  56. starpu_variable_data_register(&data_handles[i], 0, (uintptr_t)&x[i], sizeof(int));
  57. else
  58. starpu_variable_data_register(&data_handles[i], -1, (uintptr_t)NULL, sizeof(int));
  59. starpu_mpi_data_register(data_handles[i], i, i);
  60. descrs[i].handle = data_handles[i];
  61. }
  62. descrs[0].mode = STARPU_RW;
  63. descrs[1].mode = STARPU_R;
  64. switch(task_insert)
  65. {
  66. case 0:
  67. {
  68. struct starpu_task *task = NULL;
  69. switch(data_array)
  70. {
  71. case 0:
  72. {
  73. task = starpu_mpi_task_build(MPI_COMM_WORLD, &mycodelet,
  74. STARPU_RW, data_handles[0], STARPU_R, data_handles[1],
  75. STARPU_VALUE, &rank, sizeof(rank),
  76. STARPU_EXECUTE_ON_NODE, node, 0);
  77. break;
  78. }
  79. case 1:
  80. {
  81. task = starpu_mpi_task_build(MPI_COMM_WORLD, &mycodelet,
  82. STARPU_DATA_ARRAY, data_handles, 2,
  83. STARPU_VALUE, &rank, sizeof(rank),
  84. STARPU_EXECUTE_ON_NODE, node, 0);
  85. break;
  86. }
  87. case 2:
  88. {
  89. task = starpu_mpi_task_build(MPI_COMM_WORLD, &mycodelet,
  90. STARPU_DATA_MODE_ARRAY, descrs, 2,
  91. STARPU_VALUE, &rank, sizeof(rank),
  92. STARPU_EXECUTE_ON_NODE, node, 0);
  93. break;
  94. }
  95. }
  96. if (task)
  97. {
  98. ret = starpu_task_submit(task);
  99. if (ret == -ENODEV) goto enodev;
  100. STARPU_CHECK_RETURN_VALUE(ret, "starpu_task_submit");
  101. }
  102. switch(data_array)
  103. {
  104. case 0:
  105. {
  106. starpu_mpi_task_post_build(MPI_COMM_WORLD, &mycodelet,
  107. STARPU_RW, data_handles[0], STARPU_R, data_handles[1],
  108. STARPU_EXECUTE_ON_NODE, node, 0);
  109. break;
  110. }
  111. case 1:
  112. {
  113. starpu_mpi_task_post_build(MPI_COMM_WORLD, &mycodelet,
  114. STARPU_DATA_ARRAY, data_handles, 2,
  115. STARPU_EXECUTE_ON_NODE, node, 0);
  116. break;
  117. }
  118. case 2:
  119. {
  120. starpu_mpi_task_post_build(MPI_COMM_WORLD, &mycodelet,
  121. STARPU_DATA_MODE_ARRAY, descrs, 2,
  122. STARPU_EXECUTE_ON_NODE, node, 0);
  123. break;
  124. }
  125. }
  126. break;
  127. }
  128. case 1:
  129. {
  130. switch(data_array)
  131. {
  132. case 0:
  133. {
  134. ret = starpu_mpi_task_insert(MPI_COMM_WORLD, &mycodelet,
  135. STARPU_RW, data_handles[0], STARPU_R, data_handles[1],
  136. STARPU_VALUE, &rank, sizeof(rank),
  137. STARPU_EXECUTE_ON_NODE, node, 0);
  138. break;
  139. }
  140. case 1:
  141. {
  142. ret = starpu_mpi_task_insert(MPI_COMM_WORLD, &mycodelet,
  143. STARPU_DATA_ARRAY, data_handles, 2,
  144. STARPU_VALUE, &rank, sizeof(rank),
  145. STARPU_EXECUTE_ON_NODE, node, 0);
  146. break;
  147. }
  148. case 2:
  149. {
  150. ret = starpu_mpi_task_insert(MPI_COMM_WORLD, &mycodelet,
  151. STARPU_DATA_MODE_ARRAY, descrs, 2,
  152. STARPU_VALUE, &rank, sizeof(rank),
  153. STARPU_EXECUTE_ON_NODE, node, 0);
  154. break;
  155. }
  156. }
  157. STARPU_CHECK_RETURN_VALUE(ret, "starpu_mpi_task_insert");
  158. break;
  159. }
  160. }
  161. starpu_task_wait_for_all();
  162. enodev:
  163. for(i=0; i<2; i++)
  164. {
  165. starpu_data_unregister(data_handles[i]);
  166. }
  167. ok = 1;
  168. if (rank <= 1)
  169. {
  170. for(i=0; i<2; i++)
  171. {
  172. ok = ok && (x[i] == after[rank*2+i]);
  173. FPRINTF_MPI(stderr, "after computation x[%d] = %d, should be %d\n", i, x[i], after[rank*2+i]);
  174. }
  175. FPRINTF_MPI(stderr, "result is %s\n", ok?"CORRECT":"NOT CORRECT");
  176. }
  177. nodata:
  178. MPI_Barrier(MPI_COMM_WORLD);
  179. starpu_mpi_shutdown();
  180. starpu_shutdown();
  181. return ret == -ENODEV ? ret : !ok;
  182. }
  183. int main(int argc, char **argv)
  184. {
  185. int rank;
  186. int global_ret, ret;
  187. int before[4] = {10, 20, 11, 22};
  188. int after_node[2][4] = {{220, 20, 11, 22}, {220, 20, 11, 22}};
  189. int node, insert_task, data_array;
  190. MPI_Init(&argc, &argv);
  191. MPI_Comm_rank(MPI_COMM_WORLD, &rank);
  192. global_ret = 0;
  193. for(node=0 ; node<=1 ; node++)
  194. {
  195. for(insert_task=0 ; insert_task<=1 ; insert_task++)
  196. {
  197. for(data_array=0 ; data_array<=2 ; data_array++)
  198. {
  199. ret = test(rank, node, before, after_node[node], insert_task, data_array);
  200. if (ret == -ENODEV || ret) global_ret = ret;
  201. }
  202. }
  203. }
  204. end:
  205. MPI_Finalize();
  206. return global_ret==-ENODEV?STARPU_TEST_SKIPPED:global_ret;
  207. }