subgraph_repeat.c 4.5 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159
  1. /* StarPU --- Runtime system for heterogeneous multicore architectures.
  2. *
  3. * Copyright (C) 2010-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. #include <starpu.h>
  17. #include <common/thread.h>
  18. #include "increment_codelet.h"
  19. #include "../helper.h"
  20. /*
  21. * Test that one can resubmit a whole task graph repeatedly
  22. */
  23. #ifdef STARPU_QUICK_CHECK
  24. static unsigned niter = 64;
  25. #else
  26. static unsigned niter = 16384;
  27. #endif
  28. /*
  29. *
  30. * /-->B--\
  31. * | |
  32. * -----> A D---\--->
  33. * ^ | | |
  34. * | \-->C--/ |
  35. * | |
  36. * \--------------/
  37. *
  38. * - {B, C} depend on A
  39. * - D depends on {B, C}
  40. * - A, B, C and D are resubmitted at the end of the loop (or not)
  41. */
  42. static struct starpu_task taskA, taskB, taskC, taskD;
  43. static unsigned loop_cnt = 0;
  44. static unsigned *check_cnt;
  45. static starpu_pthread_cond_t cond = STARPU_PTHREAD_COND_INITIALIZER;
  46. static starpu_pthread_mutex_t mutex = STARPU_PTHREAD_MUTEX_INITIALIZER;
  47. static void callback_task_D(void *arg)
  48. {
  49. (void)arg;
  50. STARPU_PTHREAD_MUTEX_LOCK(&mutex);
  51. loop_cnt++;
  52. if (loop_cnt == niter)
  53. {
  54. /* We are done */
  55. STARPU_PTHREAD_COND_SIGNAL(&cond);
  56. STARPU_PTHREAD_MUTEX_UNLOCK(&mutex);
  57. }
  58. else
  59. {
  60. int ret;
  61. STARPU_PTHREAD_MUTEX_UNLOCK(&mutex);
  62. /* Let's go for another iteration */
  63. ret = starpu_task_submit(&taskA); STARPU_CHECK_RETURN_VALUE(ret, "starpu_task_submit");
  64. ret = starpu_task_submit(&taskB); STARPU_CHECK_RETURN_VALUE(ret, "starpu_task_submit");
  65. ret = starpu_task_submit(&taskC); STARPU_CHECK_RETURN_VALUE(ret, "starpu_task_submit");
  66. ret = starpu_task_submit(&taskD); STARPU_CHECK_RETURN_VALUE(ret, "starpu_task_submit");
  67. }
  68. }
  69. int main(int argc, char **argv)
  70. {
  71. // unsigned i;
  72. // double timing;
  73. // double start;
  74. // double end;
  75. int ret;
  76. ret = starpu_initialize(NULL, &argc, &argv);
  77. if (ret == -ENODEV) return STARPU_TEST_SKIPPED;
  78. STARPU_CHECK_RETURN_VALUE(ret, "starpu_init");
  79. starpu_data_set_default_sequential_consistency_flag(0);
  80. starpu_malloc((void**)&check_cnt, sizeof(*check_cnt));
  81. *check_cnt = 0;
  82. starpu_data_handle_t check_data;
  83. starpu_variable_data_register(&check_data, STARPU_MAIN_RAM, (uintptr_t)check_cnt, sizeof(*check_cnt));
  84. starpu_task_init(&taskA);
  85. taskA.cl = &increment_codelet;
  86. taskA.handles[0] = check_data;
  87. starpu_task_init(&taskB);
  88. taskB.cl = &increment_codelet;
  89. taskB.handles[0] = check_data;
  90. starpu_task_init(&taskC);
  91. taskC.cl = &increment_codelet;
  92. taskC.handles[0] = check_data;
  93. starpu_task_init(&taskD);
  94. taskD.cl = &increment_codelet;
  95. taskD.callback_func = callback_task_D;
  96. taskD.handles[0] = check_data;
  97. starpu_task_declare_deps(&taskB, 1, &taskA);
  98. starpu_task_declare_deps(&taskC, 1, &taskA);
  99. starpu_task_declare_deps(&taskD, 2, &taskB, &taskC);
  100. ret = starpu_task_submit(&taskA); if (ret == -ENODEV) goto enodev; STARPU_CHECK_RETURN_VALUE(ret, "starpu_task_submit");
  101. ret = starpu_task_submit(&taskB); if (ret == -ENODEV) goto enodev; STARPU_CHECK_RETURN_VALUE(ret, "starpu_task_submit");
  102. ret = starpu_task_submit(&taskC); if (ret == -ENODEV) goto enodev; STARPU_CHECK_RETURN_VALUE(ret, "starpu_task_submit");
  103. ret = starpu_task_submit(&taskD); if (ret == -ENODEV) goto enodev; STARPU_CHECK_RETURN_VALUE(ret, "starpu_task_submit");
  104. starpu_do_schedule();
  105. /* Wait for the termination of all loops */
  106. STARPU_PTHREAD_MUTEX_LOCK(&mutex);
  107. if (loop_cnt < niter)
  108. STARPU_PTHREAD_COND_WAIT(&cond, &mutex);
  109. STARPU_PTHREAD_MUTEX_UNLOCK(&mutex);
  110. starpu_data_acquire(check_data, STARPU_R);
  111. starpu_data_release(check_data);
  112. STARPU_ASSERT(*check_cnt == (4*loop_cnt));
  113. starpu_free(check_cnt);
  114. starpu_data_unregister(check_data);
  115. starpu_task_wait_for_all();
  116. starpu_task_clean(&taskA);
  117. starpu_task_clean(&taskB);
  118. starpu_task_clean(&taskC);
  119. starpu_task_clean(&taskD);
  120. starpu_shutdown();
  121. return EXIT_SUCCESS;
  122. enodev:
  123. fprintf(stderr, "WARNING: No one can execute this task\n");
  124. /* yes, we do not perform the computation but we did detect that no one
  125. * could perform the kernel, so this is not an error from StarPU */
  126. starpu_data_unregister(check_data);
  127. starpu_shutdown();
  128. return STARPU_TEST_SKIPPED;
  129. }