stencil.c 9.0 KB

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