test_arbiter.cpp 6.1 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217
  1. /* StarPU --- Runtime system for heterogeneous multicore architectures.
  2. *
  3. * Copyright (C) 2015-2020 Université de Bordeaux, CNRS (LaBRI UMR 5800), Inria
  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. /*
  17. * for i from 0 to nbA
  18. * insert task handles[i] in STARPU_RW|STARPU_COMMUTE
  19. * for j from 0 to nbA
  20. * if i != j
  21. insert task handles[i] in STARPU_RW|STARPU_COMMUTE, and handles[j] in STARPU_RW|STARPU_COMMUTE
  22. */
  23. // @FUSE_STARPU
  24. #include <starpu.h>
  25. #include "../helper.h"
  26. #include <vector>
  27. #include <unistd.h>
  28. #ifdef STARPU_QUICK_CHECK
  29. #define SLEEP_SLOW 6000
  30. #define SLEEP_FAST 1000
  31. #elif !defined(STARPU_LONG_CHECK)
  32. #define SLEEP_SLOW 60000
  33. #define SLEEP_FAST 10000
  34. #else
  35. #define SLEEP_SLOW 600000
  36. #define SLEEP_FAST 100000
  37. #endif
  38. static unsigned nb, nb_slow;
  39. void callback(void * /*buffers*/[], void * /*cl_arg*/)
  40. {
  41. unsigned val;
  42. val = STARPU_ATOMIC_ADD(&nb, 1);
  43. FPRINTF(stdout,"callback in (%u)\n", val); fflush(stdout);
  44. usleep(SLEEP_FAST);
  45. val = STARPU_ATOMIC_ADD(&nb, -1);
  46. FPRINTF(stdout,"callback out (%u)\n", val); fflush(stdout);
  47. }
  48. void callback_slow(void * /*buffers*/[], void * /*cl_arg*/)
  49. {
  50. unsigned val;
  51. val = STARPU_ATOMIC_ADD(&nb_slow, 1);
  52. FPRINTF(stdout,"callback_slow in (%u)\n", val); fflush(stdout);
  53. usleep(SLEEP_SLOW);
  54. val = STARPU_ATOMIC_ADD(&nb_slow, -1);
  55. FPRINTF(stdout,"callback_slow out (%u)\n", val); fflush(stdout);
  56. }
  57. int main(int /*argc*/, char** /*argv*/)
  58. {
  59. int ret;
  60. struct starpu_conf conf;
  61. starpu_arbiter_t arbiter, arbiter2;
  62. ret = starpu_conf_init(&conf);
  63. STARPU_ASSERT(ret == 0);
  64. //conf.ncpus = 1;//// 4
  65. ret = starpu_init(&conf);
  66. if (ret == -ENODEV) return STARPU_TEST_SKIPPED;
  67. STARPU_ASSERT(ret == 0);
  68. FPRINTF(stdout, "Max Thread %u\n", starpu_worker_get_count());
  69. //////////////////////////////////////////////////////
  70. starpu_codelet normalCodelete;
  71. {
  72. memset(&normalCodelete, 0, sizeof(normalCodelete));
  73. normalCodelete.where = STARPU_CPU;
  74. normalCodelete.cpu_funcs[0] = callback;
  75. normalCodelete.nbuffers = 2;
  76. normalCodelete.modes[0] = starpu_data_access_mode(STARPU_RW|STARPU_COMMUTE);
  77. normalCodelete.modes[1] = starpu_data_access_mode(STARPU_RW|STARPU_COMMUTE);
  78. normalCodelete.name = "normalCodelete";
  79. }
  80. starpu_codelet slowCodelete;
  81. {
  82. memset(&slowCodelete, 0, sizeof(slowCodelete));
  83. slowCodelete.where = STARPU_CPU;
  84. slowCodelete.cpu_funcs[0] = callback_slow;
  85. slowCodelete.nbuffers = 1;
  86. slowCodelete.modes[0] = starpu_data_access_mode (STARPU_RW|STARPU_COMMUTE);
  87. slowCodelete.name = "slowCodelete";
  88. }
  89. //////////////////////////////////////////////////////
  90. //////////////////////////////////////////////////////
  91. ///const int nbA = 3;
  92. const int nbA = 10;
  93. FPRINTF(stdout, "Nb A = %d\n", nbA);
  94. std::vector<starpu_data_handle_t> handleA(nbA);
  95. std::vector<int> dataA(nbA);
  96. arbiter = starpu_arbiter_create();
  97. arbiter2 = starpu_arbiter_create();
  98. for(int idx = 0 ; idx < nbA ; ++idx)
  99. {
  100. dataA[idx] = idx;
  101. }
  102. for(int idxHandle = 0 ; idxHandle < nbA ; ++idxHandle)
  103. {
  104. starpu_variable_data_register(&handleA[idxHandle], 0, (uintptr_t)&dataA[idxHandle], sizeof(dataA[idxHandle]));
  105. starpu_data_assign_arbiter(handleA[idxHandle], arbiter);
  106. }
  107. //////////////////////////////////////////////////////
  108. //////////////////////////////////////////////////////
  109. FPRINTF(stdout,"Submit tasks\n");
  110. for(int idxHandleA1 = 0 ; idxHandleA1 < nbA ; ++idxHandleA1)
  111. {
  112. ret = starpu_task_insert(&slowCodelete,
  113. (STARPU_RW|STARPU_COMMUTE), handleA[idxHandleA1],
  114. 0);
  115. if (ret == -ENODEV) goto out;
  116. for(int idxHandleA2 = 0 ; idxHandleA2 < nbA ; ++idxHandleA2)
  117. {
  118. if(idxHandleA1 != idxHandleA2)
  119. {
  120. ret = starpu_task_insert(&normalCodelete,
  121. (STARPU_RW|STARPU_COMMUTE), handleA[idxHandleA1],
  122. (STARPU_RW|STARPU_COMMUTE), handleA[idxHandleA2],
  123. 0);
  124. if (ret == -ENODEV) goto out;
  125. }
  126. }
  127. }
  128. //////////////////////////////////////////////////////
  129. FPRINTF(stdout,"Wait task\n");
  130. starpu_task_wait_for_all();
  131. //////////////////////////////////////////////////////
  132. FPRINTF(stdout,"Release data\n");
  133. for(int idxHandle = 0 ; idxHandle < nbA ; ++idxHandle)
  134. {
  135. starpu_data_unregister(handleA[idxHandle]);
  136. }
  137. //////////////////////////////////////////////////////
  138. FPRINTF(stdout,"Proceed gain, with several arbiters\n");
  139. for(int idxHandle = 0 ; idxHandle < nbA ; ++idxHandle)
  140. {
  141. starpu_variable_data_register(&handleA[idxHandle], 0, (uintptr_t)&dataA[idxHandle], sizeof(dataA[idxHandle]));
  142. starpu_data_assign_arbiter(handleA[idxHandle], (idxHandle%2)?arbiter:arbiter2);
  143. }
  144. //////////////////////////////////////////////////////
  145. //////////////////////////////////////////////////////
  146. FPRINTF(stdout,"Submit tasks\n");
  147. for(int idxHandleA1 = 0 ; idxHandleA1 < nbA ; ++idxHandleA1)
  148. {
  149. ret = starpu_task_insert(&slowCodelete,
  150. (STARPU_RW|STARPU_COMMUTE), handleA[idxHandleA1],
  151. 0);
  152. if (ret == -ENODEV) goto out;
  153. for(int idxHandleA2 = 0 ; idxHandleA2 < nbA ; ++idxHandleA2)
  154. {
  155. if(idxHandleA1 != idxHandleA2)
  156. {
  157. ret = starpu_task_insert(&normalCodelete,
  158. (STARPU_RW|STARPU_COMMUTE), handleA[idxHandleA1],
  159. (STARPU_RW|STARPU_COMMUTE), handleA[idxHandleA2],
  160. 0);
  161. if (ret == -ENODEV) goto out;
  162. }
  163. }
  164. }
  165. //////////////////////////////////////////////////////
  166. FPRINTF(stdout,"Wait task\n");
  167. out:
  168. starpu_task_wait_for_all();
  169. //////////////////////////////////////////////////////
  170. FPRINTF(stdout,"Release data\n");
  171. for(int idxHandle = 0 ; idxHandle < nbA ; ++idxHandle)
  172. {
  173. starpu_data_unregister(handleA[idxHandle]);
  174. }
  175. starpu_arbiter_destroy(arbiter);
  176. starpu_arbiter_destroy(arbiter2);
  177. //////////////////////////////////////////////////////
  178. FPRINTF(stdout,"Shutdown\n");
  179. starpu_shutdown();
  180. return 0;
  181. }