mpi-support.texi 16 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412413414415416417418419420421422423424425426427428429430431
  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. * MPI Insert Task Utility::
  22. * MPI Collective Operations::
  23. @end menu
  24. @node The API
  25. @section The API
  26. @subsection Compilation
  27. The flags required to compile or link against the MPI layer are then
  28. accessible with the following commands:
  29. @example
  30. % pkg-config --cflags libstarpumpi-1.0 # options for the compiler
  31. % pkg-config --libs libstarpumpi-1.0 # options for the linker
  32. @end example
  33. Also pass the @code{--static} option if the application is to be linked statically.
  34. @subsection Initialisation
  35. @deftypefun int starpu_mpi_initialize (void)
  36. Initializes the starpumpi library. This must be called between calling
  37. @code{starpu_init} and other @code{starpu_mpi} functions. This
  38. function does not call @code{MPI_Init}, it should be called beforehand.
  39. @end deftypefun
  40. @deftypefun int starpu_mpi_initialize_extended (int *@var{rank}, int *@var{world_size})
  41. Initializes the starpumpi library. This must be called between calling
  42. @code{starpu_init} and other @code{starpu_mpi} functions.
  43. This function calls @code{MPI_Init}, and therefore should be prefered
  44. to the previous one for MPI implementations which are not thread-safe.
  45. Returns the current MPI node rank and world size.
  46. @end deftypefun
  47. @deftypefun int starpu_mpi_shutdown (void)
  48. Cleans the starpumpi library. This must be called between calling
  49. @code{starpu_mpi} functions and @code{starpu_shutdown}.
  50. @code{MPI_Finalize} will be called if StarPU-MPI has been initialized
  51. by calling @code{starpu_mpi_initialize_extended}.
  52. @end deftypefun
  53. @subsection Communication
  54. @deftypefun int starpu_mpi_send (starpu_data_handle_t @var{data_handle}, int @var{dest}, int @var{mpi_tag}, MPI_Comm @var{comm})
  55. @end deftypefun
  56. @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})
  57. @end deftypefun
  58. @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})
  59. @end deftypefun
  60. @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})
  61. @end deftypefun
  62. @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})
  63. @end deftypefun
  64. @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})
  65. @end deftypefun
  66. @deftypefun int starpu_mpi_wait (starpu_mpi_req *@var{req}, MPI_Status *@var{status})
  67. @end deftypefun
  68. @deftypefun int starpu_mpi_test (starpu_mpi_req *@var{req}, int *@var{flag}, MPI_Status *@var{status})
  69. @end deftypefun
  70. @deftypefun int starpu_mpi_barrier (MPI_Comm @var{comm})
  71. @end deftypefun
  72. @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})
  73. When the transfer is completed, the tag is unlocked
  74. @end deftypefun
  75. @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})
  76. @end deftypefun
  77. @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})
  78. Asynchronously send an array of buffers, and unlocks the tag once all
  79. of them are transmitted.
  80. @end deftypefun
  81. @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})
  82. @end deftypefun
  83. @page
  84. @node Simple Example
  85. @section Simple Example
  86. @cartouche
  87. @smallexample
  88. void increment_token(void)
  89. @{
  90. struct starpu_task *task = starpu_task_create();
  91. task->cl = &increment_cl;
  92. task->handles[0] = token_handle;
  93. starpu_task_submit(task);
  94. @}
  95. @end smallexample
  96. @end cartouche
  97. @cartouche
  98. @smallexample
  99. int main(int argc, char **argv)
  100. @{
  101. int rank, size;
  102. starpu_init(NULL);
  103. starpu_mpi_initialize_extended(&rank, &size);
  104. starpu_vector_data_register(&token_handle, 0, (uintptr_t)&token, 1, sizeof(unsigned));
  105. unsigned nloops = NITER;
  106. unsigned loop;
  107. unsigned last_loop = nloops - 1;
  108. unsigned last_rank = size - 1;
  109. @end smallexample
  110. @end cartouche
  111. @cartouche
  112. @smallexample
  113. for (loop = 0; loop < nloops; loop++) @{
  114. int tag = loop*size + rank;
  115. if (loop == 0 && rank == 0)
  116. @{
  117. token = 0;
  118. fprintf(stdout, "Start with token value %d\n", token);
  119. @}
  120. else
  121. @{
  122. starpu_mpi_irecv_detached(token_handle, (rank+size-1)%size, tag,
  123. MPI_COMM_WORLD, NULL, NULL);
  124. @}
  125. increment_token();
  126. if (loop == last_loop && rank == last_rank)
  127. @{
  128. starpu_data_acquire(token_handle, STARPU_R);
  129. fprintf(stdout, "Finished: token value %d\n", token);
  130. starpu_data_release(token_handle);
  131. @}
  132. else
  133. @{
  134. starpu_mpi_isend_detached(token_handle, (rank+1)%size, tag+1,
  135. MPI_COMM_WORLD, NULL, NULL);
  136. @}
  137. @}
  138. starpu_task_wait_for_all();
  139. @end smallexample
  140. @end cartouche
  141. @cartouche
  142. @smallexample
  143. starpu_mpi_shutdown();
  144. starpu_shutdown();
  145. if (rank == last_rank)
  146. @{
  147. fprintf(stderr, "[%d] token = %d == %d * %d ?\n", rank, token, nloops, size);
  148. STARPU_ASSERT(token == nloops*size);
  149. @}
  150. @end smallexample
  151. @end cartouche
  152. @page
  153. @node MPI Insert Task Utility
  154. @section MPI Insert Task Utility
  155. To save the programmer from having to explicit all communications, StarPU
  156. provides an "MPI Insert Task Utility". The principe is that the application
  157. decides a distribution of the data over the MPI nodes by allocating it and
  158. notifying StarPU of that decision, i.e. tell StarPU which MPI node "owns" which
  159. data. All MPI nodes then process the whole task graph, and StarPU automatically
  160. determines which node actually execute which task, as well as the required MPI
  161. transfers.
  162. @deftypefun int starpu_data_set_tag (starpu_data_handle_t @var{handle}, int @var{tag})
  163. Tell StarPU-MPI which MPI tag to use when exchanging the data.
  164. @end deftypefun
  165. @deftypefun int starpu_data_get_tag (starpu_data_handle_t @var{handle})
  166. Returns the MPI tag to be used when exchanging the data.
  167. @end deftypefun
  168. @deftypefun int starpu_data_set_rank (starpu_data_handle_t @var{handle}, int @var{rank})
  169. Tell StarPU-MPI which MPI node "owns" a given data, that is, the node which will
  170. always keep an up-to-date value, and will by default execute tasks which write
  171. to it.
  172. @end deftypefun
  173. @deftypefun int starpu_data_get_rank (starpu_data_handle_t @var{handle})
  174. Returns the last value set by @code{starpu_data_set_rank}.
  175. @end deftypefun
  176. @defmac STARPU_EXECUTE_ON_NODE
  177. this macro is used when calling @code{starpu_mpi_insert_task}, and
  178. must be followed by a integer value which specified the node on which
  179. to execute the codelet.
  180. @end defmac
  181. @defmac STARPU_EXECUTE_ON_DATA
  182. this macro is used when calling @code{starpu_mpi_insert_task}, and
  183. must be followed by a data handle to specify that the node owning the
  184. given data will execute the codelet.
  185. @end defmac
  186. @deftypefun int starpu_mpi_insert_task (MPI_Comm @var{comm}, struct starpu_codelet *@var{codelet}, ...)
  187. Create and submit a task corresponding to @var{codelet} with the following
  188. arguments. The argument list must be zero-terminated.
  189. The arguments following the codelets are the same types as for the
  190. function @code{starpu_insert_task} defined in @ref{Insert Task
  191. Utility}. The extra argument @code{STARPU_EXECUTE_ON_NODE} followed by an
  192. integer allows to specify the MPI node to execute the codelet. It is also
  193. possible to specify that the node owning a specific data will execute
  194. the codelet, by using @code{STARPU_EXECUTE_ON_DATA} followed by a data
  195. handle.
  196. The internal algorithm is as follows:
  197. @enumerate
  198. @item Find out whether we (as an MPI node) are to execute the codelet
  199. because we own the data to be written to. If different nodes own data
  200. to be written to, the argument @code{STARPU_EXECUTE_ON_NODE} or
  201. @code{STARPU_EXECUTE_ON_DATA} has to be used to specify which MPI node will
  202. execute the task.
  203. @item Send and receive data as requested. Nodes owning data which need to be
  204. read by the task are sending them to the MPI node which will execute it. The
  205. latter receives them.
  206. @item Execute the codelet. This is done by the MPI node selected in the
  207. 1st step of the algorithm.
  208. @item In the case when different MPI nodes own data to be written to, send
  209. written data back to their owners.
  210. @end enumerate
  211. The algorithm also includes a cache mechanism that allows not to send
  212. data twice to the same MPI node, unless the data has been modified.
  213. @end deftypefun
  214. @deftypefun void starpu_mpi_get_data_on_node (MPI_Comm @var{comm}, starpu_data_handle_t @var{data_handle}, int @var{node})
  215. todo
  216. @end deftypefun
  217. Here an stencil example showing how to use @code{starpu_mpi_insert_task}. One
  218. first needs to define a distribution function which specifies the
  219. locality of the data. Note that that distribution information needs to
  220. be given to StarPU by calling @code{starpu_data_set_rank}.
  221. @cartouche
  222. @smallexample
  223. /* Returns the MPI node number where data is */
  224. int my_distrib(int x, int y, int nb_nodes) @{
  225. /* Block distrib */
  226. return ((int)(x / sqrt(nb_nodes) + (y / sqrt(nb_nodes)) * sqrt(nb_nodes))) % nb_nodes;
  227. // /* Other examples useful for other kinds of computations */
  228. // /* / distrib */
  229. // return (x+y) % nb_nodes;
  230. // /* Block cyclic distrib */
  231. // unsigned side = sqrt(nb_nodes);
  232. // return x % side + (y % side) * size;
  233. @}
  234. @end smallexample
  235. @end cartouche
  236. Now the data can be registered within StarPU. Data which are not
  237. owned but will be needed for computations can be registered through
  238. the lazy allocation mechanism, i.e. with a @code{home_node} set to -1.
  239. StarPU will automatically allocate the memory when it is used for the
  240. first time.
  241. One can note an optimization here (the @code{else if} test): we only register
  242. data which will be needed by the tasks that we will execute.
  243. @cartouche
  244. @smallexample
  245. unsigned matrix[X][Y];
  246. starpu_data_handle_t data_handles[X][Y];
  247. for(x = 0; x < X; x++) @{
  248. for (y = 0; y < Y; y++) @{
  249. int mpi_rank = my_distrib(x, y, size);
  250. if (mpi_rank == my_rank)
  251. /* Owning data */
  252. starpu_variable_data_register(&data_handles[x][y], 0,
  253. (uintptr_t)&(matrix[x][y]), sizeof(unsigned));
  254. else if (my_rank == my_distrib(x+1, y, size) || my_rank == my_distrib(x-1, y, size)
  255. || my_rank == my_distrib(x, y+1, size) || my_rank == my_distrib(x, y-1, size))
  256. /* I don't own that index, but will need it for my computations */
  257. starpu_variable_data_register(&data_handles[x][y], -1,
  258. (uintptr_t)NULL, sizeof(unsigned));
  259. else
  260. /* I know it's useless to allocate anything for this */
  261. data_handles[x][y] = NULL;
  262. if (data_handles[x][y])
  263. starpu_data_set_rank(data_handles[x][y], mpi_rank);
  264. @}
  265. @}
  266. @end smallexample
  267. @end cartouche
  268. Now @code{starpu_mpi_insert_task()} can be called for the different
  269. steps of the application.
  270. @cartouche
  271. @smallexample
  272. for(loop=0 ; loop<niter; loop++)
  273. for (x = 1; x < X-1; x++)
  274. for (y = 1; y < Y-1; y++)
  275. starpu_mpi_insert_task(MPI_COMM_WORLD, &stencil5_cl,
  276. STARPU_RW, data_handles[x][y],
  277. STARPU_R, data_handles[x-1][y],
  278. STARPU_R, data_handles[x+1][y],
  279. STARPU_R, data_handles[x][y-1],
  280. STARPU_R, data_handles[x][y+1],
  281. 0);
  282. starpu_task_wait_for_all();
  283. @end smallexample
  284. @end cartouche
  285. I.e. all MPI nodes process the whole task graph, but as mentioned above, for
  286. each task, only the MPI node which owns the data being written to (here,
  287. @code{data_handles[x][y]}) will actually run the task. The other MPI nodes will
  288. automatically send the required data.
  289. @node MPI Collective Operations
  290. @section MPI Collective Operations
  291. @deftypefun int starpu_mpi_scatter_detached (starpu_data_handle_t *@var{data_handles}, int @var{count}, int @var{root}, MPI_Comm @var{comm})
  292. Scatter data among processes of the communicator based on the ownership of
  293. the data. For each data of the array @var{data_handles}, the
  294. process @var{root} sends the data to the process owning this data.
  295. Processes receiving data must have valid data handles to receive them.
  296. @end deftypefun
  297. @deftypefun int starpu_mpi_gather_detached (starpu_data_handle_t *@var{data_handles}, int @var{count}, int @var{root}, MPI_Comm @var{comm})
  298. Gather data from the different processes of the communicator onto the
  299. process @var{root}. Each process owning data handle in the array
  300. @var{data_handles} will send them to the process @var{root}. The
  301. process @var{root} must have valid data handles to receive the data.
  302. @end deftypefun
  303. @page
  304. @cartouche
  305. @smallexample
  306. if (rank == root)
  307. @{
  308. /* Allocate the vector */
  309. vector = malloc(nblocks * sizeof(float *));
  310. for(x=0 ; x<nblocks ; x++)
  311. @{
  312. starpu_malloc((void **)&vector[x], block_size*sizeof(float));
  313. @}
  314. @}
  315. /* Allocate data handles and register data to StarPU */
  316. data_handles = malloc(nblocks*sizeof(starpu_data_handle_t *));
  317. for(x = 0; x < nblocks ; x++)
  318. @{
  319. int mpi_rank = my_distrib(x, nodes);
  320. if (rank == root) @{
  321. starpu_vector_data_register(&data_handles[x], 0, (uintptr_t)vector[x],
  322. blocks_size, sizeof(float));
  323. @}
  324. else if ((mpi_rank == rank) || ((rank == mpi_rank+1 || rank == mpi_rank-1))) @{
  325. /* I own that index, or i will need it for my computations */
  326. starpu_vector_data_register(&data_handles[x], -1, (uintptr_t)NULL,
  327. block_size, sizeof(float));
  328. @}
  329. else @{
  330. /* I know it's useless to allocate anything for this */
  331. data_handles[x] = NULL;
  332. @}
  333. if (data_handles[x]) @{
  334. starpu_data_set_rank(data_handles[x], mpi_rank);
  335. @}
  336. @}
  337. /* Scatter the matrix among the nodes */
  338. starpu_mpi_scatter_detached(data_handles, nblocks, root, MPI_COMM_WORLD);
  339. /* Calculation */
  340. for(x = 0; x < nblocks ; x++) @{
  341. if (data_handles[x]) @{
  342. int owner = starpu_data_get_rank(data_handles[x]);
  343. if (owner == rank) @{
  344. starpu_insert_task(&cl, STARPU_RW, data_handles[x], 0);
  345. @}
  346. @}
  347. @}
  348. /* Gather the matrix on main node */
  349. starpu_mpi_gather_detached(data_handles, nblocks, 0, MPI_COMM_WORLD);
  350. @end smallexample
  351. @end cartouche