insert_task_compute.c 5.2 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216
  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. FPRINTF_MPI("Testing with task_insert=%d - data_array=%d\n", task_insert, data_array);
  47. for(i=0 ; i<2 ; i++)
  48. {
  49. x[i] = before[rank*2+i];
  50. if (rank <= 1)
  51. FPRINTF_MPI("before computation x[%d] = %d\n", i, x[i]);
  52. starpu_variable_data_register(&data_handles[i], STARPU_MAIN_RAM, (uintptr_t)&x[i], sizeof(int));
  53. starpu_mpi_data_register(data_handles[i], i, i);
  54. descrs[i].handle = data_handles[i];
  55. }
  56. descrs[0].mode = STARPU_RW;
  57. descrs[1].mode = STARPU_R;
  58. switch(task_insert)
  59. {
  60. case 0:
  61. {
  62. struct starpu_task *task = NULL;
  63. switch(data_array)
  64. {
  65. case 0:
  66. {
  67. task = starpu_mpi_task_build(MPI_COMM_WORLD, &mycodelet,
  68. STARPU_RW, data_handles[0], STARPU_R, data_handles[1],
  69. STARPU_EXECUTE_ON_NODE, node, 0);
  70. break;
  71. }
  72. case 1:
  73. {
  74. task = starpu_mpi_task_build(MPI_COMM_WORLD, &mycodelet,
  75. STARPU_DATA_ARRAY, data_handles, 2,
  76. STARPU_EXECUTE_ON_NODE, node, 0);
  77. break;
  78. }
  79. case 2:
  80. {
  81. task = starpu_mpi_task_build(MPI_COMM_WORLD, &mycodelet,
  82. STARPU_DATA_MODE_ARRAY, descrs, 2,
  83. STARPU_EXECUTE_ON_NODE, node, 0);
  84. break;
  85. }
  86. }
  87. if (task)
  88. {
  89. ret = starpu_task_submit(task);
  90. if (ret == -ENODEV) goto enodev;
  91. STARPU_CHECK_RETURN_VALUE(ret, "starpu_task_submit");
  92. }
  93. switch(data_array)
  94. {
  95. case 0:
  96. {
  97. starpu_mpi_task_post_build(MPI_COMM_WORLD, &mycodelet,
  98. STARPU_RW, data_handles[0], STARPU_R, data_handles[1],
  99. STARPU_EXECUTE_ON_NODE, node, 0);
  100. break;
  101. }
  102. case 1:
  103. {
  104. starpu_mpi_task_post_build(MPI_COMM_WORLD, &mycodelet,
  105. STARPU_DATA_ARRAY, data_handles, 2,
  106. STARPU_EXECUTE_ON_NODE, node, 0);
  107. break;
  108. }
  109. case 2:
  110. {
  111. starpu_mpi_task_post_build(MPI_COMM_WORLD, &mycodelet,
  112. STARPU_DATA_MODE_ARRAY, descrs, 2,
  113. STARPU_EXECUTE_ON_NODE, node, 0);
  114. break;
  115. }
  116. }
  117. break;
  118. }
  119. case 1:
  120. {
  121. switch(data_array)
  122. {
  123. case 0:
  124. {
  125. ret = starpu_mpi_task_insert(MPI_COMM_WORLD, &mycodelet,
  126. STARPU_RW, data_handles[0], STARPU_R, data_handles[1],
  127. STARPU_EXECUTE_ON_NODE, node, 0);
  128. break;
  129. }
  130. case 1:
  131. {
  132. ret = starpu_mpi_task_insert(MPI_COMM_WORLD, &mycodelet,
  133. STARPU_DATA_ARRAY, data_handles, 2,
  134. STARPU_EXECUTE_ON_NODE, node, 0);
  135. break;
  136. }
  137. case 2:
  138. {
  139. ret = starpu_mpi_task_insert(MPI_COMM_WORLD, &mycodelet,
  140. STARPU_DATA_MODE_ARRAY, descrs, 2,
  141. STARPU_EXECUTE_ON_NODE, node, 0);
  142. break;
  143. }
  144. }
  145. STARPU_CHECK_RETURN_VALUE(ret, "starpu_mpi_task_insert");
  146. break;
  147. }
  148. }
  149. starpu_task_wait_for_all();
  150. enodev:
  151. for(i=0; i<2; i++)
  152. {
  153. starpu_data_unregister(data_handles[i]);
  154. }
  155. ok = 1;
  156. if (rank <= 1)
  157. {
  158. for(i=0; i<2; i++)
  159. {
  160. ok = ok && (x[i] == after[rank*2+i]);
  161. FPRINTF_MPI("after computation x[%d] = %d, should be %d\n", i, x[i], after[rank*2+i]);
  162. }
  163. FPRINTF_MPI("result is %s\n", ok?"CORRECT":"NOT CORRECT");
  164. }
  165. nodata:
  166. starpu_mpi_shutdown();
  167. starpu_shutdown();
  168. return ret == -ENODEV ? ret : !ok;
  169. }
  170. int main(int argc, char **argv)
  171. {
  172. int rank;
  173. int ret;
  174. int before[4] = {10, 20, 11, 22};
  175. int after_node[2][4] = {{220, 22, 11, 22}, {220, 20, 220, 22}};
  176. int node, insert_task, data_array;
  177. MPI_Init(&argc, &argv);
  178. MPI_Comm_rank(MPI_COMM_WORLD, &rank);
  179. for(node=0 ; node<=1 ; node++)
  180. {
  181. for(insert_task=0 ; insert_task<=1 ; insert_task++)
  182. {
  183. for(data_array=0 ; data_array<=2 ; data_array++)
  184. {
  185. ret = test(rank, node, before, after_node[node], insert_task, data_array);
  186. if (ret == -ENODEV || ret) goto end;
  187. }
  188. }
  189. }
  190. end:
  191. MPI_Finalize();
  192. return ret==-ENODEV?STARPU_TEST_SKIPPED:ret;
  193. }