tasks_size_overhead.c 6.4 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253
  1. /* StarPU --- Runtime system for heterogeneous multicore architectures.
  2. *
  3. * Copyright (C) 2010-2014, 2016 Université de Bordeaux
  4. * Copyright (C) 2010, 2011, 2012, 2013, 2016 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. * This benchmark creates a thousand tasks of the same (small) duration, with
  23. * various number of cpus and various durations.
  24. *
  25. * Use ./tasks_size_overhead.sh to generate a plot of the result.
  26. *
  27. * Thanks Martin Tillenius for the idea.
  28. */
  29. #define START 4
  30. #define STOP 4096
  31. #ifdef STARPU_QUICK_CHECK
  32. #define FACTOR 8
  33. #else
  34. #define FACTOR 2
  35. #endif
  36. #ifdef STARPU_QUICK_CHECK
  37. static unsigned ntasks = 10;
  38. #else
  39. static unsigned ntasks = 1000;
  40. #endif
  41. static unsigned nbuffers = 0;
  42. static unsigned total_nbuffers = 0;
  43. struct starpu_task *tasks;
  44. void func(void *descr[] STARPU_ATTRIBUTE_UNUSED, void *arg)
  45. {
  46. double tv1, tv2;
  47. unsigned n = (uintptr_t)arg;
  48. long usec = 0;
  49. tv1 = starpu_timing_now();
  50. do
  51. {
  52. tv2 = starpu_timing_now();
  53. usec = tv2 - tv1;
  54. }
  55. while (usec < n);
  56. }
  57. static struct starpu_codelet codelet =
  58. {
  59. .cpu_funcs = {func},
  60. .nbuffers = 0,
  61. .modes = {STARPU_R, STARPU_R, STARPU_R, STARPU_R, STARPU_R, STARPU_R, STARPU_R, STARPU_R}
  62. };
  63. static void parse_args(int argc, char **argv)
  64. {
  65. int c;
  66. while ((c = getopt(argc, argv, "i:b:B:h")) != -1)
  67. switch(c)
  68. {
  69. case 'i':
  70. ntasks = atoi(optarg);
  71. break;
  72. case 'b':
  73. nbuffers = atoi(optarg);
  74. codelet.nbuffers = nbuffers;
  75. break;
  76. case 'B':
  77. total_nbuffers = atoi(optarg);
  78. break;
  79. case 'h':
  80. fprintf(stderr, "Usage: %s [-i ntasks] [-b nbuffers] [-B total_nbuffers] [-h]\n", argv[0]);
  81. exit(EXIT_SUCCESS);
  82. break;
  83. }
  84. }
  85. int main(int argc, char **argv)
  86. {
  87. int ret;
  88. unsigned i;
  89. unsigned size;
  90. unsigned totcpus, ncpus;
  91. double timing;
  92. double start;
  93. double end;
  94. struct starpu_conf conf;
  95. unsigned buffer;
  96. parse_args(argc, argv);
  97. /* Get number of CPUs */
  98. starpu_conf_init(&conf);
  99. conf.ncuda = 0;
  100. conf.nopencl = 0;
  101. ret = starpu_init(&conf);
  102. if (ret == -ENODEV) return STARPU_TEST_SKIPPED;
  103. STARPU_CHECK_RETURN_VALUE(ret, "starpu_init");
  104. totcpus = starpu_worker_get_count_by_type(STARPU_CPU_WORKER);
  105. starpu_shutdown();
  106. float *buffers[total_nbuffers?total_nbuffers:1];
  107. /* Allocate data */
  108. for (buffer = 0; buffer < total_nbuffers; buffer++)
  109. buffers[buffer] = (float *) malloc(16*sizeof(float));
  110. tasks = (struct starpu_task *) calloc(1, ntasks*sizeof(struct starpu_task));
  111. /* Emit headers and compute raw tasks speed */
  112. FPRINTF(stdout, "# tasks : %u buffers : %u total_nbuffers : %u\n", ntasks, nbuffers, total_nbuffers);
  113. FPRINTF(stdout, "# ncpus\t");
  114. for (size = START; size <= STOP; size *= FACTOR)
  115. FPRINTF(stdout, "%u iters(us)\ttotal(s)\t", size);
  116. FPRINTF(stdout, "\n");
  117. FPRINTF(stdout, "\"seq\"\t");
  118. for (size = START; size <= STOP; size *= FACTOR)
  119. {
  120. double dstart, dend;
  121. dstart = starpu_timing_now();
  122. for (i = 0; i < ntasks; i++)
  123. func(NULL, (void*) (uintptr_t) size);
  124. dend = starpu_timing_now();
  125. FPRINTF(stdout, "%.0f \t%f\t", (dend-dstart)/ntasks, (dend-dstart)/1000000);
  126. }
  127. FPRINTF(stdout, "\n");
  128. fflush(stdout);
  129. starpu_data_handle_t data_handles[total_nbuffers?total_nbuffers:1];
  130. /* For each number of cpus, benchmark */
  131. for (ncpus= 1; ncpus <= totcpus; ncpus++)
  132. {
  133. FPRINTF(stdout, "%u\t", ncpus);
  134. fflush(stdout);
  135. conf.ncpus = ncpus;
  136. ret = starpu_init(&conf);
  137. if (ret == -ENODEV) return STARPU_TEST_SKIPPED;
  138. STARPU_CHECK_RETURN_VALUE(ret, "starpu_init");
  139. for (buffer = 0; buffer < total_nbuffers; buffer++)
  140. starpu_vector_data_register(&data_handles[buffer], STARPU_MAIN_RAM, (uintptr_t)buffers[buffer], 16, sizeof(float));
  141. for (size = START; size <= STOP; size *= FACTOR)
  142. {
  143. /* submit tasks */
  144. start = starpu_timing_now();
  145. for (i = 0; i < ntasks; i++)
  146. {
  147. starpu_data_handle_t *handles;
  148. starpu_task_init(&tasks[i]);
  149. tasks[i].callback_func = NULL;
  150. tasks[i].cl = &codelet;
  151. tasks[i].cl_arg = (void*) (uintptr_t) size;
  152. tasks[i].synchronous = 0;
  153. if (nbuffers > STARPU_NMAXBUFS)
  154. {
  155. tasks[i].dyn_handles = malloc(nbuffers * sizeof(*data_handles));
  156. handles = tasks[i].dyn_handles;
  157. tasks[i].dyn_modes = malloc(nbuffers * sizeof(*(tasks[i].dyn_modes)));
  158. for (buffer = 0; buffer < nbuffers; buffer++)
  159. tasks[i].dyn_modes[buffer] = STARPU_R;
  160. }
  161. else
  162. handles = tasks[i].handles;
  163. if (nbuffers >= total_nbuffers)
  164. for (buffer = 0; buffer < nbuffers; buffer++)
  165. handles[buffer] = data_handles[buffer%total_nbuffers];
  166. else
  167. for (buffer = 0; buffer < nbuffers; buffer++)
  168. handles[buffer] = data_handles[starpu_lrand48()%total_nbuffers];
  169. ret = starpu_task_submit(&tasks[i]);
  170. if (ret == -ENODEV) goto enodev;
  171. STARPU_CHECK_RETURN_VALUE(ret, "starpu_task");
  172. }
  173. ret = starpu_task_wait_for_all();
  174. STARPU_CHECK_RETURN_VALUE(ret, "starpu_task_wait_for_all");
  175. end = starpu_timing_now();
  176. for (i = 0; i < ntasks; i++)
  177. starpu_task_clean(&tasks[i]);
  178. timing = end - start;
  179. FPRINTF(stdout, "%u\t%f\t", size, timing/1000000);
  180. fflush(stdout);
  181. {
  182. char *output_dir = getenv("STARPU_BENCH_DIR");
  183. char *bench_id = getenv("STARPU_BENCH_ID");
  184. if (output_dir && bench_id)
  185. {
  186. char file[1024];
  187. FILE *f;
  188. snprintf(file, 1024, "%s/tasks_size_overhead_total.dat", output_dir);
  189. f = fopen(file, "a");
  190. fprintf(f, "%s\t%u\t%u\t%f\n", bench_id, ncpus, size, timing/1000000);
  191. fclose(f);
  192. }
  193. }
  194. }
  195. for (buffer = 0; buffer < total_nbuffers; buffer++)
  196. {
  197. starpu_data_unregister(data_handles[buffer]);
  198. }
  199. starpu_shutdown();
  200. FPRINTF(stdout, "\n");
  201. fflush(stdout);
  202. }
  203. free(tasks);
  204. return EXIT_SUCCESS;
  205. enodev:
  206. fprintf(stderr, "WARNING: No one can execute this task\n");
  207. /* yes, we do not perform the computation but we did detect that no one
  208. * could perform the kernel, so this is not an error from StarPU */
  209. starpu_shutdown();
  210. free(tasks);
  211. return STARPU_TEST_SKIPPED;
  212. }