mpi-support.texi 22 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412413414415416417418419420421422423424425426427428429430431432433434435436437438439440441442443444445446447448449450451452453454455456457458459460461462463464465466467468469470471472473474475476477478479480481482483484485486487488489490491492493494495496497498499500501502503504505506507508509510511512513514515516517518519520521522523524525526527528529530531532533534535536537538539540541542543544545546547548549550551552553554555556557558559560561562563564565
  1. @c -*-texinfo-*-
  2. @c This file is part of the StarPU Handbook.
  3. @c Copyright (C) 2009--2011 Universit@'e de Bordeaux 1
  4. @c Copyright (C) 2010, 2011, 2012 Centre National de la Recherche Scientifique
  5. @c Copyright (C) 2011 Institut National de Recherche en Informatique et Automatique
  6. @c See the file starpu.texi for copying conditions.
  7. The integration of MPI transfers within task parallelism is done in a
  8. very natural way by the means of asynchronous interactions between the
  9. application and StarPU. This is implemented in a separate libstarpumpi library
  10. which basically provides "StarPU" equivalents of @code{MPI_*} functions, where
  11. @code{void *} buffers are replaced with @code{starpu_data_handle_t}s, and all
  12. GPU-RAM-NIC transfers are handled efficiently by StarPU-MPI. The user has to
  13. use the usual @code{mpirun} command of the MPI implementation to start StarPU on
  14. the different MPI nodes.
  15. An MPI Insert Task function provides an even more seamless transition to a
  16. distributed application, by automatically issuing all required data transfers
  17. according to the task graph and an application-provided distribution.
  18. @menu
  19. * The API::
  20. * Simple Example::
  21. * Exchanging User Defined Data Interface::
  22. * MPI Insert Task Utility::
  23. * MPI Collective Operations::
  24. @end menu
  25. @node The API
  26. @section The API
  27. @subsection Compilation
  28. The flags required to compile or link against the MPI layer are then
  29. accessible with the following commands:
  30. @example
  31. % pkg-config --cflags starpumpi-1.0 # options for the compiler
  32. % pkg-config --libs starpumpi-1.0 # options for the linker
  33. @end example
  34. Also pass the @code{--static} option if the application is to be linked statically.
  35. @subsection Initialisation
  36. @deftypefun int starpu_mpi_init (int *@var{argc}, char ***@var{argv})
  37. Initializes the starpumpi library. If MPI is not already initialized,
  38. it will be by calling @code{MPI_Init_Thread(argc, argv, MPI_THREAD_SERIALIZED, ...)}.
  39. @end deftypefun
  40. @deftypefun int starpu_mpi_initialize (void)
  41. This function has been made deprecated. One should use instead the
  42. function @code{starpu_mpi_init()} defined above.
  43. @end deftypefun
  44. @deftypefun int starpu_mpi_initialize_extended (int *@var{rank}, int *@var{world_size})
  45. This function has been made deprecated. One should use instead the
  46. function @code{starpu_mpi_init()} defined above.
  47. @end deftypefun
  48. @deftypefun int starpu_mpi_shutdown (void)
  49. Cleans the starpumpi library. This must be called between calling
  50. @code{starpu_mpi} functions and @code{starpu_shutdown()}.
  51. @code{MPI_Finalize()} will be called if StarPU-MPI has been initialized
  52. by @code{starpu_mpi_init()}.
  53. @end deftypefun
  54. @deftypefun void starpu_mpi_comm_amounts_retrieve (size_t *@var{comm_amounts})
  55. Retrieve the current amount of communications from the current node in
  56. the array @code{comm_amounts} which must have a size greater or equal
  57. to the world size. Communications statistics must be enabled
  58. (@pxref{STARPU_COMM_STATS}).
  59. @end deftypefun
  60. @subsection Communication
  61. The standard point to point communications of MPI have been
  62. implemented. The semantic is similar to the MPI one, but adapted to
  63. the DSM provided by StarPU. A MPI request will only be submitted when
  64. the data is available in the main memory of the node submitting the
  65. request.
  66. @deftypefun int starpu_mpi_send (starpu_data_handle_t @var{data_handle}, int @var{dest}, int @var{mpi_tag}, MPI_Comm @var{comm})
  67. Performs a standard-mode, blocking send of @var{data_handle} to the
  68. node @var{dest} using the message tag @code{mpi_tag} within the
  69. communicator @var{comm}.
  70. @end deftypefun
  71. @deftypefun int starpu_mpi_recv (starpu_data_handle_t @var{data_handle}, int @var{source}, int @var{mpi_tag}, MPI_Comm @var{comm}, MPI_Status *@var{status})
  72. Performs a standard-mode, blocking receive in @var{data_handle} from the
  73. node @var{source} using the message tag @code{mpi_tag} within the
  74. communicator @var{comm}.
  75. @end deftypefun
  76. @deftypefun int starpu_mpi_isend (starpu_data_handle_t @var{data_handle}, starpu_mpi_req *@var{req}, int @var{dest}, int @var{mpi_tag}, MPI_Comm @var{comm})
  77. Posts a standard-mode, non blocking send of @var{data_handle} to the
  78. node @var{dest} using the message tag @code{mpi_tag} within the
  79. communicator @var{comm}. After the call, the pointer to the request
  80. @var{req} can be used to test the completion of the communication.
  81. @end deftypefun
  82. @deftypefun int starpu_mpi_irecv (starpu_data_handle_t @var{data_handle}, starpu_mpi_req *@var{req}, int @var{source}, int @var{mpi_tag}, MPI_Comm @var{comm})
  83. Posts a nonblocking receive in @var{data_handle} from the
  84. node @var{source} using the message tag @code{mpi_tag} within the
  85. communicator @var{comm}. After the call, the pointer to the request
  86. @var{req} can be used to test the completion of the communication.
  87. @end deftypefun
  88. @deftypefun int starpu_mpi_isend_detached (starpu_data_handle_t @var{data_handle}, int @var{dest}, int @var{mpi_tag}, MPI_Comm @var{comm}, void (*@var{callback})(void *), void *@var{arg})
  89. Posts a standard-mode, non blocking send of @var{data_handle} to the
  90. node @var{dest} using the message tag @code{mpi_tag} within the
  91. communicator @var{comm}. On completion, the @var{callback} function is
  92. called with the argument @var{arg}.
  93. @end deftypefun
  94. @deftypefun int starpu_mpi_irecv_detached (starpu_data_handle_t @var{data_handle}, int @var{source}, int @var{mpi_tag}, MPI_Comm @var{comm}, void (*@var{callback})(void *), void *@var{arg})
  95. Posts a nonblocking receive in @var{data_handle} from the
  96. node @var{source} using the message tag @code{mpi_tag} within the
  97. communicator @var{comm}. On completion, the @var{callback} function is
  98. called with the argument @var{arg}.
  99. @end deftypefun
  100. @deftypefun int starpu_mpi_wait (starpu_mpi_req *@var{req}, MPI_Status *@var{status})
  101. Returns when the operation identified by request @var{req} is complete.
  102. @end deftypefun
  103. @deftypefun int starpu_mpi_test (starpu_mpi_req *@var{req}, int *@var{flag}, MPI_Status *@var{status})
  104. If the operation identified by @var{req} is complete, set @var{flag}
  105. to 1. The @var{status} object is set to contain information on the
  106. completed operation.
  107. @end deftypefun
  108. @deftypefun int starpu_mpi_barrier (MPI_Comm @var{comm})
  109. Blocks the caller until all group members of the communicator
  110. @var{comm} have called it.
  111. @end deftypefun
  112. @deftypefun int starpu_mpi_isend_detached_unlock_tag (starpu_data_handle_t @var{data_handle}, int @var{dest}, int @var{mpi_tag}, MPI_Comm @var{comm}, starpu_tag_t @var{tag})
  113. Posts a standard-mode, non blocking send of @var{data_handle} to the
  114. node @var{dest} using the message tag @code{mpi_tag} within the
  115. communicator @var{comm}. On completion, @var{tag} is unlocked.
  116. @end deftypefun
  117. @deftypefun int starpu_mpi_irecv_detached_unlock_tag (starpu_data_handle_t @var{data_handle}, int @var{source}, int @var{mpi_tag}, MPI_Comm @var{comm}, starpu_tag_t @var{tag})
  118. Posts a nonblocking receive in @var{data_handle} from the
  119. node @var{source} using the message tag @code{mpi_tag} within the
  120. communicator @var{comm}. On completion, @var{tag} is unlocked.
  121. @end deftypefun
  122. @deftypefun int starpu_mpi_isend_array_detached_unlock_tag (unsigned @var{array_size}, starpu_data_handle_t *@var{data_handle}, int *@var{dest}, int *@var{mpi_tag}, MPI_Comm *@var{comm}, starpu_tag_t @var{tag})
  123. Posts @var{array_size} standard-mode, non blocking send. Each post
  124. sends the n-th data of the array @var{data_handle} to the n-th node of
  125. the array @var{dest}
  126. using the n-th message tag of the array @code{mpi_tag} within the n-th
  127. communicator of the array
  128. @var{comm}. On completion of the all the requests, @var{tag} is unlocked.
  129. @end deftypefun
  130. @deftypefun int starpu_mpi_irecv_array_detached_unlock_tag (unsigned @var{array_size}, starpu_data_handle_t *@var{data_handle}, int *@var{source}, int *@var{mpi_tag}, MPI_Comm *@var{comm}, starpu_tag_t @var{tag})
  131. Posts @var{array_size} nonblocking receive. Each post receives in the
  132. n-th data of the array @var{data_handle} from the n-th
  133. node of the array @var{source} using the n-th message tag of the array
  134. @code{mpi_tag} within the n-th communicator of the array @var{comm}.
  135. On completion of the all the requests, @var{tag} is unlocked.
  136. @end deftypefun
  137. @page
  138. @node Simple Example
  139. @section Simple Example
  140. @cartouche
  141. @smallexample
  142. void increment_token(void)
  143. @{
  144. struct starpu_task *task = starpu_task_create();
  145. task->cl = &increment_cl;
  146. task->handles[0] = token_handle;
  147. starpu_task_submit(task);
  148. @}
  149. @end smallexample
  150. @end cartouche
  151. @cartouche
  152. @smallexample
  153. int main(int argc, char **argv)
  154. @{
  155. int rank, size;
  156. starpu_init(NULL);
  157. starpu_mpi_initialize_extended(&rank, &size);
  158. starpu_vector_data_register(&token_handle, 0, (uintptr_t)&token, 1, sizeof(unsigned));
  159. unsigned nloops = NITER;
  160. unsigned loop;
  161. unsigned last_loop = nloops - 1;
  162. unsigned last_rank = size - 1;
  163. @end smallexample
  164. @end cartouche
  165. @cartouche
  166. @smallexample
  167. for (loop = 0; loop < nloops; loop++) @{
  168. int tag = loop*size + rank;
  169. if (loop == 0 && rank == 0)
  170. @{
  171. token = 0;
  172. fprintf(stdout, "Start with token value %d\n", token);
  173. @}
  174. else
  175. @{
  176. starpu_mpi_irecv_detached(token_handle, (rank+size-1)%size, tag,
  177. MPI_COMM_WORLD, NULL, NULL);
  178. @}
  179. increment_token();
  180. if (loop == last_loop && rank == last_rank)
  181. @{
  182. starpu_data_acquire(token_handle, STARPU_R);
  183. fprintf(stdout, "Finished: token value %d\n", token);
  184. starpu_data_release(token_handle);
  185. @}
  186. else
  187. @{
  188. starpu_mpi_isend_detached(token_handle, (rank+1)%size, tag+1,
  189. MPI_COMM_WORLD, NULL, NULL);
  190. @}
  191. @}
  192. starpu_task_wait_for_all();
  193. @end smallexample
  194. @end cartouche
  195. @cartouche
  196. @smallexample
  197. starpu_mpi_shutdown();
  198. starpu_shutdown();
  199. if (rank == last_rank)
  200. @{
  201. fprintf(stderr, "[%d] token = %d == %d * %d ?\n", rank, token, nloops, size);
  202. STARPU_ASSERT(token == nloops*size);
  203. @}
  204. @end smallexample
  205. @end cartouche
  206. @page
  207. @node Exchanging User Defined Data Interface
  208. @section Exchanging User Defined Data Interface
  209. New data interfaces defined as explained in @ref{An example
  210. of data interface} can also be used within StarPU-MPI and exchanged
  211. between nodes. Two functions needs to be defined through
  212. the type @code{struct starpu_data_interface_ops} (@pxref{Data
  213. Interface API}). The pack function takes a handle and returns a
  214. contiguous memory buffer where data to be conveyed to another node
  215. should be copied. The reversed operation is implemented in the unpack
  216. function which takes a contiguous memory buffer and recreates the data
  217. handle.
  218. @cartouche
  219. @smallexample
  220. static int complex_pack_data(starpu_data_handle_t handle, uint32_t node, void **ptr)
  221. @{
  222. STARPU_ASSERT(starpu_data_test_if_allocated_on_node(handle, node));
  223. struct starpu_complex_interface *complex_interface =
  224. (struct starpu_complex_interface *) starpu_data_get_interface_on_node(handle, node);
  225. *ptr = malloc(complex_get_size(handle));
  226. memcpy(*ptr, complex_interface->real, complex_interface->nx*sizeof(double));
  227. memcpy(*ptr+complex_interface->nx*sizeof(double), complex_interface->imaginary,
  228. complex_interface->nx*sizeof(double));
  229. return 0;
  230. @}
  231. @end smallexample
  232. @end cartouche
  233. @cartouche
  234. @smallexample
  235. static int complex_unpack_data(starpu_data_handle_t handle, uint32_t node, void *ptr)
  236. @{
  237. STARPU_ASSERT(starpu_data_test_if_allocated_on_node(handle, node));
  238. struct starpu_complex_interface *complex_interface =
  239. (struct starpu_complex_interface *) starpu_data_get_interface_on_node(handle, node);
  240. memcpy(complex_interface->real, ptr, complex_interface->nx*sizeof(double));
  241. memcpy(complex_interface->imaginary, ptr+complex_interface->nx*sizeof(double),
  242. complex_interface->nx*sizeof(double));
  243. return 0;
  244. @}
  245. @end smallexample
  246. @end cartouche
  247. @cartouche
  248. @smallexample
  249. static struct starpu_data_interface_ops interface_complex_ops =
  250. @{
  251. ...
  252. .pack_data = complex_pack_data,
  253. .unpack_data = complex_unpack_data
  254. @};
  255. @end smallexample
  256. @end cartouche
  257. @page
  258. @node MPI Insert Task Utility
  259. @section MPI Insert Task Utility
  260. To save the programmer from having to explicit all communications, StarPU
  261. provides an "MPI Insert Task Utility". The principe is that the application
  262. decides a distribution of the data over the MPI nodes by allocating it and
  263. notifying StarPU of that decision, i.e. tell StarPU which MPI node "owns"
  264. which data. It also decides, for each handle, an MPI tag which will be used to
  265. exchange the content of the handle. All MPI nodes then process the whole task
  266. graph, and StarPU automatically determines which node actually execute which
  267. task, and trigger the required MPI transfers.
  268. @deftypefun int starpu_data_set_tag (starpu_data_handle_t @var{handle}, int @var{tag})
  269. Tell StarPU-MPI which MPI tag to use when exchanging the data.
  270. @end deftypefun
  271. @deftypefun int starpu_data_get_tag (starpu_data_handle_t @var{handle})
  272. Returns the MPI tag to be used when exchanging the data.
  273. @end deftypefun
  274. @deftypefun int starpu_data_set_rank (starpu_data_handle_t @var{handle}, int @var{rank})
  275. Tell StarPU-MPI which MPI node "owns" a given data, that is, the node which will
  276. always keep an up-to-date value, and will by default execute tasks which write
  277. to it.
  278. @end deftypefun
  279. @deftypefun int starpu_data_get_rank (starpu_data_handle_t @var{handle})
  280. Returns the last value set by @code{starpu_data_set_rank}.
  281. @end deftypefun
  282. @defmac STARPU_EXECUTE_ON_NODE
  283. this macro is used when calling @code{starpu_mpi_insert_task}, and
  284. must be followed by a integer value which specified the node on which
  285. to execute the codelet.
  286. @end defmac
  287. @defmac STARPU_EXECUTE_ON_DATA
  288. this macro is used when calling @code{starpu_mpi_insert_task}, and
  289. must be followed by a data handle to specify that the node owning the
  290. given data will execute the codelet.
  291. @end defmac
  292. @deftypefun int starpu_mpi_insert_task (MPI_Comm @var{comm}, struct starpu_codelet *@var{codelet}, ...)
  293. Create and submit a task corresponding to @var{codelet} with the following
  294. arguments. The argument list must be zero-terminated.
  295. The arguments following the codelets are the same types as for the
  296. function @code{starpu_insert_task} defined in @ref{Insert Task
  297. Utility}. The extra argument @code{STARPU_EXECUTE_ON_NODE} followed by an
  298. integer allows to specify the MPI node to execute the codelet. It is also
  299. possible to specify that the node owning a specific data will execute
  300. the codelet, by using @code{STARPU_EXECUTE_ON_DATA} followed by a data
  301. handle.
  302. The internal algorithm is as follows:
  303. @enumerate
  304. @item Find out whether we (as an MPI node) are to execute the codelet
  305. because we own the data to be written to. If different nodes own data
  306. to be written to, the argument @code{STARPU_EXECUTE_ON_NODE} or
  307. @code{STARPU_EXECUTE_ON_DATA} has to be used to specify which MPI node will
  308. execute the task.
  309. @item Send and receive data as requested. Nodes owning data which need to be
  310. read by the task are sending them to the MPI node which will execute it. The
  311. latter receives them.
  312. @item Execute the codelet. This is done by the MPI node selected in the
  313. 1st step of the algorithm.
  314. @item In the case when different MPI nodes own data to be written to, send
  315. written data back to their owners.
  316. @end enumerate
  317. The algorithm also includes a communication cache mechanism that
  318. allows not to send data twice to the same MPI node, unless the data
  319. has been modified. The cache can be disabled
  320. (@pxref{STARPU_MPI_CACHE}).
  321. @end deftypefun
  322. @deftypefun void starpu_mpi_get_data_on_node (MPI_Comm @var{comm}, starpu_data_handle_t @var{data_handle}, int @var{node})
  323. Transfer data @var{data_handle} to MPI node @var{node}, sending it from its
  324. owner if needed. At least the target node and the owner have to call the
  325. function.
  326. @end deftypefun
  327. Here an stencil example showing how to use @code{starpu_mpi_insert_task}. One
  328. first needs to define a distribution function which specifies the
  329. locality of the data. Note that that distribution information needs to
  330. be given to StarPU by calling @code{starpu_data_set_rank}.
  331. @cartouche
  332. @smallexample
  333. /* Returns the MPI node number where data is */
  334. int my_distrib(int x, int y, int nb_nodes) @{
  335. /* Block distrib */
  336. return ((int)(x / sqrt(nb_nodes) + (y / sqrt(nb_nodes)) * sqrt(nb_nodes))) % nb_nodes;
  337. // /* Other examples useful for other kinds of computations */
  338. // /* / distrib */
  339. // return (x+y) % nb_nodes;
  340. // /* Block cyclic distrib */
  341. // unsigned side = sqrt(nb_nodes);
  342. // return x % side + (y % side) * size;
  343. @}
  344. @end smallexample
  345. @end cartouche
  346. Now the data can be registered within StarPU. Data which are not
  347. owned but will be needed for computations can be registered through
  348. the lazy allocation mechanism, i.e. with a @code{home_node} set to -1.
  349. StarPU will automatically allocate the memory when it is used for the
  350. first time.
  351. One can note an optimization here (the @code{else if} test): we only register
  352. data which will be needed by the tasks that we will execute.
  353. @cartouche
  354. @smallexample
  355. unsigned matrix[X][Y];
  356. starpu_data_handle_t data_handles[X][Y];
  357. for(x = 0; x < X; x++) @{
  358. for (y = 0; y < Y; y++) @{
  359. int mpi_rank = my_distrib(x, y, size);
  360. if (mpi_rank == my_rank)
  361. /* Owning data */
  362. starpu_variable_data_register(&data_handles[x][y], 0,
  363. (uintptr_t)&(matrix[x][y]), sizeof(unsigned));
  364. else if (my_rank == my_distrib(x+1, y, size) || my_rank == my_distrib(x-1, y, size)
  365. || my_rank == my_distrib(x, y+1, size) || my_rank == my_distrib(x, y-1, size))
  366. /* I don't own that index, but will need it for my computations */
  367. starpu_variable_data_register(&data_handles[x][y], -1,
  368. (uintptr_t)NULL, sizeof(unsigned));
  369. else
  370. /* I know it's useless to allocate anything for this */
  371. data_handles[x][y] = NULL;
  372. if (data_handles[x][y])
  373. starpu_data_set_rank(data_handles[x][y], mpi_rank);
  374. @}
  375. @}
  376. @end smallexample
  377. @end cartouche
  378. Now @code{starpu_mpi_insert_task()} can be called for the different
  379. steps of the application.
  380. @cartouche
  381. @smallexample
  382. for(loop=0 ; loop<niter; loop++)
  383. for (x = 1; x < X-1; x++)
  384. for (y = 1; y < Y-1; y++)
  385. starpu_mpi_insert_task(MPI_COMM_WORLD, &stencil5_cl,
  386. STARPU_RW, data_handles[x][y],
  387. STARPU_R, data_handles[x-1][y],
  388. STARPU_R, data_handles[x+1][y],
  389. STARPU_R, data_handles[x][y-1],
  390. STARPU_R, data_handles[x][y+1],
  391. 0);
  392. starpu_task_wait_for_all();
  393. @end smallexample
  394. @end cartouche
  395. I.e. all MPI nodes process the whole task graph, but as mentioned above, for
  396. each task, only the MPI node which owns the data being written to (here,
  397. @code{data_handles[x][y]}) will actually run the task. The other MPI nodes will
  398. automatically send the required data.
  399. This can be a concern with a growing number of nodes. To avoid this, the
  400. application can prune the task for loops according to the data distribution,
  401. so as to only submit tasks on nodes which have to care about them (either to
  402. execute them, or to send the required data).
  403. @node MPI Collective Operations
  404. @section MPI Collective Operations
  405. @deftypefun int starpu_mpi_scatter_detached (starpu_data_handle_t *@var{data_handles}, int @var{count}, int @var{root}, MPI_Comm @var{comm}, {void (*}@var{scallback})(void *), {void *}@var{sarg}, {void (*}@var{rcallback})(void *), {void *}@var{rarg})
  406. Scatter data among processes of the communicator based on the ownership of
  407. the data. For each data of the array @var{data_handles}, the
  408. process @var{root} sends the data to the process owning this data.
  409. Processes receiving data must have valid data handles to receive them.
  410. On completion of the collective communication, the @var{scallback} function is
  411. called with the argument @var{sarg} on the process @var{root}, the @var{rcallback} function is
  412. called with the argument @var{rarg} on any other process.
  413. @end deftypefun
  414. @deftypefun int starpu_mpi_gather_detached (starpu_data_handle_t *@var{data_handles}, int @var{count}, int @var{root}, MPI_Comm @var{comm}, {void (*}@var{scallback})(void *), {void *}@var{sarg}, {void (*}@var{rcallback})(void *), {void *}@var{rarg})
  415. Gather data from the different processes of the communicator onto the
  416. process @var{root}. Each process owning data handle in the array
  417. @var{data_handles} will send them to the process @var{root}. The
  418. process @var{root} must have valid data handles to receive the data.
  419. On completion of the collective communication, the @var{rcallback} function is
  420. called with the argument @var{rarg} on the process @var{root}, the @var{scallback} function is
  421. called with the argument @var{sarg} on any other process.
  422. @end deftypefun
  423. @page
  424. @cartouche
  425. @smallexample
  426. if (rank == root)
  427. @{
  428. /* Allocate the vector */
  429. vector = malloc(nblocks * sizeof(float *));
  430. for(x=0 ; x<nblocks ; x++)
  431. @{
  432. starpu_malloc((void **)&vector[x], block_size*sizeof(float));
  433. @}
  434. @}
  435. /* Allocate data handles and register data to StarPU */
  436. data_handles = malloc(nblocks*sizeof(starpu_data_handle_t *));
  437. for(x = 0; x < nblocks ; x++)
  438. @{
  439. int mpi_rank = my_distrib(x, nodes);
  440. if (rank == root) @{
  441. starpu_vector_data_register(&data_handles[x], 0, (uintptr_t)vector[x],
  442. blocks_size, sizeof(float));
  443. @}
  444. else if ((mpi_rank == rank) || ((rank == mpi_rank+1 || rank == mpi_rank-1))) @{
  445. /* I own that index, or i will need it for my computations */
  446. starpu_vector_data_register(&data_handles[x], -1, (uintptr_t)NULL,
  447. block_size, sizeof(float));
  448. @}
  449. else @{
  450. /* I know it's useless to allocate anything for this */
  451. data_handles[x] = NULL;
  452. @}
  453. if (data_handles[x]) @{
  454. starpu_data_set_rank(data_handles[x], mpi_rank);
  455. @}
  456. @}
  457. /* Scatter the matrix among the nodes */
  458. starpu_mpi_scatter_detached(data_handles, nblocks, root, MPI_COMM_WORLD);
  459. /* Calculation */
  460. for(x = 0; x < nblocks ; x++) @{
  461. if (data_handles[x]) @{
  462. int owner = starpu_data_get_rank(data_handles[x]);
  463. if (owner == rank) @{
  464. starpu_insert_task(&cl, STARPU_RW, data_handles[x], 0);
  465. @}
  466. @}
  467. @}
  468. /* Gather the matrix on main node */
  469. starpu_mpi_gather_detached(data_handles, nblocks, 0, MPI_COMM_WORLD);
  470. @end smallexample
  471. @end cartouche