async_tasks_overhead.c 6.2 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223
  1. /* StarPU --- Runtime system for heterogeneous multicore architectures.
  2. *
  3. * Copyright (C) 2009-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 <stdio.h>
  17. #include <unistd.h>
  18. #include <starpu.h>
  19. #include "../helper.h"
  20. /*
  21. * Measure the cost of submitting asynchronous tasks
  22. */
  23. starpu_data_handle_t data_handles[8];
  24. float *buffers[8];
  25. #ifdef STARPU_QUICK_CHECK
  26. static unsigned ntasks = 128;
  27. #else
  28. static unsigned ntasks = 65536;
  29. #endif
  30. static unsigned nbuffers = 0;
  31. #define BUFFERSIZE 16
  32. //static unsigned finished = 0;
  33. static double cumulated = 0.0;
  34. static double cumulated_push = 0.0;
  35. static double cumulated_pop = 0.0;
  36. void dummy_func(void *descr[], void *arg)
  37. {
  38. (void)descr;
  39. (void)arg;
  40. }
  41. static struct starpu_codelet dummy_codelet =
  42. {
  43. .cpu_funcs = {dummy_func},
  44. .cuda_funcs = {dummy_func},
  45. .opencl_funcs = {dummy_func},
  46. .cpu_funcs_name = {"dummy_func"},
  47. .model = NULL,
  48. .nbuffers = 0,
  49. .modes = {STARPU_RW, STARPU_RW, STARPU_RW, STARPU_RW, STARPU_RW, STARPU_RW, STARPU_RW, STARPU_RW}
  50. };
  51. static void usage(char **argv)
  52. {
  53. fprintf(stderr, "Usage: %s [-i ntasks] [-p sched_policy] [-b nbuffers] [-h]\n", argv[0]);
  54. exit(EXIT_FAILURE);
  55. }
  56. static void parse_args(int argc, char **argv, struct starpu_conf *conf)
  57. {
  58. int c;
  59. while ((c = getopt(argc, argv, "i:b:p:h")) != -1)
  60. switch(c)
  61. {
  62. case 'i':
  63. ntasks = atoi(optarg);
  64. break;
  65. case 'b':
  66. nbuffers = atoi(optarg);
  67. dummy_codelet.nbuffers = nbuffers;
  68. break;
  69. case 'p':
  70. conf->sched_policy_name = optarg;
  71. break;
  72. case 'h':
  73. usage(argv);
  74. break;
  75. }
  76. }
  77. int main(int argc, char **argv)
  78. {
  79. int ret;
  80. unsigned i;
  81. double timing;
  82. double start;
  83. double end;
  84. struct starpu_conf conf;
  85. starpu_conf_init(&conf);
  86. conf.ncpus = 2;
  87. parse_args(argc, argv, &conf);
  88. ret = starpu_initialize(&conf, &argc, &argv);
  89. if (ret == -ENODEV) return STARPU_TEST_SKIPPED;
  90. STARPU_CHECK_RETURN_VALUE(ret, "starpu_init");
  91. unsigned buffer;
  92. for (buffer = 0; buffer < nbuffers; buffer++)
  93. {
  94. starpu_malloc((void**)&buffers[buffer], BUFFERSIZE*sizeof(float));
  95. starpu_vector_data_register(&data_handles[buffer], STARPU_MAIN_RAM, (uintptr_t)buffers[buffer], BUFFERSIZE, sizeof(float));
  96. }
  97. starpu_profiling_status_set(STARPU_PROFILING_ENABLE);
  98. fprintf(stderr, "#tasks : %u\n#buffers : %u\n", ntasks, nbuffers);
  99. /* Create an array of tasks */
  100. struct starpu_task **tasks = (struct starpu_task **) malloc(ntasks*sizeof(struct starpu_task *));
  101. for (i = 0; i < ntasks; i++)
  102. {
  103. struct starpu_task *task = starpu_task_create();
  104. task->cl = &dummy_codelet;
  105. task->detach = 0;
  106. /* we have 8 buffers at most */
  107. for (buffer = 0; buffer < nbuffers; buffer++)
  108. {
  109. task->handles[buffer] = data_handles[buffer];
  110. }
  111. tasks[i] = task;
  112. }
  113. start = starpu_timing_now();
  114. for (i = 0; i < ntasks; i++)
  115. {
  116. ret = starpu_task_submit(tasks[i]);
  117. if (ret == -ENODEV) goto enodev;
  118. STARPU_CHECK_RETURN_VALUE(ret, "starpu_task_submit");
  119. }
  120. ret = starpu_task_wait_for_all();
  121. STARPU_CHECK_RETURN_VALUE(ret, "starpu_task_wait_for_all");
  122. end = starpu_timing_now();
  123. /* Read profiling feedback */
  124. for (i = 0; i < ntasks; i++)
  125. {
  126. struct starpu_profiling_task_info *info;
  127. info = tasks[i]->profiling_info;
  128. double queued = starpu_timing_timespec_delay_us(&info->push_end_time, &info->pop_end_time);
  129. double length = starpu_timing_timespec_delay_us(&info->submit_time, &info->end_time);
  130. double push_duration = starpu_timing_timespec_delay_us(&info->push_start_time, &info->push_end_time);
  131. double pop_duration = starpu_timing_timespec_delay_us(&info->pop_start_time, &info->pop_end_time);
  132. starpu_task_destroy(tasks[i]);
  133. cumulated += (length - queued);
  134. cumulated_push += push_duration;
  135. cumulated_pop += pop_duration;
  136. }
  137. timing = end - start;
  138. fprintf(stderr, "Total: %f secs\n", timing/1000000);
  139. fprintf(stderr, "Per task: %f usecs\n", timing/ntasks);
  140. fprintf(stderr, "Per task (except scheduler): %f usecs\n", cumulated/ntasks);
  141. fprintf(stderr, "Per task (push): %f usecs\n", cumulated_push/ntasks);
  142. fprintf(stderr, "Per task (pop): %f usecs\n", cumulated_pop/ntasks);
  143. {
  144. char *output_dir = getenv("STARPU_BENCH_DIR");
  145. char *bench_id = getenv("STARPU_BENCH_ID");
  146. if (output_dir && bench_id)
  147. {
  148. char number[1+sizeof(nbuffers)*3+1];
  149. const char *numberp;
  150. char file[1024];
  151. FILE *f;
  152. if (nbuffers)
  153. {
  154. snprintf(number, sizeof(number), "_%u", nbuffers);
  155. numberp = number;
  156. }
  157. else
  158. numberp = "";
  159. snprintf(file, sizeof(file), "%s/async_tasks_overhead_total%s.dat", output_dir, numberp);
  160. f = fopen(file, "a");
  161. fprintf(f, "%s\t%f\n", bench_id, timing/1000000);
  162. fclose(f);
  163. snprintf(file, sizeof(file), "%s/async_tasks_overhead_per_task%s.dat", output_dir, numberp);
  164. f = fopen(file, "a");
  165. fprintf(f, "%s\t%f\n", bench_id, timing/ntasks);
  166. fclose(f);
  167. }
  168. }
  169. for (buffer = 0; buffer < nbuffers; buffer++)
  170. {
  171. starpu_data_unregister(data_handles[buffer]);
  172. starpu_free((void*)buffers[buffer]);
  173. }
  174. starpu_shutdown();
  175. free(tasks);
  176. return EXIT_SUCCESS;
  177. enodev:
  178. fprintf(stderr, "WARNING: No one can execute this task\n");
  179. /* yes, we do not perform the computation but we did detect that no one
  180. * could perform the kernel, so this is not an error from StarPU */
  181. starpu_shutdown();
  182. free(tasks);
  183. return STARPU_TEST_SKIPPED;
  184. }