test_arbiter.cpp 6.2 KB

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