data_management.doxy 17 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338
  1. /*
  2. * This file is part of the StarPU Handbook.
  3. * Copyright (C) 2009--2011 Universit@'e de Bordeaux
  4. * Copyright (C) 2010, 2011, 2012, 2013, 2014, 2015 CNRS
  5. * Copyright (C) 2011, 2012 INRIA
  6. * See the file version.doxy for copying conditions.
  7. */
  8. /*! \defgroup API_Data_Management Data Management
  9. \brief This section describes the data management facilities provided
  10. by StarPU. We show how to use existing data interfaces in \ref
  11. API_Data_Interfaces, but developers can design their own data interfaces if
  12. required.
  13. \typedef starpu_data_handle_t
  14. \ingroup API_Data_Management
  15. StarPU uses ::starpu_data_handle_t as an opaque handle to
  16. manage a piece of data. Once a piece of data has been registered to
  17. StarPU, it is associated to a ::starpu_data_handle_t which keeps track
  18. of the state of the piece of data over the entire machine, so that we
  19. can maintain data consistency and locate data replicates for instance.
  20. \typedef starpu_arbiter_t
  21. \ingroup API_Data_Management
  22. This is an arbiter, which implements an advanced but centralized management of
  23. concurrent data accesses, see \ref ConcurrentDataAccess for the details.
  24. \enum starpu_data_access_mode
  25. \ingroup API_Data_Management
  26. This datatype describes a data access mode.
  27. \var starpu_data_access_mode::STARPU_NONE
  28. \ingroup API_Data_Management
  29. TODO
  30. \var starpu_data_access_mode::STARPU_R
  31. \ingroup API_Data_Management
  32. read-only mode.
  33. \var starpu_data_access_mode::STARPU_W
  34. \ingroup API_Data_Management
  35. write-only mode.
  36. \var starpu_data_access_mode::STARPU_RW
  37. \ingroup API_Data_Management
  38. read-write mode. This is equivalent to ::STARPU_R|::STARPU_W
  39. \var starpu_data_access_mode::STARPU_SCRATCH
  40. \ingroup API_Data_Management
  41. A temporary buffer is allocated for the task, but StarPU does not
  42. enforce data consistency---i.e. each device has its own buffer,
  43. independently from each other (even for CPUs), and no data transfer is
  44. ever performed. This is useful for temporary variables to avoid
  45. allocating/freeing buffers inside each task. Currently, no behavior is
  46. defined concerning the relation with the ::STARPU_R and ::STARPU_W modes
  47. and the value provided at registration --- i.e., the value of the
  48. scratch buffer is undefined at entry of the codelet function. It is
  49. being considered for future extensions at least to define the initial
  50. value. For now, data to be used in ::STARPU_SCRATCH mode should be
  51. registered with node <c>-1</c> and a <c>NULL</c> pointer, since the
  52. value of the provided buffer is simply ignored for now.
  53. \var starpu_data_access_mode::STARPU_REDUX
  54. \ingroup API_Data_Management
  55. todo
  56. \var starpu_data_access_mode::STARPU_COMMUTE
  57. \ingroup API_Data_Management
  58. In addition to that, ::STARPU_COMMUTE can be passed along ::STARPU_W
  59. or ::STARPU_RW to express that StarPU can let tasks commute, which is
  60. useful e.g. when bringing a contribution into some data, which can be
  61. done in any order (but still require sequential consistency against
  62. reads or non-commutative writes).
  63. \var starpu_data_access_mode::STARPU_SSEND
  64. \ingroup API_Data_Management
  65. used in starpu_mpi_insert_task() to specify the data has to be sent
  66. using a synchronous and non-blocking mode (see starpu_mpi_issend())
  67. @name Basic Data Management API
  68. \ingroup API_Data_Management
  69. Data management is done at a high-level in StarPU: rather than
  70. accessing a mere list of contiguous buffers, the tasks may manipulate
  71. data that are described by a high-level construct which we call data
  72. interface.
  73. An example of data interface is the "vector" interface which describes
  74. a contiguous data array on a spefic memory node. This interface is a
  75. simple structure containing the number of elements in the array, the
  76. size of the elements, and the address of the array in the appropriate
  77. address space (this address may be invalid if there is no valid copy
  78. of the array in the memory node). More informations on the data
  79. interfaces provided by StarPU are given in \ref API_Data_Interfaces.
  80. When a piece of data managed by StarPU is used by a task, the task
  81. implementation is given a pointer to an interface describing a valid
  82. copy of the data that is accessible from the current processing unit.
  83. Every worker is associated to a memory node which is a logical
  84. abstraction of the address space from which the processing unit gets
  85. its data. For instance, the memory node associated to the different
  86. CPU workers represents main memory (RAM), the memory node associated
  87. to a GPU is DRAM embedded on the device. Every memory node is
  88. identified by a logical index which is accessible from the
  89. function starpu_worker_get_memory_node(). When registering a piece of
  90. data to StarPU, the specified memory node indicates where the piece of
  91. data initially resides (we also call this memory node the home node of
  92. a piece of data).
  93. \fn void starpu_data_register(starpu_data_handle_t *handleptr, unsigned home_node, void *data_interface, struct starpu_data_interface_ops *ops)
  94. \ingroup API_Data_Management
  95. Register a piece of data into the handle located at the
  96. \p handleptr address. The \p data_interface buffer contains the initial
  97. description of the data in the \p home_node. The \p ops argument is a
  98. pointer to a structure describing the different methods used to
  99. manipulate this type of interface. See starpu_data_interface_ops for
  100. more details on this structure.
  101. If \p home_node is -1, StarPU will automatically allocate the memory when
  102. it is used for the first time in write-only mode. Once such data
  103. handle has been automatically allocated, it is possible to access it
  104. using any access mode.
  105. Note that StarPU supplies a set of predefined types of interface (e.g.
  106. vector or matrix) which can be registered by the means of helper
  107. functions (e.g. starpu_vector_data_register() or
  108. starpu_matrix_data_register()).
  109. \fn void starpu_data_ptr_register(starpu_data_handle_t handle, unsigned node)
  110. \ingroup API_Data_Management
  111. Register that a buffer for \p handle on \p node will be set. This is typically
  112. used by starpu_*_ptr_register helpers before setting the interface pointers for
  113. this node, to tell the core that that is now allocated.
  114. \fn void starpu_data_register_same(starpu_data_handle_t *handledst, starpu_data_handle_t handlesrc)
  115. \ingroup API_Data_Management
  116. Register a new piece of data into the handle \p handledst with the
  117. same interface as the handle \p handlesrc.
  118. \fn void starpu_data_unregister(starpu_data_handle_t handle)
  119. \ingroup API_Data_Management
  120. This function unregisters a data handle from StarPU. If the
  121. data was automatically allocated by StarPU because the home node was
  122. -1, all automatically allocated buffers are freed. Otherwise, a valid
  123. copy of the data is put back into the home node in the buffer that was
  124. initially registered. Using a data handle that has been unregistered
  125. from StarPU results in an undefined behaviour. In case we do not need
  126. to update the value of the data in the home node, we can use
  127. the function starpu_data_unregister_no_coherency() instead.
  128. \fn void starpu_data_unregister_no_coherency(starpu_data_handle_t handle)
  129. \ingroup API_Data_Management
  130. This is the same as starpu_data_unregister(), except that
  131. StarPU does not put back a valid copy into the home node, in the
  132. buffer that was initially registered.
  133. \fn void starpu_data_unregister_submit(starpu_data_handle_t handle)
  134. \ingroup API_Data_Management
  135. Destroy the data handle once it is not needed anymore by any
  136. submitted task. No coherency is assumed.
  137. \fn void starpu_data_invalidate(starpu_data_handle_t handle)
  138. \ingroup API_Data_Management
  139. Destroy all replicates of the data handle immediately. After
  140. data invalidation, the first access to the handle must be performed in
  141. write-only mode. Accessing an invalidated data in read-mode results in
  142. undefined behaviour.
  143. \fn void starpu_data_invalidate_submit(starpu_data_handle_t handle)
  144. \ingroup API_Data_Management
  145. Submits invalidation of the data handle after completion of
  146. previously submitted tasks.
  147. \fn void starpu_data_set_wt_mask(starpu_data_handle_t handle, uint32_t wt_mask)
  148. \ingroup API_Data_Management
  149. This function sets the write-through mask of a given data (and
  150. its children), i.e. a bitmask of nodes where the data should be always
  151. replicated after modification. It also prevents the data from being
  152. evicted from these nodes when memory gets scarse. When the data is
  153. modified, it is automatically transfered into those memory node. For
  154. instance a <c>1<<0</c> write-through mask means that the CUDA workers
  155. will commit their changes in main memory (node 0).
  156. \fn int starpu_data_fetch_on_node(starpu_data_handle_t handle, unsigned node, unsigned async)
  157. \ingroup API_Data_Management
  158. Issue a fetch request for a given data to a given node, i.e.
  159. requests that the data be replicated to the given node as soon as possible, so that it is
  160. available there for tasks. If the \p async parameter is 0, the call will
  161. block until the transfer is achieved, else the call will return immediately,
  162. after having just queued the request. In the latter case, the request will
  163. asynchronously wait for the completion of any task writing on the data.
  164. \fn int starpu_data_prefetch_on_node(starpu_data_handle_t handle, unsigned node, unsigned async)
  165. \ingroup API_Data_Management
  166. Issue a prefetch request for a given data to a given node, i.e.
  167. requests that the data be replicated to the given node when there is room for it, so that it is
  168. available there for tasks. If the \p async parameter is 0, the call will
  169. block until the transfer is achieved, else the call will return immediately,
  170. after having just queued the request. In the latter case, the request will
  171. asynchronously wait for the completion of any task writing on the data.
  172. \fn int starpu_data_idle_prefetch_on_node(starpu_data_handle_t handle, unsigned node, unsigned async)
  173. \ingroup API_Data_Management
  174. Issue an idle prefetch request for a given data to a given node, i.e.
  175. requests that the data be replicated to the given node, so that it is
  176. available there for tasks, but only when the bus is really idle. If the \p async parameter is 0, the call will
  177. block until the transfer is achieved, else the call will return immediately,
  178. after having just queued the request. In the latter case, the request will
  179. asynchronously wait for the completion of any task writing on the data.
  180. \fn void starpu_data_wont_use(starpu_data_handle_t handle)
  181. \ingroup API_Data_Management
  182. Advise StarPU that this handle will not be used in the close future, and is
  183. thus a good candidate for eviction from GPUs. StarPU will thus write its value
  184. back to its home node when the bus is idle, and select this data in priority
  185. for eviction when memory gets low.
  186. \fn starpu_data_handle_t starpu_data_lookup(const void *ptr)
  187. \ingroup API_Data_Management
  188. Return the handle corresponding to the data pointed to by the \p ptr host pointer.
  189. \fn int starpu_data_request_allocation(starpu_data_handle_t handle, unsigned node)
  190. \ingroup API_Data_Management
  191. Explicitly ask StarPU to allocate room for a piece of data on
  192. the specified memory node.
  193. \fn void starpu_data_query_status(starpu_data_handle_t handle, int memory_node, int *is_allocated, int *is_valid, int *is_requested)
  194. \ingroup API_Data_Management
  195. Query the status of \p handle on the specified \p memory_node.
  196. \fn void starpu_data_advise_as_important(starpu_data_handle_t handle, unsigned is_important)
  197. \ingroup API_Data_Management
  198. This function allows to specify that a piece of data can be
  199. discarded without impacting the application.
  200. \fn void starpu_data_set_reduction_methods(starpu_data_handle_t handle, struct starpu_codelet *redux_cl, struct starpu_codelet *init_cl)
  201. \ingroup API_Data_Management
  202. This sets the codelets to be used for \p handle when it is
  203. accessed in the mode ::STARPU_REDUX. Per-worker buffers will be initialized with
  204. the codelet \p init_cl, and reduction between per-worker buffers will be
  205. done with the codelet \p redux_cl.
  206. \fn struct starpu_data_interface_ops* starpu_data_get_interface_ops(starpu_data_handle_t handle)
  207. \ingroup API_Data_Management
  208. todo
  209. @name Access registered data from the application
  210. \ingroup API_Data_Management
  211. \fn int starpu_data_acquire(starpu_data_handle_t handle, enum starpu_data_access_mode mode)
  212. \ingroup API_Data_Management
  213. The application must call this function prior to accessing
  214. registered data from main memory outside tasks. StarPU ensures that
  215. the application will get an up-to-date copy of the data in main memory
  216. located where the data was originally registered, and that all
  217. concurrent accesses (e.g. from tasks) will be consistent with the
  218. access mode specified in the mode argument. starpu_data_release() must
  219. be called once the application does not need to access the piece of
  220. data anymore. Note that implicit data dependencies are also enforced
  221. by starpu_data_acquire(), i.e. starpu_data_acquire() will wait for all
  222. tasks scheduled to work on the data, unless they have been disabled
  223. explictly by calling starpu_data_set_default_sequential_consistency_flag() or
  224. starpu_data_set_sequential_consistency_flag(). starpu_data_acquire() is a
  225. blocking call, so that it cannot be called from tasks or from their
  226. callbacks (in that case, starpu_data_acquire() returns <c>-EDEADLK</c>). Upon
  227. successful completion, this function returns 0.
  228. \fn int starpu_data_acquire_cb(starpu_data_handle_t handle, enum starpu_data_access_mode mode, void (*callback)(void *), void *arg)
  229. \ingroup API_Data_Management
  230. Asynchronous equivalent of starpu_data_acquire(). When the data
  231. specified in \p handle is available in the appropriate access
  232. mode, the \p callback function is executed. The application may access
  233. the requested data during the execution of this \p callback. The \p callback
  234. function must call starpu_data_release() once the application does not
  235. need to access the piece of data anymore. Note that implicit data
  236. dependencies are also enforced by starpu_data_acquire_cb() in case they
  237. are not disabled. Contrary to starpu_data_acquire(), this function is
  238. non-blocking and may be called from task callbacks. Upon successful
  239. completion, this function returns 0.
  240. \fn int starpu_data_acquire_cb_sequential_consistency(starpu_data_handle_t handle, enum starpu_data_access_mode mode, void (*callback)(void *), void *arg, int sequential_consistency)
  241. \ingroup API_Data_Management
  242. Equivalent of starpu_data_acquire_cb() with the possibility of enabling or disabling data dependencies.
  243. When the data specified in \p handle is available in the appropriate access
  244. mode, the \p callback function is executed. The application may access
  245. the requested data during the execution of this \p callback. The \p callback
  246. function must call starpu_data_release() once the application does not
  247. need to access the piece of data anymore. Note that implicit data
  248. dependencies are also enforced by starpu_data_acquire_cb_sequential_consistency() in case they
  249. are not disabled specifically for the given \p handle or by the parameter \p sequential_consistency.
  250. Similarly to starpu_data_acquire_cb(), this function is
  251. non-blocking and may be called from task callbacks. Upon successful
  252. completion, this function returns 0.
  253. \fn int starpu_data_acquire_on_node(starpu_data_handle_t handle, int node, enum starpu_data_access_mode mode)
  254. \ingroup API_Data_Management
  255. This is the same as starpu_data_acquire(), except that the data
  256. will be available on the given memory node instead of main memory.
  257. \fn int starpu_data_acquire_on_node_cb(starpu_data_handle_t handle, int node, enum starpu_data_access_mode mode, void (*callback)(void *), void *arg)
  258. \ingroup API_Data_Management
  259. This is the same as starpu_data_acquire_cb(), except that the
  260. data will be available on the given memory node instead of main
  261. memory.
  262. \fn int starpu_data_acquire_on_node_cb_sequential_consistency(starpu_data_handle_t handle, int node, enum starpu_data_access_mode mode, void (*callback)(void *), void *arg, int sequential_consistency)
  263. \ingroup API_Data_Management
  264. This is the same as starpu_data_acquire_cb_sequential_consistency(), except that the
  265. data will be available on the given memory node instead of main
  266. memory.
  267. \def STARPU_DATA_ACQUIRE_CB(handle, mode, code)
  268. \ingroup API_Data_Management
  269. STARPU_DATA_ACQUIRE_CB() is the same as starpu_data_acquire_cb(),
  270. except that the code to be executed in a callback is directly provided
  271. as a macro parameter, and the data \p handle is automatically released
  272. after it. This permits to easily execute code which depends on the
  273. value of some registered data. This is non-blocking too and may be
  274. called from task callbacks.
  275. \fn void starpu_data_release(starpu_data_handle_t handle)
  276. \ingroup API_Data_Management
  277. This function releases the piece of data acquired by the
  278. application either by starpu_data_acquire() or by
  279. starpu_data_acquire_cb().
  280. \fn void starpu_data_release_on_node(starpu_data_handle_t handle, int node)
  281. \ingroup API_Data_Management
  282. This is the same as starpu_data_release(), except that the data
  283. will be available on the given memory \p node instead of main memory.
  284. \fn starpu_arbiter_t starpu_arbiter_create(void)
  285. \ingroup API_Data_Management
  286. This creates a data access arbiter, see \ref ConcurrentDataAccess for the details
  287. \fn void starpu_data_assign_arbiter(starpu_data_handle_t handle, starpu_arbiter_t arbiter)
  288. \ingroup API_Data_Management
  289. This makes accesses to \p handle managed by \p arbiter
  290. \fn void starpu_arbiter_destroy(starpu_arbiter_t arbiter)
  291. \ingroup API_Data_Management
  292. This destroys the \p arbiter . This must only be called after all data assigned
  293. to it have been unregistered.
  294. */