tasks_overhead.c 6.9 KB

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