tasks_overhead.c 6.9 KB

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