tasks_size_overhead.c 8.8 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338
  1. /* StarPU --- Runtime system for heterogeneous multicore architectures.
  2. *
  3. * Copyright (C) 2012,2013 Inria
  4. * Copyright (C) 2010-2013,2015-2018 CNRS
  5. * Copyright (C) 2010-2014,2016,2017,2019 Université de Bordeaux
  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. * This benchmark creates a thousand tasks of the same (small) duration, with
  24. * various number of cpus and various durations.
  25. *
  26. * Use ./tasks_size_overhead.sh to generate a plot of the result.
  27. *
  28. * Thanks Martin Tillenius for the idea.
  29. */
  30. #define START 4
  31. #define STOP 4096
  32. #ifdef STARPU_QUICK_CHECK
  33. #define FACTOR 64
  34. #else
  35. #define FACTOR 2
  36. #endif
  37. #ifdef STARPU_QUICK_CHECK
  38. #define CPUSTEP 8
  39. #else
  40. #define CPUSTEP 1
  41. #endif
  42. #ifdef STARPU_QUICK_CHECK
  43. static unsigned ntasks = 1;
  44. #elif !defined(STARPU_LONG_CHECK)
  45. static unsigned ntasks = 64;
  46. #else
  47. static unsigned ntasks = 256;
  48. #endif
  49. static unsigned nbuffers = 0;
  50. static unsigned total_nbuffers = 0;
  51. static unsigned mincpus = 1, maxcpus, cpustep = CPUSTEP;
  52. static unsigned mintime = START, maxtime = STOP, factortime = FACTOR;
  53. struct starpu_task *tasks;
  54. void func(void *descr[], void *arg)
  55. {
  56. (void)descr;
  57. unsigned n = (uintptr_t)arg;
  58. long usec = 0;
  59. double tv1 = starpu_timing_now();
  60. do
  61. {
  62. double tv2 = starpu_timing_now();
  63. usec = tv2 - tv1;
  64. }
  65. while (usec < n);
  66. }
  67. double cost_function(struct starpu_task *t, struct starpu_perfmodel_arch *a, unsigned i)
  68. {
  69. (void) t; (void) i; (void) a;
  70. unsigned n = (uintptr_t) t->cl_arg;
  71. return n;
  72. }
  73. static struct starpu_perfmodel perf_model =
  74. {
  75. .type = STARPU_PER_ARCH,
  76. .arch_cost_function = cost_function,
  77. };
  78. static struct starpu_codelet codelet =
  79. {
  80. .cpu_funcs = {func},
  81. .nbuffers = 0,
  82. .modes = {STARPU_R, STARPU_R, STARPU_R, STARPU_R, STARPU_R, STARPU_R, STARPU_R, STARPU_R},
  83. .model = &perf_model,
  84. };
  85. static void parse_args(int argc, char **argv)
  86. {
  87. int c;
  88. while ((c = getopt(argc, argv, "i:b:B:c:C:s:t:T:f:h")) != -1)
  89. switch(c)
  90. {
  91. case 'i':
  92. ntasks = atoi(optarg);
  93. break;
  94. case 'b':
  95. nbuffers = atoi(optarg);
  96. codelet.nbuffers = nbuffers;
  97. break;
  98. case 'B':
  99. total_nbuffers = atoi(optarg);
  100. break;
  101. case 'c':
  102. mincpus = atoi(optarg);
  103. break;
  104. case 'C':
  105. maxcpus = atoi(optarg);
  106. break;
  107. case 's':
  108. cpustep = atoi(optarg);
  109. break;
  110. case 't':
  111. mintime = atoi(optarg);
  112. break;
  113. case 'T':
  114. maxtime = atoi(optarg);
  115. break;
  116. case 'f':
  117. factortime = atoi(optarg);
  118. break;
  119. case 'h':
  120. fprintf(stderr, "\
  121. Usage: %s [-h]\n\
  122. [-i ntasks] [-b nbuffers] [-B total_nbuffers]\n\
  123. [-c mincpus] [ -C maxcpus] [-s cpustep]\n\
  124. [-t mintime] [-T maxtime] [-f factortime]\n\n", argv[0]);
  125. fprintf(stderr,"\
  126. runs 'ntasks' tasks\n\
  127. - using 'nbuffers' data each, randomly among 'total_nbuffers' choices,\n\
  128. - with varying task durations, from 'mintime' to 'maxtime' (using 'factortime')\n\
  129. - on varying numbers of cpus, from 'mincpus' to 'maxcpus' (using 'cpustep')\n\
  130. \n\
  131. currently selected parameters: %u tasks using %u buffers among %u, from %uus to %uus (factor %u), from %u cpus to %u cpus (step %u)\n\
  132. ", ntasks, nbuffers, total_nbuffers, mintime, maxtime, factortime, mincpus, maxcpus, cpustep);
  133. exit(EXIT_SUCCESS);
  134. break;
  135. }
  136. }
  137. int main(int argc, char **argv)
  138. {
  139. int ret;
  140. unsigned i;
  141. unsigned size;
  142. unsigned ncpus;
  143. double timing;
  144. double start;
  145. double end;
  146. struct starpu_conf conf;
  147. unsigned buffer;
  148. char *starpu_sched = getenv("STARPU_SCHED");
  149. if (starpu_sched && !strcmp(starpu_sched, "pheft"))
  150. /* pheft does not run tasks in parallel, avoid burning time... */
  151. return STARPU_TEST_SKIPPED;
  152. /* Get number of CPUs */
  153. starpu_conf_init(&conf);
  154. conf.ncuda = 0;
  155. conf.nopencl = 0;
  156. #ifdef STARPU_SIMGRID
  157. /* This will get serialized, avoid spending too much time on it. */
  158. maxcpus = 2;
  159. #else
  160. ret = starpu_init(&conf);
  161. if (ret == -ENODEV) return STARPU_TEST_SKIPPED;
  162. STARPU_CHECK_RETURN_VALUE(ret, "starpu_init");
  163. maxcpus = starpu_worker_get_count_by_type(STARPU_CPU_WORKER);
  164. starpu_shutdown();
  165. #endif
  166. #ifdef STARPU_HAVE_UNSETENV
  167. /* That was useful to force the max number of cpus to use, but now we
  168. * want to make it vary */
  169. unsetenv("STARPU_NCPUS");
  170. unsetenv("STARPU_NCPU");
  171. #endif
  172. if (STARPU_RUNNING_ON_VALGRIND) {
  173. factortime *= 4;
  174. cpustep *= 4;
  175. }
  176. parse_args(argc, argv);
  177. float *buffers[total_nbuffers?total_nbuffers:1];
  178. /* Allocate data */
  179. for (buffer = 0; buffer < total_nbuffers; buffer++)
  180. buffers[buffer] = (float *) calloc(16, sizeof(float));
  181. tasks = (struct starpu_task *) calloc(1, ntasks*maxcpus*sizeof(struct starpu_task));
  182. /* Emit headers and compute raw tasks speed */
  183. FPRINTF(stdout, "# tasks : %u buffers : %u total_nbuffers : %u\n", ntasks, nbuffers, total_nbuffers);
  184. FPRINTF(stdout, "# ncpus\t");
  185. for (size = mintime; size <= maxtime; size *= factortime)
  186. FPRINTF(stdout, "%u iters(us)\ttotal(s)\t", size);
  187. FPRINTF(stdout, "\n");
  188. FPRINTF(stdout, "\"seq\"\t");
  189. for (size = mintime; size <= maxtime; size *= factortime)
  190. {
  191. double dstart, dend;
  192. dstart = starpu_timing_now();
  193. for (i = 0; i < ntasks; i++)
  194. func(NULL, (void*) (uintptr_t) size);
  195. dend = starpu_timing_now();
  196. FPRINTF(stdout, "%.0f \t%f\t", (dend-dstart)/ntasks, (dend-dstart)/1000000);
  197. }
  198. FPRINTF(stdout, "\n");
  199. fflush(stdout);
  200. starpu_data_handle_t data_handles[total_nbuffers?total_nbuffers:1];
  201. if (nbuffers && !total_nbuffers)
  202. {
  203. fprintf(stderr,"can not have %u buffers with %u total buffers\n", nbuffers, total_nbuffers);
  204. goto error;
  205. }
  206. /* For each number of cpus, benchmark */
  207. for (ncpus= mincpus; ncpus <= maxcpus; ncpus += cpustep)
  208. {
  209. FPRINTF(stdout, "%u\t", ncpus);
  210. fflush(stdout);
  211. conf.ncpus = ncpus;
  212. ret = starpu_init(&conf);
  213. if (ret == -ENODEV) return STARPU_TEST_SKIPPED;
  214. STARPU_CHECK_RETURN_VALUE(ret, "starpu_init");
  215. for (buffer = 0; buffer < total_nbuffers; buffer++)
  216. starpu_vector_data_register(&data_handles[buffer], STARPU_MAIN_RAM, (uintptr_t)buffers[buffer], 16, sizeof(float));
  217. for (size = mintime; size <= maxtime; size *= factortime)
  218. {
  219. /* submit tasks */
  220. start = starpu_timing_now();
  221. for (i = 0; i < ntasks * ncpus; i++)
  222. {
  223. starpu_data_handle_t *handles;
  224. starpu_task_init(&tasks[i]);
  225. tasks[i].callback_func = NULL;
  226. tasks[i].cl = &codelet;
  227. tasks[i].cl_arg = (void*) (uintptr_t) size;
  228. tasks[i].synchronous = 0;
  229. if (nbuffers > STARPU_NMAXBUFS)
  230. {
  231. tasks[i].dyn_handles = malloc(nbuffers * sizeof(*data_handles));
  232. handles = tasks[i].dyn_handles;
  233. tasks[i].dyn_modes = malloc(nbuffers * sizeof(tasks[i].dyn_modes[0]));
  234. for (buffer = 0; buffer < nbuffers; buffer++)
  235. tasks[i].dyn_modes[buffer] = STARPU_R;
  236. }
  237. else
  238. handles = tasks[i].handles;
  239. if (nbuffers >= total_nbuffers)
  240. for (buffer = 0; buffer < nbuffers; buffer++)
  241. handles[buffer] = data_handles[buffer%total_nbuffers];
  242. else
  243. for (buffer = 0; buffer < nbuffers; buffer++)
  244. handles[buffer] = data_handles[starpu_lrand48()%total_nbuffers];
  245. ret = starpu_task_submit(&tasks[i]);
  246. if (ret == -ENODEV) goto enodev;
  247. STARPU_CHECK_RETURN_VALUE(ret, "starpu_task");
  248. }
  249. ret = starpu_task_wait_for_all();
  250. STARPU_CHECK_RETURN_VALUE(ret, "starpu_task_wait_for_all");
  251. end = starpu_timing_now();
  252. for (i = 0; i < ntasks * ncpus; i++)
  253. starpu_task_clean(&tasks[i]);
  254. timing = end - start;
  255. FPRINTF(stdout, "%u\t%f\t", size, timing/ncpus/1000000);
  256. fflush(stdout);
  257. {
  258. char *output_dir = getenv("STARPU_BENCH_DIR");
  259. char *bench_id = getenv("STARPU_BENCH_ID");
  260. char *sched = getenv("STARPU_SCHED");
  261. if (output_dir && bench_id)
  262. {
  263. char file[1024];
  264. FILE *f;
  265. snprintf(file, sizeof(file), "%s/tasks_size_overhead_total%s%s.dat", output_dir, sched?"_":"", sched?sched:"");
  266. f = fopen(file, "a");
  267. fprintf(f, "%s\t%u\t%u\t%f\n", bench_id, ncpus, size, timing/1000000 /(ntasks*ncpus) *1000);
  268. fclose(f);
  269. }
  270. }
  271. }
  272. for (buffer = 0; buffer < total_nbuffers; buffer++)
  273. {
  274. starpu_data_unregister(data_handles[buffer]);
  275. }
  276. starpu_shutdown();
  277. FPRINTF(stdout, "\n");
  278. fflush(stdout);
  279. }
  280. free(tasks);
  281. return EXIT_SUCCESS;
  282. enodev:
  283. fprintf(stderr, "WARNING: No one can execute this task\n");
  284. /* yes, we do not perform the computation but we did detect that no one
  285. * could perform the kernel, so this is not an error from StarPU */
  286. error:
  287. starpu_shutdown();
  288. free(tasks);
  289. return STARPU_TEST_SKIPPED;
  290. }