implicit-stencil-kernels.c 25 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412413414415416417418419420421422423424425426427428429430431432433434435436437438439440441442443444445446447448449450451452453454455456457458459460461462463464465466467468469470471472473474475476477478479480481482483484485486487488489490491492493494495496497498499500501502503504505506507508509510511512513514515516517518519520521522523524525526527528529530531532533534535536537538539540541542543544545546547548549550551552553554555556557558559560561562563564565566567568569570571572573574575576577578579580581582583584585586587588589590591592593594595596597598599600601602603604605606607608609610611612613614615616617618619620621622623624625626627628629630631632633634635636637638639640641642643644645646647648649650651652653654655656657658659660661662663664665666667668669670671672673674675676677678679680681682683684685686687688689690691692693694695696697698699700701702703704705706707708709710711712713714715716717718719720721722723724725726727728729730731732733734735736737738739740741742743744745746747748749750751752753754755756757758759760761762763764765
  1. /* StarPU --- Runtime system for heterogeneous multicore architectures.
  2. *
  3. * Copyright (C) 2016,2017 Inria
  4. * Copyright (C) 2012,2013,2016,2017,2019 CNRS
  5. * Copyright (C) 2010-2015 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. /* Computation Kernels */
  20. /*
  21. * There are three codeletets:
  22. *
  23. * - cl_update, which takes a block and the boundaries of its neighbours, loads
  24. * the boundaries into the block and perform some update loops:
  25. *
  26. * comp. buffer save. buffers comp. buffer save. buffers comp. buffer
  27. * | ... |
  28. * | | +------------------+ +------------------+
  29. * | #N+1 | | #N+1 bottom copy====>#N+1 bottom copy |
  30. * +-------------+ +------------------+ +------------------+
  31. * | #N top copy | | #N top copy | | |
  32. * +-------------+ +------------------+ | |
  33. * | #N |
  34. * ...
  35. * | | +----------------+ +----------------------+
  36. * | | | #N bottom copy | | block #N bottom copy |
  37. * ^ +------------------+ +----------------+ +----------------------+
  38. * | | #N-1 top copy <====#N-1 top copy | | block #N-1 |
  39. * | +------------------+ +----------------+ | |
  40. * Z ...
  41. *
  42. * - save_cl_top, which take a block and its top boundary, and saves the top of
  43. * the block into the boundary (to be given as bottom of the neighbour above
  44. * this block).
  45. *
  46. * comp. buffer save. buffers comp. buffer save. buffers comp. buffer
  47. * | ... |
  48. * | | +------------------+ +------------------+
  49. * | #N+1 | | #N+1 bottom copy | | #N+1 bottom copy |
  50. * +-------------+ +------------------+ +------------------+
  51. * | #N top copy | | #N top copy <==== |
  52. * +-------------+ +------------------+ |..................|
  53. * | #N |
  54. * ...
  55. * | | +----------------+ +----------------------+
  56. * | | | #N bottom copy | | block #N bottom copy |
  57. * ^ +------------------+ +----------------+ +----------------------+
  58. * | | #N-1 top copy | | #N-1 top copy | | block #N-1 |
  59. * | +------------------+ +----------------+ | |
  60. * Z ...
  61. *
  62. * - save_cl_bottom, same for the bottom
  63. * comp. buffer save. buffers comp. buffer save. buffers comp. buffer
  64. * | ... |
  65. * | | +------------------+ +------------------+
  66. * | #N+1 | | #N+1 bottom copy | | #N+1 bottom copy |
  67. * +-------------+ +------------------+ +------------------+
  68. * | #N top copy | | #N top copy | | |
  69. * +-------------+ +------------------+ | |
  70. * | #N |
  71. * ...
  72. * |..................| +----------------+ +----------------------+
  73. * | ====>#N bottom copy | | block #N bottom copy |
  74. * ^ +------------------+ +----------------+ +----------------------+
  75. * | | #N-1 top copy | | #N-1 top copy | | block #N-1 |
  76. * | +------------------+ +----------------+ | |
  77. * Z ...
  78. *
  79. * The idea is that the computation buffers thus don't have to move, only their
  80. * boundaries are copied to buffers that do move (be it CPU/GPU, GPU/GPU or via
  81. * MPI)
  82. *
  83. * For each of the buffers above, there are two (0/1) buffers to make new/old switch costless.
  84. */
  85. #if 0
  86. # define DEBUG(fmt, ...) fprintf(stderr,fmt,##__VA_ARGS__)
  87. #else
  88. # define DEBUG(fmt, ...) (void) 0
  89. #endif
  90. /* Record which GPU ran which block, for nice pictures */
  91. int who_runs_what_len;
  92. int *who_runs_what;
  93. int *who_runs_what_index;
  94. double *last_tick;
  95. /* Achieved iterations */
  96. static int achieved_iter;
  97. /* Record how many updates each worker performed */
  98. unsigned update_per_worker[STARPU_NMAXWORKERS];
  99. static void record_who_runs_what(struct block_description *block)
  100. {
  101. double now, now2, diff, delta = get_ticks() * 1000;
  102. int workerid = starpu_worker_get_id_check();
  103. now = starpu_timing_now();
  104. now2 = now - start;
  105. diff = now2 - last_tick[block->bz];
  106. while (diff >= delta)
  107. {
  108. last_tick[block->bz] += delta;
  109. diff = now2 - last_tick[block->bz];
  110. if (who_runs_what_index[block->bz] < who_runs_what_len)
  111. who_runs_what[block->bz + (who_runs_what_index[block->bz]++) * get_nbz()] = -1;
  112. }
  113. if (who_runs_what_index[block->bz] < who_runs_what_len)
  114. who_runs_what[block->bz + (who_runs_what_index[block->bz]++) * get_nbz()] = global_workerid(workerid);
  115. }
  116. static void check_load(struct starpu_block_interface *block, struct starpu_block_interface *boundary)
  117. {
  118. /* Sanity checks */
  119. STARPU_ASSERT(block->nx == boundary->nx);
  120. STARPU_ASSERT(block->ny == boundary->ny);
  121. STARPU_ASSERT(boundary->nz == K);
  122. /* NB: this is not fully garanteed ... but it's *very* likely and that
  123. * makes our life much simpler */
  124. STARPU_ASSERT(block->ldy == boundary->ldy);
  125. STARPU_ASSERT(block->ldz == boundary->ldz);
  126. }
  127. /*
  128. * Load a neighbour's boundary into block, CPU version
  129. */
  130. static void load_subblock_from_buffer_cpu(void *_block,
  131. void *_boundary,
  132. unsigned firstz)
  133. {
  134. struct starpu_block_interface *block = (struct starpu_block_interface *)_block;
  135. struct starpu_block_interface *boundary = (struct starpu_block_interface *)_boundary;
  136. check_load(block, boundary);
  137. /* We do a contiguous memory transfer */
  138. size_t boundary_size = K*block->ldz*block->elemsize;
  139. unsigned offset = firstz*block->ldz;
  140. TYPE *block_data = (TYPE *)block->ptr;
  141. TYPE *boundary_data = (TYPE *)boundary->ptr;
  142. memcpy(&block_data[offset], boundary_data, boundary_size);
  143. }
  144. /*
  145. * Load a neighbour's boundary into block, CUDA version
  146. */
  147. #ifdef STARPU_USE_CUDA
  148. static void load_subblock_from_buffer_cuda(void *_block,
  149. void *_boundary,
  150. unsigned firstz)
  151. {
  152. struct starpu_block_interface *block = (struct starpu_block_interface *)_block;
  153. struct starpu_block_interface *boundary = (struct starpu_block_interface *)_boundary;
  154. check_load(block, boundary);
  155. /* We do a contiguous memory transfer */
  156. size_t boundary_size = K*block->ldz*block->elemsize;
  157. unsigned offset = firstz*block->ldz;
  158. TYPE *block_data = (TYPE *)block->ptr;
  159. TYPE *boundary_data = (TYPE *)boundary->ptr;
  160. cudaMemcpyAsync(&block_data[offset], boundary_data, boundary_size, cudaMemcpyDeviceToDevice, starpu_cuda_get_local_stream());
  161. }
  162. /*
  163. * cl_update (CUDA version)
  164. */
  165. static void update_func_cuda(void *descr[], void *arg)
  166. {
  167. unsigned z;
  168. starpu_codelet_unpack_args(arg, &z);
  169. struct block_description *block = get_block_description(z);
  170. int workerid = starpu_worker_get_id_check();
  171. DEBUG( "!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!\n");
  172. if (block->bz == 0)
  173. FPRINTF(stderr,"!!! DO update_func_cuda z %u CUDA%d !!!\n", block->bz, workerid);
  174. else
  175. DEBUG( "!!! DO update_func_cuda z %u CUDA%d !!!\n", block->bz, workerid);
  176. #if defined(STARPU_USE_MPI) && !defined(STARPU_SIMGRID) && !defined(STARPU_USE_MPI_MASTER_SLAVE)
  177. int rank = 0;
  178. MPI_Comm_rank(MPI_COMM_WORLD, &rank);
  179. DEBUG( "!!! RANK %d !!!\n", rank);
  180. #endif
  181. DEBUG( "!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!\n");
  182. unsigned block_size_z = get_block_size(block->bz);
  183. unsigned i;
  184. update_per_worker[workerid]++;
  185. record_who_runs_what(block);
  186. /*
  187. * Load neighbours' boundaries : TOP
  188. */
  189. /* The offset along the z axis is (block_size_z + K) */
  190. load_subblock_from_buffer_cuda(descr[0], descr[2], block_size_z+K);
  191. load_subblock_from_buffer_cuda(descr[1], descr[3], block_size_z+K);
  192. /*
  193. * Load neighbours' boundaries : BOTTOM
  194. */
  195. load_subblock_from_buffer_cuda(descr[0], descr[4], 0);
  196. load_subblock_from_buffer_cuda(descr[1], descr[5], 0);
  197. /*
  198. * Stencils ... do the actual work here :) TODO
  199. */
  200. for (i=1; i<=K; i++)
  201. {
  202. struct starpu_block_interface *oldb = descr[i%2], *newb = descr[(i+1)%2];
  203. TYPE *old = (void*) oldb->ptr, *newer = (void*) newb->ptr;
  204. /* Shadow data */
  205. cuda_shadow_host(block->bz, old, oldb->nx, oldb->ny, oldb->nz, oldb->ldy, oldb->ldz, i);
  206. /* And perform actual computation */
  207. #ifdef LIFE
  208. cuda_life_update_host(block->bz, old, newer, oldb->nx, oldb->ny, oldb->nz, oldb->ldy, oldb->ldz, i);
  209. #else
  210. cudaMemcpyAsync(newer, old, oldb->nx * oldb->ny * oldb->nz * sizeof(*newer), cudaMemcpyDeviceToDevice, starpu_cuda_get_local_stream());
  211. #endif /* LIFE */
  212. }
  213. }
  214. #endif /* STARPU_USE_CUDA */
  215. /*
  216. * Load a neighbour's boundary into block, OpenCL version
  217. */
  218. #ifdef STARPU_USE_OPENCL
  219. static void load_subblock_from_buffer_opencl(struct starpu_block_interface *block,
  220. struct starpu_block_interface *boundary,
  221. unsigned firstz)
  222. {
  223. check_load(block, boundary);
  224. /* We do a contiguous memory transfer */
  225. size_t boundary_size = K*block->ldz*block->elemsize;
  226. unsigned offset = firstz*block->ldz;
  227. cl_mem block_data = (cl_mem)block->dev_handle;
  228. cl_mem boundary_data = (cl_mem)boundary->dev_handle;
  229. cl_command_queue cq;
  230. starpu_opencl_get_current_queue(&cq);
  231. cl_int ret = clEnqueueCopyBuffer(cq, boundary_data, block_data, 0, offset, boundary_size, 0, NULL, NULL);
  232. if (ret != CL_SUCCESS) STARPU_OPENCL_REPORT_ERROR(ret);
  233. }
  234. /*
  235. * cl_update (OpenCL version)
  236. */
  237. static void update_func_opencl(void *descr[], void *arg)
  238. {
  239. unsigned z;
  240. starpu_codelet_unpack_args(arg, &z);
  241. struct block_description *block = get_block_description(z);
  242. int workerid = starpu_worker_get_id_check();
  243. DEBUG( "!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!\n");
  244. if (block->bz == 0)
  245. FPRINTF(stderr,"!!! DO update_func_opencl z %u OPENCL%d !!!\n", block->bz, workerid);
  246. else
  247. DEBUG( "!!! DO update_func_opencl z %u OPENCL%d !!!\n", block->bz, workerid);
  248. #if defined(STARPU_USE_MPI) && !defined(STARPU_SIMGRID) && !defined(STARPU_USE_MPI_MASTER_SLAVE)
  249. int rank = 0;
  250. MPI_Comm_rank(MPI_COMM_WORLD, &rank);
  251. DEBUG( "!!! RANK %d !!!\n", rank);
  252. #endif
  253. DEBUG( "!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!\n");
  254. unsigned block_size_z = get_block_size(block->bz);
  255. unsigned i;
  256. update_per_worker[workerid]++;
  257. record_who_runs_what(block);
  258. cl_command_queue cq;
  259. starpu_opencl_get_current_queue(&cq);
  260. /*
  261. * Load neighbours' boundaries : TOP
  262. */
  263. /* The offset along the z axis is (block_size_z + K) */
  264. load_subblock_from_buffer_opencl(descr[0], descr[2], block_size_z+K);
  265. load_subblock_from_buffer_opencl(descr[1], descr[3], block_size_z+K);
  266. /*
  267. * Load neighbours' boundaries : BOTTOM
  268. */
  269. load_subblock_from_buffer_opencl(descr[0], descr[4], 0);
  270. load_subblock_from_buffer_opencl(descr[1], descr[5], 0);
  271. /*
  272. * Stencils ... do the actual work here :) TODO
  273. */
  274. for (i=1; i<=K; i++)
  275. {
  276. struct starpu_block_interface *oldb = descr[i%2], *newb = descr[(i+1)%2];
  277. TYPE *old = (void*) oldb->dev_handle, *newer = (void*) newb->dev_handle;
  278. /* Shadow data */
  279. opencl_shadow_host(block->bz, old, oldb->nx, oldb->ny, oldb->nz, oldb->ldy, oldb->ldz, i);
  280. /* And perform actual computation */
  281. #ifdef LIFE
  282. opencl_life_update_host(block->bz, old, newer, oldb->nx, oldb->ny, oldb->nz, oldb->ldy, oldb->ldz, i);
  283. #else
  284. cl_event event;
  285. cl_int ret = clEnqueueCopyBuffer(cq, old, newer, 0, 0, oldb->nx * oldb->ny * oldb->nz * sizeof(*newer), 0, NULL, &event);
  286. if (ret != CL_SUCCESS) STARPU_OPENCL_REPORT_ERROR(ret);
  287. #endif /* LIFE */
  288. }
  289. }
  290. #endif /* STARPU_USE_OPENCL */
  291. /*
  292. * cl_update (CPU version)
  293. */
  294. void update_func_cpu(void *descr[], void *arg)
  295. {
  296. unsigned zz;
  297. starpu_codelet_unpack_args(arg, &zz);
  298. struct block_description *block = get_block_description(zz);
  299. int workerid = starpu_worker_get_id_check();
  300. DEBUG( "!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!\n");
  301. if (block->bz == 0)
  302. DEBUG("!!! DO update_func_cpu z %u CPU%d !!!\n", block->bz, workerid);
  303. else
  304. DEBUG("!!! DO update_func_cpu z %u CPU%d !!!\n", block->bz, workerid);
  305. #if defined(STARPU_USE_MPI) && !defined(STARPU_SIMGRID) && !defined(STARPU_USE_MPI_MASTER_SLAVE)
  306. int rank = 0;
  307. MPI_Comm_rank(MPI_COMM_WORLD, &rank);
  308. DEBUG( "!!! RANK %d !!!\n", rank);
  309. #endif
  310. DEBUG( "!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!\n");
  311. unsigned block_size_z = get_block_size(block->bz);
  312. unsigned i;
  313. update_per_worker[workerid]++;
  314. record_who_runs_what(block);
  315. /*
  316. * Load neighbours' boundaries : TOP
  317. */
  318. /* The offset along the z axis is (block_size_z + K) */
  319. load_subblock_from_buffer_cpu(descr[0], descr[2], block_size_z+K);
  320. load_subblock_from_buffer_cpu(descr[1], descr[3], block_size_z+K);
  321. /*
  322. * Load neighbours' boundaries : BOTTOM
  323. */
  324. load_subblock_from_buffer_cpu(descr[0], descr[4], 0);
  325. load_subblock_from_buffer_cpu(descr[1], descr[5], 0);
  326. /*
  327. * Stencils ... do the actual work here :) TODO
  328. */
  329. for (i=1; i<=K; i++)
  330. {
  331. struct starpu_block_interface *oldb = (struct starpu_block_interface *) descr[i%2], *newb = (struct starpu_block_interface *) descr[(i+1)%2];
  332. TYPE *old = (TYPE*) oldb->ptr, *newer = (TYPE*) newb->ptr;
  333. /* Shadow data */
  334. unsigned ldy = oldb->ldy, ldz = oldb->ldz;
  335. unsigned nx = oldb->nx, ny = oldb->ny, nz = oldb->nz;
  336. unsigned x, y, z;
  337. unsigned stepx = 1;
  338. unsigned stepy = 1;
  339. unsigned stepz = 1;
  340. unsigned idx = 0;
  341. unsigned idy = 0;
  342. unsigned idz = 0;
  343. TYPE *ptr = old;
  344. # include "shadow.h"
  345. /* And perform actual computation */
  346. #ifdef LIFE
  347. life_update(block->bz, old, newer, oldb->nx, oldb->ny, oldb->nz, oldb->ldy, oldb->ldz, i);
  348. #else
  349. memcpy(newer, old, oldb->nx * oldb->ny * oldb->nz * sizeof(*newer));
  350. #endif /* LIFE */
  351. }
  352. }
  353. /* Performance model and codelet structure */
  354. static struct starpu_perfmodel cl_update_model =
  355. {
  356. .type = STARPU_HISTORY_BASED,
  357. .symbol = "cl_update"
  358. };
  359. struct starpu_codelet cl_update =
  360. {
  361. .cpu_funcs = {update_func_cpu},
  362. #ifdef STARPU_USE_CUDA
  363. .cuda_funcs = {update_func_cuda},
  364. .cuda_flags = {STARPU_CUDA_ASYNC},
  365. #endif
  366. #ifdef STARPU_USE_OPENCL
  367. .opencl_funcs = {update_func_opencl},
  368. .opencl_flags = {STARPU_OPENCL_ASYNC},
  369. #endif
  370. .model = &cl_update_model,
  371. .nbuffers = 6,
  372. .modes = {STARPU_RW, STARPU_RW, STARPU_R, STARPU_R, STARPU_R, STARPU_R}
  373. };
  374. /*
  375. * Save the block internal boundaries to give them to our neighbours.
  376. */
  377. /* CPU version */
  378. static void load_subblock_into_buffer_cpu(void *_block,
  379. void *_boundary,
  380. unsigned firstz)
  381. {
  382. struct starpu_block_interface *block = (struct starpu_block_interface *)_block;
  383. struct starpu_block_interface *boundary = (struct starpu_block_interface *)_boundary;
  384. check_load(block, boundary);
  385. /* We do a contiguous memory transfer */
  386. size_t boundary_size = K*block->ldz*block->elemsize;
  387. unsigned offset = firstz*block->ldz;
  388. TYPE *block_data = (TYPE *)block->ptr;
  389. TYPE *boundary_data = (TYPE *)boundary->ptr;
  390. memcpy(boundary_data, &block_data[offset], boundary_size);
  391. }
  392. /* CUDA version */
  393. #ifdef STARPU_USE_CUDA
  394. static void load_subblock_into_buffer_cuda(void *_block,
  395. void *_boundary,
  396. unsigned firstz)
  397. {
  398. struct starpu_block_interface *block = (struct starpu_block_interface *)_block;
  399. struct starpu_block_interface *boundary = (struct starpu_block_interface *)_boundary;
  400. check_load(block, boundary);
  401. /* We do a contiguous memory transfer */
  402. size_t boundary_size = K*block->ldz*block->elemsize;
  403. unsigned offset = firstz*block->ldz;
  404. TYPE *block_data = (TYPE *)block->ptr;
  405. TYPE *boundary_data = (TYPE *)boundary->ptr;
  406. cudaMemcpyAsync(boundary_data, &block_data[offset], boundary_size, cudaMemcpyDeviceToDevice, starpu_cuda_get_local_stream());
  407. }
  408. #endif /* STARPU_USE_CUDA */
  409. /* OPENCL version */
  410. #ifdef STARPU_USE_OPENCL
  411. static void load_subblock_into_buffer_opencl(struct starpu_block_interface *block,
  412. struct starpu_block_interface *boundary,
  413. unsigned firstz)
  414. {
  415. check_load(block, boundary);
  416. /* We do a contiguous memory transfer */
  417. size_t boundary_size = K*block->ldz*block->elemsize;
  418. unsigned offset = firstz*block->ldz;
  419. cl_mem block_data = (cl_mem)block->dev_handle;
  420. cl_mem boundary_data = (cl_mem)boundary->dev_handle;
  421. cl_command_queue cq;
  422. starpu_opencl_get_current_queue(&cq);
  423. cl_int ret = clEnqueueCopyBuffer(cq, block_data, boundary_data, offset, 0, boundary_size, 0, NULL, NULL);
  424. if (ret != CL_SUCCESS) STARPU_OPENCL_REPORT_ERROR(ret);
  425. }
  426. #endif /* STARPU_USE_OPENCL */
  427. /* Record how many top/bottom saves each worker performed */
  428. unsigned top_per_worker[STARPU_NMAXWORKERS];
  429. unsigned bottom_per_worker[STARPU_NMAXWORKERS];
  430. /* top save, CPU version */
  431. void dummy_func_top_cpu(void *descr[], void *arg)
  432. {
  433. unsigned z;
  434. starpu_codelet_unpack_args(arg, &z);
  435. struct block_description *block = get_block_description(z);
  436. int workerid = starpu_worker_get_id_check();
  437. top_per_worker[workerid]++;
  438. DEBUG( "DO SAVE Bottom block %d\n", block->bz);
  439. /* The offset along the z axis is (block_size_z + K)- K */
  440. unsigned block_size_z = get_block_size(block->bz);
  441. load_subblock_into_buffer_cpu(descr[0], descr[2], block_size_z);
  442. load_subblock_into_buffer_cpu(descr[1], descr[3], block_size_z);
  443. }
  444. /* bottom save, CPU version */
  445. void dummy_func_bottom_cpu(void *descr[], void *arg)
  446. {
  447. unsigned z;
  448. starpu_codelet_unpack_args(arg, &z);
  449. struct block_description *block = get_block_description(z);
  450. STARPU_ASSERT(block);
  451. int workerid = starpu_worker_get_id_check();
  452. bottom_per_worker[workerid]++;
  453. DEBUG( "DO SAVE Top block %d\n", block->bz);
  454. load_subblock_into_buffer_cpu(descr[0], descr[2], K);
  455. load_subblock_into_buffer_cpu(descr[1], descr[3], K);
  456. }
  457. /* top save, CUDA version */
  458. #ifdef STARPU_USE_CUDA
  459. static void dummy_func_top_cuda(void *descr[], void *arg)
  460. {
  461. unsigned z;
  462. starpu_codelet_unpack_args(arg, &z);
  463. struct block_description *block = get_block_description(z);
  464. int workerid = starpu_worker_get_id_check();
  465. top_per_worker[workerid]++;
  466. DEBUG( "DO SAVE Top block %d\n", block->bz);
  467. /* The offset along the z axis is (block_size_z + K)- K */
  468. unsigned block_size_z = get_block_size(block->bz);
  469. load_subblock_into_buffer_cuda(descr[0], descr[2], block_size_z);
  470. load_subblock_into_buffer_cuda(descr[1], descr[3], block_size_z);
  471. }
  472. /* bottom save, CUDA version */
  473. static void dummy_func_bottom_cuda(void *descr[], void *arg)
  474. {
  475. unsigned z;
  476. starpu_codelet_unpack_args(arg, &z);
  477. struct block_description *block = get_block_description(z);
  478. (void) block;
  479. int workerid = starpu_worker_get_id_check();
  480. bottom_per_worker[workerid]++;
  481. DEBUG( "DO SAVE Bottom block %d on CUDA\n", block->bz);
  482. load_subblock_into_buffer_cuda(descr[0], descr[2], K);
  483. load_subblock_into_buffer_cuda(descr[1], descr[3], K);
  484. }
  485. #endif /* STARPU_USE_CUDA */
  486. /* top save, OpenCL version */
  487. #ifdef STARPU_USE_OPENCL
  488. static void dummy_func_top_opencl(void *descr[], void *arg)
  489. {
  490. unsigned z;
  491. starpu_codelet_unpack_args(arg, &z);
  492. struct block_description *block = get_block_description(z);
  493. int workerid = starpu_worker_get_id_check();
  494. top_per_worker[workerid]++;
  495. DEBUG( "DO SAVE Top block %d\n", block->bz);
  496. /* The offset along the z axis is (block_size_z + K)- K */
  497. unsigned block_size_z = get_block_size(block->bz);
  498. load_subblock_into_buffer_opencl(descr[0], descr[2], block_size_z);
  499. load_subblock_into_buffer_opencl(descr[1], descr[3], block_size_z);
  500. }
  501. /* bottom save, OPENCL version */
  502. static void dummy_func_bottom_opencl(void *descr[], void *arg)
  503. {
  504. unsigned z;
  505. starpu_codelet_unpack_args(arg, &z);
  506. struct block_description *block = get_block_description(z);
  507. (void) block;
  508. int workerid = starpu_worker_get_id_check();
  509. bottom_per_worker[workerid]++;
  510. DEBUG( "DO SAVE Bottom block %d on OPENCL\n", block->bz);
  511. load_subblock_into_buffer_opencl(descr[0], descr[2], K);
  512. load_subblock_into_buffer_opencl(descr[1], descr[3], K);
  513. }
  514. #endif /* STARPU_USE_OPENCL */
  515. /* Performance models and codelet for save */
  516. static struct starpu_perfmodel save_cl_bottom_model =
  517. {
  518. .type = STARPU_HISTORY_BASED,
  519. .symbol = "save_cl_bottom"
  520. };
  521. static struct starpu_perfmodel save_cl_top_model =
  522. {
  523. .type = STARPU_HISTORY_BASED,
  524. .symbol = "save_cl_top"
  525. };
  526. struct starpu_codelet save_cl_bottom =
  527. {
  528. .cpu_funcs = {dummy_func_bottom_cpu},
  529. #ifdef STARPU_USE_CUDA
  530. .cuda_funcs = {dummy_func_bottom_cuda},
  531. .cuda_flags = {STARPU_CUDA_ASYNC},
  532. #endif
  533. #ifdef STARPU_USE_OPENCL
  534. .opencl_funcs = {dummy_func_bottom_opencl},
  535. .opencl_flags = {STARPU_OPENCL_ASYNC},
  536. #endif
  537. .model = &save_cl_bottom_model,
  538. .nbuffers = 4,
  539. .modes = {STARPU_R, STARPU_R, STARPU_W, STARPU_W}
  540. };
  541. struct starpu_codelet save_cl_top =
  542. {
  543. .cpu_funcs = {dummy_func_top_cpu},
  544. #ifdef STARPU_USE_CUDA
  545. .cuda_funcs = {dummy_func_top_cuda},
  546. .cuda_flags = {STARPU_CUDA_ASYNC},
  547. #endif
  548. #ifdef STARPU_USE_OPENCL
  549. .opencl_funcs = {dummy_func_top_opencl},
  550. .opencl_flags = {STARPU_OPENCL_ASYNC},
  551. #endif
  552. .model = &save_cl_top_model,
  553. .nbuffers = 4,
  554. .modes = {STARPU_R, STARPU_R, STARPU_W, STARPU_W}
  555. };
  556. /* Memset a block's buffers */
  557. static void memset_func(void *descr[], void *arg)
  558. {
  559. (void)descr;
  560. unsigned sizex, sizey, bz;
  561. starpu_codelet_unpack_args(arg, &sizex, &sizey, &bz);
  562. struct block_description *block = get_block_description(bz);
  563. unsigned size_bz = get_block_size(bz);
  564. unsigned x,y,z;
  565. for (x = 0; x < sizex + 2*K; x++)
  566. {
  567. for (y = 0; y < sizey + 2*K; y++)
  568. {
  569. /* Main blocks */
  570. for (z = 0; z < size_bz + 2*K; z++)
  571. {
  572. block->layers[0][(x)+(y)*(sizex + 2*K)+(z)*(sizex+2*K)*(sizey+2*K)] = 0;
  573. block->layers[1][(x)+(y)*(sizex + 2*K)+(z)*(sizex+2*K)*(sizey+2*K)] = 0;
  574. }
  575. for (z = 0; z < K; z++)
  576. {
  577. /* Boundary blocks : Top */
  578. block->boundaries[T][0][(x)+(y)*(sizex + 2*K)+(z)*(sizex+2*K)*(sizey+2*K)] = 0;
  579. block->boundaries[T][1][(x)+(y)*(sizex + 2*K)+(z)*(sizex+2*K)*(sizey+2*K)] = 0;
  580. /* Boundary blocks : Bottom */
  581. block->boundaries[B][0][(x)+(y)*(sizex + 2*K)+(z)*(sizex+2*K)*(sizey+2*K)] = 0;
  582. block->boundaries[B][1][(x)+(y)*(sizex + 2*K)+(z)*(sizex+2*K)*(sizey+2*K)] = 0;
  583. }
  584. }
  585. }
  586. //memset(block->layers[0], 0, (sizex + 2*K)*(sizey + 2*K)*(size_bz + 2*K)*sizeof(block->layers[0]));
  587. //memset(block->layers[1], 0, (sizex + 2*K)*(sizey + 2*K)*(size_bz + 2*K)*sizeof(block->layers[1]));
  588. //memset(block->boundaries[T][0], 0, (sizex + 2*K)*(sizey + 2*K)*K*sizeof(block->boundaries[T][0]));
  589. //memset(block->boundaries[T][1], 0, (sizex + 2*K)*(sizey + 2*K)*K*sizeof(block->boundaries[T][1]));
  590. //memset(block->boundaries[B][0], 0, (sizex + 2*K)*(sizey + 2*K)*K*sizeof(block->boundaries[B][0]));
  591. //memset(block->boundaries[B][1], 0, (sizex + 2*K)*(sizey + 2*K)*K*sizeof(block->boundaries[B][1]));
  592. }
  593. static double memset_cost_function(struct starpu_task *task, unsigned nimpl)
  594. {
  595. (void) task;
  596. (void) nimpl;
  597. return 0.000001;
  598. }
  599. static struct starpu_perfmodel memset_model =
  600. {
  601. .type = STARPU_COMMON,
  602. .cost_function = memset_cost_function,
  603. .symbol = "memset"
  604. };
  605. struct starpu_codelet cl_memset =
  606. {
  607. .cpu_funcs = {memset_func},
  608. .model = &memset_model,
  609. .nbuffers = 6,
  610. .modes = {STARPU_W, STARPU_W, STARPU_W, STARPU_W, STARPU_W, STARPU_W}
  611. };
  612. /* Initialize a block's layer */
  613. static void initlayer_func(void *descr[], void *arg)
  614. {
  615. (void)descr;
  616. unsigned sizex, sizey, bz;
  617. starpu_codelet_unpack_args(arg, &sizex, &sizey, &bz);
  618. struct block_description *block = get_block_description(bz);
  619. unsigned size_bz = get_block_size(bz);
  620. /* Initialize layer with some random data */
  621. unsigned x, y, z;
  622. unsigned sum = 0;
  623. for (x = 0; x < sizex; x++)
  624. for (y = 0; y < sizey; y++)
  625. for (z = 0; z < size_bz; z++)
  626. sum += block->layers[0][(K+x)+(K+y)*(sizex + 2*K)+(K+z)*(sizex+2*K)*(sizey+2*K)] = (int)((x/7.+y/13.+(bz*size_bz + z)/17.) * 10.) % 2;
  627. }
  628. static double initlayer_cost_function(struct starpu_task *task, unsigned nimpl)
  629. {
  630. (void) task;
  631. (void) nimpl;
  632. return 0.000001;
  633. }
  634. static struct starpu_perfmodel initlayer_model =
  635. {
  636. .type = STARPU_COMMON,
  637. .cost_function = initlayer_cost_function,
  638. .symbol = "initlayer"
  639. };
  640. struct starpu_codelet cl_initlayer =
  641. {
  642. .cpu_funcs = {initlayer_func},
  643. .model = &initlayer_model,
  644. .nbuffers = 1,
  645. .modes = {STARPU_W}
  646. };