tasks_overhead.c 8.2 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266
  1. /* StarPU --- Runtime system for heterogeneous multicore architectures.
  2. *
  3. * Copyright (C) 2009-2011,2013,2014,2016,2020 Université de Bordeaux
  4. * Copyright (C) 2013 Inria
  5. * Copyright (C) 2010-2013,2015-2017 CNRS
  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. #include <stdio.h>
  19. #include <unistd.h>
  20. #include <starpu.h>
  21. #include "../helper.h"
  22. /*
  23. * Measure the submission time and execution time of asynchronous tasks
  24. */
  25. starpu_data_handle_t data_handles[8];
  26. float *buffers[8];
  27. #ifdef STARPU_QUICK_CHECK
  28. static unsigned ntasks = 128;
  29. #else
  30. static unsigned ntasks = 65536;
  31. #endif
  32. static unsigned nbuffers = 0;
  33. #define BUFFERSIZE 16
  34. struct starpu_task *tasks;
  35. void dummy_func(void *descr[], void *arg)
  36. {
  37. (void)descr;
  38. (void)arg;
  39. }
  40. static struct starpu_codelet dummy_codelet =
  41. {
  42. .cpu_funcs = {dummy_func},
  43. .cuda_funcs = {dummy_func},
  44. .opencl_funcs = {dummy_func},
  45. .cpu_funcs_name = {"dummy_func"},
  46. .model = NULL,
  47. .nbuffers = 0,
  48. .modes = {STARPU_RW, STARPU_RW, STARPU_RW, STARPU_RW, STARPU_RW, STARPU_RW, STARPU_RW, STARPU_RW}
  49. };
  50. static
  51. int inject_one_task(void)
  52. {
  53. struct starpu_task *task = starpu_task_create();
  54. task->cl = &dummy_codelet;
  55. task->cl_arg = NULL;
  56. task->callback_func = NULL;
  57. task->synchronous = 1;
  58. int ret;
  59. ret = starpu_task_submit(task);
  60. return ret;
  61. }
  62. static void parse_args(int argc, char **argv)
  63. {
  64. int c;
  65. while ((c = getopt(argc, argv, "i:b:h")) != -1)
  66. switch(c)
  67. {
  68. case 'i':
  69. ntasks = atoi(optarg);
  70. break;
  71. case 'b':
  72. nbuffers = atoi(optarg);
  73. dummy_codelet.nbuffers = nbuffers;
  74. break;
  75. case 'h':
  76. fprintf(stderr, "Usage: %s [-i ntasks] [-b nbuffers] [-h]\n", argv[0]);
  77. break;
  78. }
  79. }
  80. int main(int argc, char **argv)
  81. {
  82. int ret;
  83. unsigned i;
  84. double timing_submit;
  85. double start_submit;
  86. double end_submit;
  87. double timing_exec;
  88. double start_exec;
  89. double end_exec;
  90. struct starpu_conf conf;
  91. starpu_conf_init(&conf);
  92. conf.ncpus = 2;
  93. parse_args(argc, argv);
  94. ret = starpu_initialize(&conf, &argc, &argv);
  95. if (ret == -ENODEV) return STARPU_TEST_SKIPPED;
  96. STARPU_CHECK_RETURN_VALUE(ret, "starpu_init");
  97. unsigned buffer;
  98. for (buffer = 0; buffer < nbuffers; buffer++)
  99. {
  100. starpu_malloc((void**)&buffers[buffer], BUFFERSIZE*sizeof(float));
  101. starpu_vector_data_register(&data_handles[buffer], STARPU_MAIN_RAM, (uintptr_t)buffers[buffer], BUFFERSIZE, sizeof(float));
  102. }
  103. fprintf(stderr, "#tasks : %u\n#buffers : %u\n", ntasks, nbuffers);
  104. /* submit tasks (but don't execute them yet !) */
  105. tasks = (struct starpu_task *) calloc(1, ntasks*sizeof(struct starpu_task));
  106. for (i = 0; i < ntasks; i++)
  107. {
  108. starpu_task_init(&tasks[i]);
  109. tasks[i].callback_func = NULL;
  110. tasks[i].cl = &dummy_codelet;
  111. tasks[i].cl_arg = NULL;
  112. tasks[i].synchronous = 0;
  113. tasks[i].use_tag = 1;
  114. tasks[i].tag_id = (starpu_tag_t)i;
  115. /* we have 8 buffers at most */
  116. for (buffer = 0; buffer < nbuffers; buffer++)
  117. {
  118. tasks[i].handles[buffer] = data_handles[buffer];
  119. }
  120. }
  121. tasks[ntasks-1].detach = 0;
  122. start_submit = starpu_timing_now();
  123. if (nbuffers)
  124. {
  125. /* Data dependency, just submit them all */
  126. for (i = 0; i < ntasks; i++)
  127. {
  128. ret = starpu_task_submit(&tasks[i]);
  129. if (ret == -ENODEV) goto enodev;
  130. STARPU_CHECK_RETURN_VALUE(ret, "starpu_task_submit");
  131. }
  132. }
  133. else
  134. {
  135. /* No data dependency, we have to introduce dependencies by hand */
  136. for (i = 1; i < ntasks; i++)
  137. {
  138. starpu_tag_declare_deps((starpu_tag_t)i, 1, (starpu_tag_t)(i-1));
  139. ret = starpu_task_submit(&tasks[i]);
  140. if (ret == -ENODEV) goto enodev;
  141. STARPU_CHECK_RETURN_VALUE(ret, "starpu_task_submit");
  142. }
  143. /* submit the first task */
  144. ret = starpu_task_submit(&tasks[0]);
  145. if (ret == -ENODEV) goto enodev;
  146. STARPU_CHECK_RETURN_VALUE(ret, "starpu_task_submit");
  147. }
  148. end_submit = starpu_timing_now();
  149. /* wait for the execution of the tasks */
  150. start_exec = starpu_timing_now();
  151. ret = starpu_task_wait(&tasks[ntasks-1]);
  152. STARPU_CHECK_RETURN_VALUE(ret, "starpu_tag_wait");
  153. end_exec = starpu_timing_now();
  154. starpu_task_wait_for_all();
  155. for (i = 0; i < ntasks; i++)
  156. starpu_task_clean(&tasks[i]);
  157. for (buffer = 0; buffer < nbuffers; buffer++)
  158. starpu_data_unregister(data_handles[buffer]);
  159. timing_submit = end_submit - start_submit;
  160. timing_exec = end_exec - start_exec;
  161. fprintf(stderr, "Total submit: %f secs\n", timing_submit/1000000);
  162. fprintf(stderr, "Per task submit: %f usecs\n", timing_submit/ntasks);
  163. fprintf(stderr, "\n");
  164. fprintf(stderr, "Total execution: %f secs\n", timing_exec/1000000);
  165. fprintf(stderr, "Per task execution: %f usecs\n", timing_exec/ntasks);
  166. fprintf(stderr, "\n");
  167. fprintf(stderr, "Total: %f secs\n", (timing_submit+timing_exec)/1000000);
  168. fprintf(stderr, "Per task: %f usecs\n", (timing_submit+timing_exec)/ntasks);
  169. {
  170. char *output_dir = getenv("STARPU_BENCH_DIR");
  171. char *bench_id = getenv("STARPU_BENCH_ID");
  172. if (output_dir && bench_id)
  173. {
  174. char number[1+sizeof(nbuffers)*3+1];
  175. const char *numberp;
  176. char file[1024];
  177. FILE *f;
  178. if (nbuffers)
  179. {
  180. snprintf(number, sizeof(number), "_%u", nbuffers);
  181. numberp = number;
  182. }
  183. else
  184. numberp = "";
  185. snprintf(file, sizeof(file), "%s/tasks_overhead_total_submit%s.dat", output_dir, numberp);
  186. f = fopen(file, "a");
  187. fprintf(f, "%s\t%f\n", bench_id, timing_submit/1000000);
  188. fclose(f);
  189. snprintf(file, sizeof(file), "%s/tasks_overhead_per_task_submit%s.dat", output_dir, numberp);
  190. f = fopen(file, "a");
  191. fprintf(f, "%s\t%f\n", bench_id, timing_submit/ntasks);
  192. fclose(f);
  193. snprintf(file, sizeof(file), "%s/tasks_overhead_total_execution%s.dat", output_dir, numberp);
  194. f = fopen(file, "a");
  195. fprintf(f, "%s\t%f\n", bench_id, timing_exec/1000000);
  196. fclose(f);
  197. snprintf(file, sizeof(file), "%s/tasks_overhead_per_task_execution%s.dat", output_dir, numberp);
  198. f = fopen(file, "a");
  199. fprintf(f, "%s\t%f\n", bench_id, timing_exec/ntasks);
  200. fclose(f);
  201. snprintf(file, sizeof(file), "%s/tasks_overhead_total_submit_execution%s.dat", output_dir, numberp);
  202. f = fopen(file, "a");
  203. fprintf(f, "%s\t%f\n", bench_id, (timing_submit+timing_exec)/1000000);
  204. fclose(f);
  205. snprintf(file, sizeof(file), "%s/tasks_overhead_per_task_submit_execution%s.dat", output_dir, numberp);
  206. f = fopen(file, "a");
  207. fprintf(f, "%s\t%f\n", bench_id, (timing_submit+timing_exec)/ntasks);
  208. fclose(f);
  209. }
  210. }
  211. starpu_shutdown();
  212. free(tasks);
  213. return EXIT_SUCCESS;
  214. enodev:
  215. fprintf(stderr, "WARNING: No one can execute this task\n");
  216. /* yes, we do not perform the computation but we did detect that no one
  217. * could perform the kernel, so this is not an error from StarPU */
  218. starpu_shutdown();
  219. free(tasks);
  220. return STARPU_TEST_SKIPPED;
  221. }