async_tasks_overhead.c 5.0 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184
  1. /* StarPU --- Runtime system for heterogeneous multicore architectures.
  2. *
  3. * Copyright (C) 2010-2014 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 <stdio.h>
  18. #include <unistd.h>
  19. #include <starpu.h>
  20. #include "../helper.h"
  21. static unsigned ntasks = 65536;
  22. //static unsigned finished = 0;
  23. static double cumulated = 0.0;
  24. static double cumulated_push = 0.0;
  25. static double cumulated_pop = 0.0;
  26. void dummy_func(void *descr[] STARPU_ATTRIBUTE_UNUSED, void *arg STARPU_ATTRIBUTE_UNUSED)
  27. {
  28. }
  29. static struct starpu_codelet dummy_codelet =
  30. {
  31. .cpu_funcs = {dummy_func, NULL},
  32. .cuda_funcs = {dummy_func, NULL},
  33. .opencl_funcs = {dummy_func, NULL},
  34. .cpu_funcs_name = {"dummy_func", NULL},
  35. .model = NULL,
  36. .nbuffers = 0
  37. };
  38. //static void inject_one_task(void)
  39. //{
  40. // struct starpu_task *task = starpu_task_create();
  41. //
  42. // task->cl = &dummy_codelet;
  43. // task->cl_arg = NULL;
  44. // task->detach = 0;
  45. //
  46. // int ret = starpu_task_submit(task);
  47. // STARPU_ASSERT(!ret);
  48. //}
  49. static void usage(char **argv)
  50. {
  51. fprintf(stderr, "%s [-i ntasks] [-p sched_policy] [-h]\n", argv[0]);
  52. exit(-1);
  53. }
  54. static void parse_args(int argc, char **argv, struct starpu_conf *conf)
  55. {
  56. int c;
  57. while ((c = getopt(argc, argv, "i:p:h")) != -1)
  58. switch(c)
  59. {
  60. case 'i':
  61. ntasks = atoi(optarg);
  62. break;
  63. case 'p':
  64. conf->sched_policy_name = optarg;
  65. break;
  66. case 'h':
  67. usage(argv);
  68. break;
  69. }
  70. }
  71. int main(int argc, char **argv)
  72. {
  73. int ret;
  74. unsigned i;
  75. double timing;
  76. double start;
  77. double end;
  78. struct starpu_conf conf;
  79. starpu_conf_init(&conf);
  80. parse_args(argc, argv, &conf);
  81. ret = starpu_initialize(&conf, &argc, &argv);
  82. if (ret == -ENODEV) return STARPU_TEST_SKIPPED;
  83. STARPU_CHECK_RETURN_VALUE(ret, "starpu_init");
  84. starpu_profiling_status_set(STARPU_PROFILING_ENABLE);
  85. fprintf(stderr, "#tasks : %u\n", ntasks);
  86. /* Create an array of tasks */
  87. struct starpu_task **tasks = (struct starpu_task **) malloc(ntasks*sizeof(struct starpu_task *));
  88. for (i = 0; i < ntasks; i++)
  89. {
  90. struct starpu_task *task = starpu_task_create();
  91. task->cl = &dummy_codelet;
  92. task->cl_arg = NULL;
  93. task->detach = 0;
  94. tasks[i] = task;
  95. }
  96. start = starpu_timing_now();
  97. for (i = 0; i < ntasks; i++)
  98. {
  99. ret = starpu_task_submit(tasks[i]);
  100. if (ret == -ENODEV) goto enodev;
  101. STARPU_CHECK_RETURN_VALUE(ret, "starpu_task_submit");
  102. }
  103. ret = starpu_task_wait_for_all();
  104. STARPU_CHECK_RETURN_VALUE(ret, "starpu_task_wait_for_all");
  105. end = starpu_timing_now();
  106. /* Read profiling feedback */
  107. for (i = 0; i < ntasks; i++)
  108. {
  109. struct starpu_profiling_task_info *info;
  110. info = tasks[i]->profiling_info;
  111. double queued = starpu_timing_timespec_delay_us(&info->push_end_time, &info->pop_end_time);
  112. double length = starpu_timing_timespec_delay_us(&info->submit_time, &info->end_time);
  113. double push_duration = starpu_timing_timespec_delay_us(&info->push_start_time, &info->push_end_time);
  114. double pop_duration = starpu_timing_timespec_delay_us(&info->pop_start_time, &info->pop_end_time);
  115. starpu_task_destroy(tasks[i]);
  116. cumulated += (length - queued);
  117. cumulated_push += push_duration;
  118. cumulated_pop += pop_duration;
  119. }
  120. timing = end - start;
  121. fprintf(stderr, "Total: %f secs\n", timing/1000000);
  122. fprintf(stderr, "Per task: %f usecs\n", timing/ntasks);
  123. fprintf(stderr, "Per task (except scheduler): %f usecs\n", cumulated/ntasks);
  124. fprintf(stderr, "Per task (push): %f usecs\n", cumulated_push/ntasks);
  125. fprintf(stderr, "Per task (pop): %f usecs\n", cumulated_pop/ntasks);
  126. {
  127. char *output_dir = getenv("STARPU_BENCH_DIR");
  128. char *bench_id = getenv("STARPU_BENCH_ID");
  129. if (output_dir && bench_id)
  130. {
  131. char file[1024];
  132. FILE *f;
  133. sprintf(file, "%s/async_tasks_overhead_total.dat", output_dir);
  134. f = fopen(file, "a");
  135. fprintf(f, "%s\t%f\n", bench_id, timing/1000000);
  136. fclose(f);
  137. sprintf(file, "%s/async_tasks_overhead_per_task.dat", output_dir);
  138. f = fopen(file, "a");
  139. fprintf(f, "%s\t%f\n", bench_id, timing/ntasks);
  140. fclose(f);
  141. }
  142. }
  143. starpu_shutdown();
  144. free(tasks);
  145. return EXIT_SUCCESS;
  146. enodev:
  147. fprintf(stderr, "WARNING: No one can execute this task\n");
  148. /* yes, we do not perform the computation but we did detect that no one
  149. * could perform the kernel, so this is not an error from StarPU */
  150. starpu_shutdown();
  151. return STARPU_TEST_SKIPPED;
  152. }