stencil.c 9.7 KB

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