async_tasks_overhead.c 6.2 KB

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