stencil.c 9.4 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386
  1. /* StarPU --- Runtime system for heterogeneous multicore architectures.
  2. *
  3. * Copyright (C) 2010-2020 Université de Bordeaux, CNRS (LaBRI UMR 5800), Inria
  4. *
  5. * StarPU is free software; you can redistribute it and/or modify
  6. * it under the terms of the GNU Lesser General Public License as published by
  7. * the Free Software Foundation; either version 2.1 of the License, or (at
  8. * your option) any later version.
  9. *
  10. * StarPU is distributed in the hope that it will be useful, but
  11. * WITHOUT ANY WARRANTY; without even the implied warranty of
  12. * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.
  13. *
  14. * See the GNU Lesser General Public License in COPYING.LGPL for more details.
  15. */
  16. #include "stencil.h"
  17. #ifdef STARPU_HAVE_VALGRIND_H
  18. #include <valgrind/valgrind.h>
  19. #endif
  20. /* Main application */
  21. /* default parameter values */
  22. static unsigned bind_tasks = 0;
  23. static unsigned ticks = 1000;
  24. #ifdef STARPU_QUICK_CHECK
  25. static unsigned niter = 4;
  26. #define SIZE 16
  27. #define NBZ 8
  28. #else
  29. static unsigned niter = 32;
  30. #define SIZE 128
  31. #define NBZ 64
  32. #endif
  33. /* Problem size */
  34. static unsigned sizex = SIZE;
  35. static unsigned sizey = SIZE;
  36. static unsigned sizez = NBZ*SIZE;
  37. /* Number of blocks (scattered over the different MPI processes) */
  38. unsigned nbz = NBZ;
  39. /*
  40. * Initialization
  41. */
  42. unsigned get_bind_tasks(void)
  43. {
  44. return bind_tasks;
  45. }
  46. unsigned get_nbz(void)
  47. {
  48. return nbz;
  49. }
  50. unsigned get_niter(void)
  51. {
  52. return niter;
  53. }
  54. unsigned get_ticks(void)
  55. {
  56. return ticks;
  57. }
  58. static void parse_args(int argc, char **argv)
  59. {
  60. int i;
  61. for (i = 1; i < argc; i++)
  62. {
  63. if (strcmp(argv[i], "-b") == 0)
  64. {
  65. bind_tasks = 1;
  66. }
  67. if (strcmp(argv[i], "-nbz") == 0)
  68. {
  69. nbz = atoi(argv[++i]);
  70. }
  71. if (strcmp(argv[i], "-sizex") == 0)
  72. {
  73. sizex = atoi(argv[++i]);
  74. }
  75. if (strcmp(argv[i], "-sizey") == 0)
  76. {
  77. sizey = atoi(argv[++i]);
  78. }
  79. if (strcmp(argv[i], "-sizez") == 0)
  80. {
  81. sizez = atoi(argv[++i]);
  82. }
  83. if (strcmp(argv[i], "-niter") == 0)
  84. {
  85. niter = atoi(argv[++i]);
  86. }
  87. if (strcmp(argv[i], "-ticks") == 0)
  88. {
  89. ticks = atoi(argv[++i]);
  90. }
  91. if (strcmp(argv[i], "-h") == 0 || strcmp(argv[i], "--help") == 0)
  92. {
  93. fprintf(stderr, "Usage : %s [options...]\n", argv[0]);
  94. fprintf(stderr, "\n");
  95. fprintf(stderr, "Options:\n");
  96. fprintf(stderr, "-b bind tasks on CPUs/GPUs\n");
  97. fprintf(stderr, "-nbz <n> Number of blocks on Z axis (%u by default)\n", nbz);
  98. fprintf(stderr, "-size[xyz] <size> Domain size on x/y/z axis (%ux%ux%u by default)\n", sizex, sizey, sizez);
  99. fprintf(stderr, "-niter <n> Number of iterations (%u by default)\n", niter);
  100. fprintf(stderr, "-ticks <t> How often to put ticks in the output (ms, %u by default)\n", ticks);
  101. exit(0);
  102. }
  103. }
  104. #ifdef STARPU_HAVE_VALGRIND_H
  105. if (RUNNING_ON_VALGRIND)
  106. {
  107. sizex = sizey = 3;
  108. nbz = 10;
  109. sizez = nbz*3;
  110. }
  111. #endif
  112. }
  113. static void init_problem(int argc, char **argv, int rank, int world_size)
  114. {
  115. parse_args(argc, argv);
  116. create_blocks_array(sizex, sizey, sizez, nbz);
  117. /* Select the MPI process which should compute the different blocks */
  118. assign_blocks_to_mpi_nodes(world_size);
  119. assign_blocks_to_workers(rank);
  120. /* Allocate the different memory blocks, if used by the MPI process */
  121. allocate_memory_on_node(rank);
  122. display_memory_consumption(rank);
  123. who_runs_what_len = 2*niter;
  124. who_runs_what = (int *) calloc(nbz * who_runs_what_len, sizeof(*who_runs_what));
  125. who_runs_what_index = (int *) calloc(nbz, sizeof(*who_runs_what_index));
  126. last_tick = (double *) calloc(nbz, sizeof(*last_tick));
  127. }
  128. static void free_problem(int rank)
  129. {
  130. free_memory_on_node(rank);
  131. free_blocks_array();
  132. free(who_runs_what);
  133. free(who_runs_what_index);
  134. free(last_tick);
  135. }
  136. /*
  137. * Main body
  138. */
  139. double start;
  140. double begin, end;
  141. double timing;
  142. void f(unsigned task_per_worker[STARPU_NMAXWORKERS])
  143. {
  144. unsigned total = 0;
  145. int worker;
  146. for (worker = 0; worker < STARPU_NMAXWORKERS; worker++)
  147. total += task_per_worker[worker];
  148. for (worker = 0; worker < STARPU_NMAXWORKERS; worker++)
  149. {
  150. if (task_per_worker[worker])
  151. {
  152. char name[64];
  153. starpu_worker_get_name(worker, name, sizeof(name));
  154. FPRINTF(stderr,"\t%s -> %u (%2.2f%%)\n", name, task_per_worker[worker], (100.0*task_per_worker[worker])/total);
  155. }
  156. }
  157. }
  158. unsigned global_workerid(unsigned local_workerid)
  159. {
  160. #if defined(STARPU_USE_MPI) && !defined(STARPU_USE_MPI_MASTER_SLAVE)
  161. int rank;
  162. MPI_Comm_rank(MPI_COMM_WORLD, &rank);
  163. unsigned workers_per_node = starpu_worker_get_count();
  164. return (local_workerid + rank*workers_per_node);
  165. #else
  166. return local_workerid;
  167. #endif
  168. }
  169. int main(int argc, char **argv)
  170. {
  171. int rank;
  172. int world_size;
  173. int ret;
  174. #if defined(STARPU_USE_MPI) && !defined(STARPU_SIMGRID) && !defined(STARPU_USE_MPI_MASTER_SLAVE)
  175. int thread_support;
  176. if (MPI_Init_thread(&argc, &argv, MPI_THREAD_SERIALIZED, &thread_support))
  177. {
  178. FPRINTF(stderr, "MPI_Init_thread failed\n");
  179. }
  180. if (thread_support == MPI_THREAD_FUNNELED)
  181. FPRINTF(stderr,"Warning: MPI only has funneled thread support, not serialized, hoping this will work\n");
  182. if (thread_support < MPI_THREAD_FUNNELED)
  183. FPRINTF(stderr,"Warning: MPI does not have thread support!\n");
  184. MPI_Comm_rank(MPI_COMM_WORLD, &rank);
  185. MPI_Comm_size(MPI_COMM_WORLD, &world_size);
  186. #else
  187. rank = 0;
  188. world_size = 1;
  189. #endif
  190. if (rank == 0)
  191. {
  192. FPRINTF(stderr, "Running on %d nodes\n", world_size);
  193. fflush(stderr);
  194. }
  195. ret = starpu_init(NULL);
  196. if (ret == -ENODEV) return 77;
  197. STARPU_CHECK_RETURN_VALUE(ret, "starpu_init");
  198. #if defined(STARPU_USE_MPI) && !defined(STARPU_SIMGRID) && !defined(STARPU_USE_MPI_MASTER_SLAVE)
  199. ret = starpu_mpi_init(NULL, NULL, 0);
  200. STARPU_CHECK_RETURN_VALUE(ret, "starpu_init");
  201. #endif
  202. #ifdef STARPU_USE_OPENCL
  203. opencl_life_init();
  204. opencl_shadow_init();
  205. #endif /*STARPU_USE_OPENCL*/
  206. init_problem(argc, argv, rank, world_size);
  207. create_tasks(rank);
  208. #if defined(STARPU_USE_MPI) && !defined(STARPU_SIMGRID) && !defined(STARPU_USE_MPI_MASTER_SLAVE)
  209. int barrier_ret = MPI_Barrier(MPI_COMM_WORLD);
  210. STARPU_ASSERT(barrier_ret == MPI_SUCCESS);
  211. #endif
  212. if (rank == 0)
  213. FPRINTF(stderr, "GO !\n");
  214. start = starpu_timing_now();
  215. begin = starpu_timing_now();
  216. starpu_tag_notify_from_apps(TAG_INIT_TASK);
  217. wait_end_tasks(rank);
  218. end = starpu_timing_now();
  219. #if defined(STARPU_USE_MPI) && !defined(STARPU_SIMGRID) && !defined(STARPU_USE_MPI_MASTER_SLAVE)
  220. barrier_ret = MPI_Barrier(MPI_COMM_WORLD);
  221. STARPU_ASSERT(barrier_ret == MPI_SUCCESS);
  222. #endif
  223. #if 0
  224. check(rank);
  225. #endif
  226. /*display_debug(nbz, niter, rank);*/
  227. #if defined(STARPU_USE_MPI) && !defined(STARPU_SIMGRID) && !defined(STARPU_USE_MPI_MASTER_SLAVE)
  228. starpu_mpi_shutdown();
  229. #endif
  230. /* timing in us */
  231. timing = end - begin;
  232. double min_timing = timing;
  233. double max_timing = timing;
  234. double sum_timing = timing;
  235. #if defined(STARPU_USE_MPI) && !defined(STARPU_SIMGRID) && !defined(STARPU_USE_MPI_MASTER_SLAVE)
  236. int reduce_ret;
  237. reduce_ret = MPI_Reduce(&timing, &min_timing, 1, MPI_DOUBLE, MPI_MIN, 0, MPI_COMM_WORLD);
  238. STARPU_ASSERT(reduce_ret == MPI_SUCCESS);
  239. reduce_ret = MPI_Reduce(&timing, &max_timing, 1, MPI_DOUBLE, MPI_MAX, 0, MPI_COMM_WORLD);
  240. STARPU_ASSERT(reduce_ret == MPI_SUCCESS);
  241. reduce_ret = MPI_Reduce(&timing, &sum_timing, 1, MPI_DOUBLE, MPI_SUM, 0, MPI_COMM_WORLD);
  242. STARPU_ASSERT(reduce_ret == MPI_SUCCESS);
  243. /* XXX we should do a gather instead, here we assume that non initialized values are still 0 */
  244. int *who_runs_what_tmp = malloc(nbz * who_runs_what_len * sizeof(*who_runs_what));
  245. reduce_ret = MPI_Reduce(who_runs_what, who_runs_what_tmp, nbz * who_runs_what_len, MPI_INT, MPI_SUM, 0, MPI_COMM_WORLD);
  246. STARPU_ASSERT(reduce_ret == MPI_SUCCESS);
  247. memcpy(who_runs_what, who_runs_what_tmp, nbz * who_runs_what_len * sizeof(*who_runs_what));
  248. free(who_runs_what_tmp);
  249. /* XXX we should do a gather instead, here we assume that non initialized values are still 0 */
  250. int *who_runs_what_index_tmp = malloc(nbz * sizeof(*who_runs_what_index));
  251. reduce_ret = MPI_Reduce(who_runs_what_index, who_runs_what_index_tmp, nbz, MPI_INT, MPI_SUM, 0, MPI_COMM_WORLD);
  252. STARPU_ASSERT(reduce_ret == MPI_SUCCESS);
  253. memcpy(who_runs_what_index, who_runs_what_index_tmp, nbz * sizeof(*who_runs_what_index));
  254. free(who_runs_what_index_tmp);
  255. #endif
  256. if (rank == 0)
  257. {
  258. #if 1
  259. FPRINTF(stderr, "update:\n");
  260. f(update_per_worker);
  261. FPRINTF(stderr, "top:\n");
  262. f(top_per_worker);
  263. FPRINTF(stderr, "bottom:\n");
  264. f(bottom_per_worker);
  265. #endif
  266. #if 1
  267. unsigned nzblocks_per_process = (nbz + world_size - 1) / world_size;
  268. int iter;
  269. for (iter = 0; iter < who_runs_what_len; iter++)
  270. {
  271. starpu_iteration_push(iter);
  272. unsigned last, bz;
  273. last = 1;
  274. for (bz = 0; bz < nbz; bz++)
  275. {
  276. if ((bz % nzblocks_per_process) == 0)
  277. FPRINTF(stderr, "| ");
  278. if (who_runs_what_index[bz] <= iter)
  279. FPRINTF(stderr,"_ ");
  280. else
  281. {
  282. last = 0;
  283. if (who_runs_what[bz + iter * nbz] == -1)
  284. FPRINTF(stderr,"* ");
  285. else
  286. FPRINTF(stderr, "%d ", who_runs_what[bz + iter * nbz]);
  287. }
  288. }
  289. FPRINTF(stderr, "\n");
  290. starpu_iteration_pop();
  291. if (last)
  292. break;
  293. }
  294. #endif
  295. fflush(stderr);
  296. FPRINTF(stdout, "Computation took: %f ms on %d MPI processes\n", max_timing/1000, world_size);
  297. FPRINTF(stdout, "\tMIN : %f ms\n", min_timing/1000);
  298. FPRINTF(stdout, "\tMAX : %f ms\n", max_timing/1000);
  299. FPRINTF(stdout, "\tAVG : %f ms\n", sum_timing/(world_size*1000));
  300. }
  301. free_problem(rank);
  302. starpu_shutdown();
  303. #if defined(STARPU_USE_MPI) && !defined(STARPU_SIMGRID) && !defined(STARPU_USE_MPI_MASTER_SLAVE)
  304. MPI_Finalize();
  305. #endif
  306. #ifdef STARPU_USE_OPENCL
  307. opencl_life_free();
  308. opencl_shadow_free();
  309. #endif /*STARPU_USE_OPENCL*/
  310. return 0;
  311. }