stencil.c 9.3 KB

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