tasks_overhead.c 7.0 KB

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