implicit-stencil.c 9.4 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379
  1. /* StarPU --- Runtime system for heterogeneous multicore architectures.
  2. *
  3. * Copyright (C) 2016,2017 Inria
  4. * Copyright (C) 2010-2013,2016,2017,2019 CNRS
  5. * Copyright (C) 2010-2012,2014 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 "implicit-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. double start;
  37. double begin, end;
  38. double timing;
  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. }
  105. static void init_problem(int argc, char **argv, int rank, int world_size)
  106. {
  107. parse_args(argc, argv);
  108. create_blocks_array(sizex, sizey, sizez, nbz);
  109. /* Select the MPI process which should compute the different blocks */
  110. assign_blocks_to_mpi_nodes(world_size);
  111. assign_blocks_to_workers(rank);
  112. /* Allocate the different memory blocks, if used by the MPI process */
  113. start = starpu_timing_now();
  114. allocate_memory_on_node(rank);
  115. end = starpu_timing_now();
  116. timing = end - begin;
  117. display_memory_consumption(rank, timing);
  118. who_runs_what_len = 2*niter;
  119. who_runs_what = (int *) calloc(nbz * who_runs_what_len, sizeof(*who_runs_what));
  120. who_runs_what_index = (int *) calloc(nbz, sizeof(*who_runs_what_index));
  121. last_tick = (double *) calloc(nbz, sizeof(*last_tick));
  122. }
  123. static void free_problem(int rank)
  124. {
  125. free_memory_on_node(rank);
  126. free_blocks_array();
  127. free(who_runs_what);
  128. free(who_runs_what_index);
  129. free(last_tick);
  130. }
  131. /*
  132. * Main body
  133. */
  134. void f(unsigned task_per_worker[STARPU_NMAXWORKERS])
  135. {
  136. unsigned total = 0;
  137. int worker;
  138. for (worker = 0; worker < STARPU_NMAXWORKERS; worker++)
  139. total += task_per_worker[worker];
  140. for (worker = 0; worker < STARPU_NMAXWORKERS; worker++)
  141. {
  142. if (task_per_worker[worker])
  143. {
  144. char name[64];
  145. starpu_worker_get_name(worker, name, sizeof(name));
  146. FPRINTF(stderr,"\t%s -> %u (%2.2f%%)\n", name, task_per_worker[worker], (100.0*task_per_worker[worker])/total);
  147. }
  148. }
  149. }
  150. unsigned global_workerid(unsigned local_workerid)
  151. {
  152. #if defined(STARPU_USE_MPI) && !defined(STARPU_USE_MPI_MASTER_SLAVE)
  153. int rank;
  154. MPI_Comm_rank(MPI_COMM_WORLD, &rank);
  155. unsigned workers_per_node = starpu_worker_get_count();
  156. return (local_workerid + rank*workers_per_node);
  157. #else
  158. return local_workerid;
  159. #endif
  160. }
  161. int main(int argc, char **argv)
  162. {
  163. int rank;
  164. int world_size;
  165. int ret;
  166. #if defined(STARPU_USE_MPI) && !defined(STARPU_SIMGRID) && !defined(STARPU_USE_MPI_MASTER_SLAVE)
  167. int thread_support;
  168. if (MPI_Init_thread(&argc, &argv, MPI_THREAD_SERIALIZED, &thread_support))
  169. {
  170. FPRINTF(stderr, "MPI_Init_thread failed\n");
  171. }
  172. if (thread_support == MPI_THREAD_FUNNELED)
  173. FPRINTF(stderr,"Warning: MPI only has funneled thread support, not serialized, hoping this will work\n");
  174. if (thread_support < MPI_THREAD_FUNNELED)
  175. FPRINTF(stderr,"Warning: MPI does not have thread support!\n");
  176. MPI_Comm_rank(MPI_COMM_WORLD, &rank);
  177. MPI_Comm_size(MPI_COMM_WORLD, &world_size);
  178. #else
  179. rank = 0;
  180. world_size = 1;
  181. #endif
  182. if (rank == 0)
  183. {
  184. FPRINTF(stderr, "Running on %d nodes\n", world_size);
  185. fflush(stderr);
  186. }
  187. ret = starpu_init(NULL);
  188. if (ret == -ENODEV) return 77;
  189. STARPU_CHECK_RETURN_VALUE(ret, "starpu_init");
  190. #if defined(STARPU_USE_MPI) && !defined(STARPU_SIMGRID) && !defined(STARPU_USE_MPI_MASTER_SLAVE)
  191. ret = starpu_mpi_init(NULL, NULL, 0);
  192. STARPU_CHECK_RETURN_VALUE(ret, "starpu_init");
  193. #endif
  194. #ifdef STARPU_USE_OPENCL
  195. opencl_life_init();
  196. opencl_shadow_init();
  197. #endif /*STARPU_USE_OPENCL*/
  198. init_problem(argc, argv, rank, world_size);
  199. #if defined(STARPU_USE_MPI) && !defined(STARPU_SIMGRID) && !defined(STARPU_USE_MPI_MASTER_SLAVE)
  200. int barrier_ret = MPI_Barrier(MPI_COMM_WORLD);
  201. STARPU_ASSERT(barrier_ret == MPI_SUCCESS);
  202. #endif
  203. if (rank == 0)
  204. FPRINTF(stderr, "GO !\n");
  205. start = starpu_timing_now();
  206. begin = starpu_timing_now();
  207. create_tasks(rank);
  208. //starpu_tag_notify_from_apps(TAG_INIT_TASK);
  209. //wait_end_tasks(rank);
  210. starpu_task_wait_for_all();
  211. end = starpu_timing_now();
  212. #if defined(STARPU_USE_MPI) && !defined(STARPU_SIMGRID) && !defined(STARPU_USE_MPI_MASTER_SLAVE)
  213. barrier_ret = MPI_Barrier(MPI_COMM_WORLD);
  214. STARPU_ASSERT(barrier_ret == MPI_SUCCESS);
  215. #endif
  216. #if 0
  217. check(rank);
  218. #endif
  219. /*display_debug(nbz, niter, rank);*/
  220. /* timing in us */
  221. timing = end - begin;
  222. double min_timing = timing;
  223. double max_timing = timing;
  224. double sum_timing = timing;
  225. #if defined(STARPU_USE_MPI) && !defined(STARPU_SIMGRID) && !defined(STARPU_USE_MPI_MASTER_SLAVE)
  226. int reduce_ret;
  227. reduce_ret = MPI_Reduce(&timing, &min_timing, 1, MPI_DOUBLE, MPI_MIN, 0, MPI_COMM_WORLD);
  228. STARPU_ASSERT(reduce_ret == MPI_SUCCESS);
  229. reduce_ret = MPI_Reduce(&timing, &max_timing, 1, MPI_DOUBLE, MPI_MAX, 0, MPI_COMM_WORLD);
  230. STARPU_ASSERT(reduce_ret == MPI_SUCCESS);
  231. reduce_ret = MPI_Reduce(&timing, &sum_timing, 1, MPI_DOUBLE, MPI_SUM, 0, MPI_COMM_WORLD);
  232. STARPU_ASSERT(reduce_ret == MPI_SUCCESS);
  233. /* XXX we should do a gather instead, here we assume that non initialized values are still 0 */
  234. int *who_runs_what_tmp = malloc(nbz * who_runs_what_len * sizeof(*who_runs_what));
  235. reduce_ret = MPI_Reduce(who_runs_what, who_runs_what_tmp, nbz * who_runs_what_len, MPI_INT, MPI_SUM, 0, MPI_COMM_WORLD);
  236. STARPU_ASSERT(reduce_ret == MPI_SUCCESS);
  237. memcpy(who_runs_what, who_runs_what_tmp, nbz * who_runs_what_len * sizeof(*who_runs_what));
  238. free(who_runs_what_tmp);
  239. /* XXX we should do a gather instead, here we assume that non initialized values are still 0 */
  240. int *who_runs_what_index_tmp = malloc(nbz * sizeof(*who_runs_what_index));
  241. reduce_ret = MPI_Reduce(who_runs_what_index, who_runs_what_index_tmp, nbz, MPI_INT, MPI_SUM, 0, MPI_COMM_WORLD);
  242. STARPU_ASSERT(reduce_ret == MPI_SUCCESS);
  243. memcpy(who_runs_what_index, who_runs_what_index_tmp, nbz * sizeof(*who_runs_what_index));
  244. free(who_runs_what_index_tmp);
  245. #endif
  246. if (rank == 0)
  247. {
  248. #if 1
  249. FPRINTF(stderr, "update:\n");
  250. f(update_per_worker);
  251. FPRINTF(stderr, "top:\n");
  252. f(top_per_worker);
  253. FPRINTF(stderr, "bottom:\n");
  254. f(bottom_per_worker);
  255. #endif
  256. #if 1
  257. unsigned nzblocks_per_process = (nbz + world_size - 1) / world_size;
  258. int iter;
  259. for (iter = 0; iter < who_runs_what_len; iter++)
  260. {
  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. if (last)
  280. break;
  281. }
  282. #endif
  283. fflush(stderr);
  284. FPRINTF(stdout, "Computation took: %f ms on %d MPI processes\n", max_timing/1000, world_size);
  285. FPRINTF(stdout, "\tMIN : %f ms\n", min_timing/1000);
  286. FPRINTF(stdout, "\tMAX : %f ms\n", max_timing/1000);
  287. FPRINTF(stdout, "\tAVG : %f ms\n", sum_timing/(world_size*1000));
  288. }
  289. free_problem(rank);
  290. #if defined(STARPU_USE_MPI) && !defined(STARPU_SIMGRID) && !defined(STARPU_USE_MPI_MASTER_SLAVE)
  291. starpu_mpi_shutdown();
  292. #endif
  293. starpu_shutdown();
  294. #if defined(STARPU_USE_MPI) && !defined(STARPU_SIMGRID) && !defined(STARPU_USE_MPI_MASTER_SLAVE)
  295. MPI_Finalize();
  296. #endif
  297. #ifdef STARPU_USE_OPENCL
  298. opencl_life_free();
  299. opencl_shadow_free();
  300. #endif /*STARPU_USE_OPENCL*/
  301. return 0;
  302. }