tasks_size_overhead.c 6.3 KB

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