tasks_overhead.c 7.0 KB

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