insert_task_compute.c 5.3 KB

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