pi_redux.c 11 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412413414415416417418419420421
  1. /* StarPU --- Runtime system for heterogeneous multicore architectures.
  2. *
  3. * Copyright (C) 2010-2021 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. /*
  17. * This computes Pi by using drawing random coordinates (thanks to the sobol
  18. * generator) and check whether they fall within one quarter of a circle. The
  19. * proportion gives an approximation of Pi. For each task, we draw a number of
  20. * coordinates, and we gather the number of successful draws.
  21. *
  22. * This version uses reduction to optimize gathering the number of successful
  23. * draws.
  24. */
  25. #include <starpu.h>
  26. #include <stdlib.h>
  27. #include <math.h>
  28. #define FPRINTF(ofile, fmt, ...) do { if (!getenv("STARPU_SSILENT")) {fprintf(ofile, fmt, ## __VA_ARGS__); }} while(0)
  29. #define PI 3.14159265358979323846
  30. #if defined(STARPU_USE_CUDA) && !defined(STARPU_HAVE_CURAND)
  31. #warning CURAND is required to run that example on CUDA devices
  32. #endif
  33. #ifdef STARPU_HAVE_CURAND
  34. #include <cuda.h>
  35. #include <curand.h>
  36. #endif
  37. static unsigned long long nshot_per_task = 16*1024*1024ULL;
  38. /* default value */
  39. static unsigned long ntasks = 1024;
  40. static unsigned long ntasks_warmup = 0;
  41. static unsigned use_redux = 1;
  42. static unsigned do_warmup = 0;
  43. /*
  44. * Initialization of the Random Number Generators (RNG)
  45. */
  46. #ifdef STARPU_HAVE_CURAND
  47. /* RNG for the CURAND library */
  48. static curandGenerator_t curandgens[STARPU_NMAXWORKERS];
  49. #endif
  50. /* state for the erand48 function : note the huge padding to avoid false-sharing */
  51. #define PADDING 1024
  52. static unsigned short xsubi[STARPU_NMAXWORKERS*PADDING];
  53. static starpu_drand48_data randbuffer[STARPU_NMAXWORKERS*PADDING];
  54. /* Function to initialize the random number generator in the current worker */
  55. static void init_rng(void *arg)
  56. {
  57. (void)arg;
  58. #ifdef STARPU_HAVE_CURAND
  59. curandStatus_t res;
  60. #endif
  61. int workerid = starpu_worker_get_id_check();
  62. switch (starpu_worker_get_type(workerid))
  63. {
  64. case STARPU_CPU_WORKER:
  65. /* create a seed */
  66. starpu_srand48_r((long int)workerid, &randbuffer[PADDING*workerid]);
  67. xsubi[0 + PADDING*workerid] = (unsigned short)workerid;
  68. xsubi[1 + PADDING*workerid] = (unsigned short)workerid;
  69. xsubi[2 + PADDING*workerid] = (unsigned short)workerid;
  70. break;
  71. #ifdef STARPU_HAVE_CURAND
  72. case STARPU_CUDA_WORKER:
  73. /* Create a RNG */
  74. res = curandCreateGenerator(&curandgens[workerid],
  75. CURAND_RNG_PSEUDO_DEFAULT);
  76. STARPU_ASSERT(res == CURAND_STATUS_SUCCESS);
  77. /* Seed it with worker's id */
  78. res = curandSetPseudoRandomGeneratorSeed(curandgens[workerid],
  79. (unsigned long long)workerid);
  80. STARPU_ASSERT(res == CURAND_STATUS_SUCCESS);
  81. break;
  82. #endif
  83. default:
  84. STARPU_ABORT();
  85. break;
  86. }
  87. }
  88. /* The amount of work does not depend on the data size at all :) */
  89. static size_t size_base(struct starpu_task *task, unsigned nimpl)
  90. {
  91. (void)task;
  92. (void)nimpl;
  93. return nshot_per_task;
  94. }
  95. static void parse_args(int argc, char **argv)
  96. {
  97. int i;
  98. for (i = 1; i < argc; i++)
  99. {
  100. if (strcmp(argv[i], "-ntasks") == 0)
  101. {
  102. char *argptr;
  103. ntasks = strtol(argv[++i], &argptr, 10);
  104. }
  105. if (strcmp(argv[i], "-nshot") == 0)
  106. {
  107. char *argptr;
  108. nshot_per_task = strtol(argv[++i], &argptr, 10);
  109. }
  110. if (strcmp(argv[i], "-noredux") == 0)
  111. {
  112. use_redux = 0;
  113. }
  114. if (strcmp(argv[i], "-warmup") == 0)
  115. {
  116. do_warmup = 1;
  117. ntasks_warmup = 8; /* arbitrary number of warmup tasks */
  118. }
  119. if (strcmp(argv[i], "-h") == 0 || strcmp(argv[i], "--help") == 0)
  120. {
  121. fprintf(stderr, "Usage: %s [-ntasks n] [-noredux] [-warmup] [-h]\n", argv[0]);
  122. exit(-1);
  123. }
  124. }
  125. }
  126. /*
  127. * Monte-carlo kernel
  128. */
  129. void pi_func_cpu(void *descr[], void *cl_arg)
  130. {
  131. (void)cl_arg;
  132. int workerid = starpu_worker_get_id_check();
  133. unsigned short *worker_xsub;
  134. worker_xsub = &xsubi[PADDING*workerid];
  135. starpu_drand48_data *buffer;
  136. buffer = &randbuffer[PADDING*workerid];
  137. unsigned long local_cnt = 0;
  138. /* Fill the scratchpad with random numbers */
  139. unsigned i;
  140. for (i = 0; i < nshot_per_task; i++)
  141. {
  142. double randx, randy;
  143. starpu_erand48_r(worker_xsub, buffer, &randx);
  144. starpu_erand48_r(worker_xsub, buffer, &randy);
  145. double x = (2.0*randx - 1.0);
  146. double y = (2.0*randy - 1.0);
  147. double dist = x*x + y*y;
  148. if (dist < 1.0)
  149. local_cnt++;
  150. }
  151. /* Put the contribution of that task into the counter */
  152. unsigned long *cnt = (unsigned long *)STARPU_VARIABLE_GET_PTR(descr[1]);
  153. *cnt = *cnt + local_cnt;
  154. }
  155. extern void pi_redux_cuda_kernel(float *x, float *y, unsigned n, unsigned long *shot_cnt);
  156. #ifdef STARPU_HAVE_CURAND
  157. static void pi_func_cuda(void *descr[], void *cl_arg)
  158. {
  159. (void)cl_arg;
  160. curandStatus_t res;
  161. int workerid = starpu_worker_get_id_check();
  162. /* CURAND is a bit silly: it assumes that any error is fatal. Calling
  163. * cudaGetLastError resets the last error value. */
  164. (void) cudaGetLastError();
  165. /* Fill the scratchpad with random numbers. Note that both x and y
  166. * arrays are in stored the same vector. */
  167. float *scratchpad_xy = (float *)STARPU_VECTOR_GET_PTR(descr[0]);
  168. res = curandGenerateUniform(curandgens[workerid], scratchpad_xy, 2*nshot_per_task);
  169. STARPU_ASSERT(res == CURAND_STATUS_SUCCESS);
  170. float *x = &scratchpad_xy[0];
  171. float *y = &scratchpad_xy[nshot_per_task];
  172. unsigned long *shot_cnt = (unsigned long *)STARPU_VARIABLE_GET_PTR(descr[1]);
  173. pi_redux_cuda_kernel(x, y, nshot_per_task, shot_cnt);
  174. }
  175. #endif
  176. static struct starpu_perfmodel pi_model =
  177. {
  178. .type = STARPU_HISTORY_BASED,
  179. .size_base = size_base,
  180. .symbol = "monte_carlo_pi_scratch"
  181. };
  182. static struct starpu_codelet pi_cl =
  183. {
  184. .cpu_funcs = {pi_func_cpu},
  185. .cpu_funcs_name = {"pi_func_cpu"},
  186. #ifdef STARPU_HAVE_CURAND
  187. .cuda_funcs = {pi_func_cuda},
  188. #endif
  189. .nbuffers = 2,
  190. .modes = {STARPU_SCRATCH, STARPU_RW},
  191. .model = &pi_model
  192. };
  193. static struct starpu_perfmodel pi_model_redux =
  194. {
  195. .type = STARPU_HISTORY_BASED,
  196. .size_base = size_base,
  197. .symbol = "monte_carlo_pi_scratch_redux"
  198. };
  199. static struct starpu_codelet pi_cl_redux =
  200. {
  201. .cpu_funcs = {pi_func_cpu},
  202. .cpu_funcs_name = {"pi_func_cpu"},
  203. #ifdef STARPU_HAVE_CURAND
  204. .cuda_funcs = {pi_func_cuda},
  205. #endif
  206. .nbuffers = 2,
  207. .modes = {STARPU_SCRATCH, STARPU_REDUX},
  208. .model = &pi_model_redux
  209. };
  210. /*
  211. * Codelets to implement reduction
  212. */
  213. void init_cpu_func(void *descr[], void *cl_arg)
  214. {
  215. (void)cl_arg;
  216. unsigned long *val = (unsigned long *)STARPU_VARIABLE_GET_PTR(descr[0]);
  217. *val = 0;
  218. }
  219. #ifdef STARPU_HAVE_CURAND
  220. static void init_cuda_func(void *descr[], void *cl_arg)
  221. {
  222. (void)cl_arg;
  223. unsigned long *val = (unsigned long *)STARPU_VARIABLE_GET_PTR(descr[0]);
  224. cudaMemsetAsync(val, 0, sizeof(unsigned long), starpu_cuda_get_local_stream());
  225. }
  226. #endif
  227. static struct starpu_codelet init_codelet =
  228. {
  229. .cpu_funcs = {init_cpu_func},
  230. .cpu_funcs_name = {"init_cpu_func"},
  231. #ifdef STARPU_HAVE_CURAND
  232. .cuda_funcs = {init_cuda_func},
  233. .cuda_flags = {STARPU_CUDA_ASYNC},
  234. #endif
  235. .modes = {STARPU_W},
  236. .nbuffers = 1
  237. };
  238. #ifdef STARPU_HAVE_CURAND
  239. /* Dummy implementation of the addition of two unsigned longs in CUDA */
  240. static void redux_cuda_func(void *descr[], void *cl_arg)
  241. {
  242. (void)cl_arg;
  243. unsigned long *d_a = (unsigned long *)STARPU_VARIABLE_GET_PTR(descr[0]);
  244. unsigned long *d_b = (unsigned long *)STARPU_VARIABLE_GET_PTR(descr[1]);
  245. unsigned long h_a, h_b;
  246. cudaMemcpyAsync(&h_a, d_a, sizeof(h_a), cudaMemcpyDeviceToHost, starpu_cuda_get_local_stream());
  247. cudaMemcpyAsync(&h_b, d_b, sizeof(h_b), cudaMemcpyDeviceToHost, starpu_cuda_get_local_stream());
  248. cudaStreamSynchronize(starpu_cuda_get_local_stream());
  249. h_a += h_b;
  250. cudaMemcpyAsync(d_a, &h_a, sizeof(h_a), cudaMemcpyHostToDevice, starpu_cuda_get_local_stream());
  251. }
  252. #endif
  253. void redux_cpu_func(void *descr[], void *cl_arg)
  254. {
  255. (void)cl_arg;
  256. unsigned long *a = (unsigned long *)STARPU_VARIABLE_GET_PTR(descr[0]);
  257. unsigned long *b = (unsigned long *)STARPU_VARIABLE_GET_PTR(descr[1]);
  258. *a = *a + *b;
  259. }
  260. static struct starpu_codelet redux_codelet =
  261. {
  262. .cpu_funcs = {redux_cpu_func},
  263. .cpu_funcs_name = {"redux_cpu_func"},
  264. #ifdef STARPU_HAVE_CURAND
  265. .cuda_funcs = {redux_cuda_func},
  266. .cuda_flags = {STARPU_CUDA_ASYNC},
  267. #endif
  268. .modes = {STARPU_RW|STARPU_COMMUTE, STARPU_R},
  269. .nbuffers = 2
  270. };
  271. /*
  272. * Main program
  273. */
  274. int main(int argc, char **argv)
  275. {
  276. unsigned i;
  277. int ret;
  278. /* Not supported yet */
  279. if (starpu_get_env_number_default("STARPU_GLOBAL_ARBITER", 0) > 0)
  280. return 77;
  281. parse_args(argc, argv);
  282. ret = starpu_init(NULL);
  283. if (ret == -ENODEV) return 77;
  284. STARPU_CHECK_RETURN_VALUE(ret, "starpu_init");
  285. /* Launch a Random Number Generator (RNG) on each worker */
  286. starpu_execute_on_each_worker(init_rng, NULL, STARPU_CPU|STARPU_CUDA);
  287. /* Create a scratchpad data */
  288. starpu_data_handle_t xy_scratchpad_handle;
  289. starpu_vector_data_register(&xy_scratchpad_handle, -1, (uintptr_t)NULL,
  290. 2*nshot_per_task, sizeof(float));
  291. /* Create a variable that will be used to count the number of shots
  292. * that actually hit the unit circle when shooting randomly in
  293. * [-1,1]^2. */
  294. unsigned long shot_cnt = 0;
  295. starpu_data_handle_t shot_cnt_handle;
  296. starpu_variable_data_register(&shot_cnt_handle, STARPU_MAIN_RAM,
  297. (uintptr_t)&shot_cnt, sizeof(shot_cnt));
  298. starpu_data_set_reduction_methods(shot_cnt_handle,
  299. &redux_codelet, &init_codelet);
  300. double start;
  301. double end;
  302. for (i = 0; i < ntasks_warmup; i++)
  303. {
  304. struct starpu_task *task = starpu_task_create();
  305. task->cl = use_redux?&pi_cl_redux:&pi_cl;
  306. task->handles[0] = xy_scratchpad_handle;
  307. task->handles[1] = shot_cnt_handle;
  308. ret = starpu_task_submit(task);
  309. STARPU_ASSERT(!ret);
  310. }
  311. start = starpu_timing_now();
  312. for (i = 0; i < ntasks; i++)
  313. {
  314. struct starpu_task *task = starpu_task_create();
  315. task->cl = use_redux?&pi_cl_redux:&pi_cl;
  316. task->handles[0] = xy_scratchpad_handle;
  317. task->handles[1] = shot_cnt_handle;
  318. ret = starpu_task_submit(task);
  319. STARPU_ASSERT(!ret);
  320. }
  321. starpu_data_unregister(shot_cnt_handle);
  322. starpu_data_unregister(xy_scratchpad_handle);
  323. end = starpu_timing_now();
  324. double timing = end - start;
  325. /* Total surface : Pi * r^ 2 = Pi*1^2, total square surface : 2^2 = 4,
  326. * probability to impact the disk: pi/4 */
  327. unsigned long total = (ntasks + ntasks_warmup)*nshot_per_task;
  328. double pi_approx = ((double)shot_cnt*4.0)/total;
  329. FPRINTF(stderr, "Reductions? %s\n", use_redux?"yes":"no");
  330. FPRINTF(stderr, "Pi approximation : %f (%lu / %lu)\n", pi_approx, shot_cnt, total);
  331. FPRINTF(stderr, "Error %e \n", pi_approx - PI);
  332. FPRINTF(stderr, "Total time : %f ms\n", timing/1000.0);
  333. FPRINTF(stderr, "Speed : %f GShot/s\n", total/(1e3*timing));
  334. starpu_shutdown();
  335. if (fabs(pi_approx - PI) > 1.0)
  336. return 1;
  337. return 0;
  338. }