starpu_mpi_cache.c 8.0 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293
  1. /* StarPU --- Runtime system for heterogeneous multicore architectures.
  2. *
  3. * Copyright (C) 2011, 2012, 2013, 2014, 2015 Centre National de la Recherche Scientifique
  4. * Copyright (C) 2011-2014 Université de Bordeaux
  5. * Copyright (C) 2014 INRIA
  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 <starpu.h>
  19. #include <common/uthash.h>
  20. #include <datawizard/coherency.h>
  21. #include <starpu_mpi_cache.h>
  22. #include <starpu_mpi_cache_stats.h>
  23. #include <starpu_mpi_private.h>
  24. /* Whether we are allowed to keep copies of remote data. */
  25. struct _starpu_data_entry
  26. {
  27. UT_hash_handle hh;
  28. void *data;
  29. };
  30. static struct _starpu_data_entry **_cache_sent_data = NULL;
  31. static struct _starpu_data_entry **_cache_received_data = NULL;
  32. int _starpu_cache_enabled=1;
  33. int starpu_mpi_cache_is_enabled()
  34. {
  35. return _starpu_cache_enabled==1;
  36. }
  37. int starpu_mpi_cache_set(int enabled)
  38. {
  39. if (enabled == 1)
  40. {
  41. _starpu_cache_enabled = 1;
  42. }
  43. else
  44. {
  45. if (_starpu_cache_enabled)
  46. {
  47. // We need to clean the cache
  48. int world_size;
  49. starpu_mpi_cache_flush_all_data(MPI_COMM_WORLD);
  50. MPI_Comm_size(MPI_COMM_WORLD, &world_size);
  51. _starpu_mpi_cache_free(world_size);
  52. }
  53. _starpu_cache_enabled = 0;
  54. }
  55. return 0;
  56. }
  57. void _starpu_mpi_cache_init(MPI_Comm comm)
  58. {
  59. int nb_nodes;
  60. int i;
  61. _starpu_cache_enabled = starpu_get_env_number("STARPU_MPI_CACHE");
  62. if (_starpu_cache_enabled == -1)
  63. {
  64. _starpu_cache_enabled = 1;
  65. }
  66. if (_starpu_cache_enabled == 0)
  67. {
  68. if (!_starpu_silent) fprintf(stderr,"Warning: StarPU MPI Communication cache is disabled\n");
  69. return;
  70. }
  71. MPI_Comm_size(comm, &nb_nodes);
  72. _STARPU_MPI_DEBUG(2, "Initialising htable for cache\n");
  73. _cache_sent_data = malloc(nb_nodes * sizeof(struct _starpu_data_entry *));
  74. for(i=0 ; i<nb_nodes ; i++) _cache_sent_data[i] = NULL;
  75. _cache_received_data = malloc(nb_nodes * sizeof(struct _starpu_data_entry *));
  76. for(i=0 ; i<nb_nodes ; i++) _cache_received_data[i] = NULL;
  77. _starpu_mpi_cache_stats_init(comm);
  78. }
  79. static
  80. void _starpu_mpi_cache_empty_tables(int world_size)
  81. {
  82. int i;
  83. if (_starpu_cache_enabled == 0) return;
  84. _STARPU_MPI_DEBUG(2, "Clearing htable for cache\n");
  85. for(i=0 ; i<world_size ; i++)
  86. {
  87. struct _starpu_data_entry *entry, *tmp;
  88. HASH_ITER(hh, _cache_sent_data[i], entry, tmp)
  89. {
  90. HASH_DEL(_cache_sent_data[i], entry);
  91. free(entry);
  92. }
  93. HASH_ITER(hh, _cache_received_data[i], entry, tmp)
  94. {
  95. HASH_DEL(_cache_received_data[i], entry);
  96. _starpu_mpi_cache_stats_dec(i, (starpu_data_handle_t) entry->data);
  97. free(entry);
  98. }
  99. }
  100. }
  101. void _starpu_mpi_cache_free(int world_size)
  102. {
  103. if (_starpu_cache_enabled == 0) return;
  104. _starpu_mpi_cache_empty_tables(world_size);
  105. free(_cache_sent_data);
  106. free(_cache_received_data);
  107. _starpu_mpi_cache_stats_free();
  108. }
  109. void _starpu_mpi_cache_sent_data_clear(starpu_data_handle_t data)
  110. {
  111. int n, size;
  112. MPI_Comm comm = ((struct _starpu_mpi_data *) data->mpi_data)->comm;
  113. MPI_Comm_size(comm, &size);
  114. for(n=0 ; n<size ; n++)
  115. {
  116. struct _starpu_data_entry *already_sent;
  117. HASH_FIND_PTR(_cache_sent_data[n], &data, already_sent);
  118. if (already_sent)
  119. {
  120. _STARPU_MPI_DEBUG(2, "Clearing send cache for data %p\n", data);
  121. HASH_DEL(_cache_sent_data[n], already_sent);
  122. free(already_sent);
  123. }
  124. }
  125. }
  126. void _starpu_mpi_cache_received_data_clear(starpu_data_handle_t data)
  127. {
  128. int mpi_rank = starpu_mpi_data_get_rank(data);
  129. struct _starpu_data_entry *already_received;
  130. HASH_FIND_PTR(_cache_received_data[mpi_rank], &data, already_received);
  131. if (already_received)
  132. {
  133. #ifdef STARPU_DEVEL
  134. # warning TODO: Somebody else will write to the data, so discard our cached copy if any. starpu_mpi could just remember itself.
  135. #endif
  136. _STARPU_MPI_DEBUG(2, "Clearing receive cache for data %p\n", data);
  137. HASH_DEL(_cache_received_data[mpi_rank], already_received);
  138. _starpu_mpi_cache_stats_dec(mpi_rank, data);
  139. free(already_received);
  140. starpu_data_invalidate_submit(data);
  141. }
  142. }
  143. void starpu_mpi_cache_flush_all_data(MPI_Comm comm)
  144. {
  145. int nb_nodes, i;
  146. int mpi_rank, my_rank;
  147. if (_starpu_cache_enabled == 0) return;
  148. MPI_Comm_size(comm, &nb_nodes);
  149. MPI_Comm_rank(comm, &my_rank);
  150. for(i=0 ; i<nb_nodes ; i++)
  151. {
  152. struct _starpu_data_entry *entry, *tmp;
  153. HASH_ITER(hh, _cache_sent_data[i], entry, tmp)
  154. {
  155. mpi_rank = starpu_mpi_data_get_rank((starpu_data_handle_t) entry->data);
  156. if (mpi_rank != my_rank && mpi_rank != -1)
  157. starpu_data_invalidate_submit((starpu_data_handle_t) entry->data);
  158. HASH_DEL(_cache_sent_data[i], entry);
  159. free(entry);
  160. }
  161. HASH_ITER(hh, _cache_received_data[i], entry, tmp)
  162. {
  163. mpi_rank = starpu_mpi_data_get_rank((starpu_data_handle_t) entry->data);
  164. if (mpi_rank != my_rank && mpi_rank != -1)
  165. starpu_data_invalidate_submit((starpu_data_handle_t) entry->data);
  166. HASH_DEL(_cache_received_data[i], entry);
  167. _starpu_mpi_cache_stats_dec(i, (starpu_data_handle_t) entry->data);
  168. free(entry);
  169. }
  170. }
  171. }
  172. void _starpu_mpi_cache_flush(starpu_data_handle_t data_handle)
  173. {
  174. struct _starpu_data_entry *avail;
  175. int i, my_rank, nb_nodes;
  176. int mpi_rank;
  177. MPI_Comm comm = ((struct _starpu_mpi_data *) data_handle->mpi_data)->comm;
  178. if (_starpu_cache_enabled == 0) return;
  179. MPI_Comm_size(comm, &nb_nodes);
  180. MPI_Comm_rank(comm, &my_rank);
  181. mpi_rank = starpu_mpi_data_get_rank(data_handle);
  182. for(i=0 ; i<nb_nodes ; i++)
  183. {
  184. HASH_FIND_PTR(_cache_sent_data[i], &data_handle, avail);
  185. if (avail)
  186. {
  187. _STARPU_MPI_DEBUG(2, "Clearing send cache for data %p\n", data_handle);
  188. HASH_DEL(_cache_sent_data[i], avail);
  189. free(avail);
  190. }
  191. HASH_FIND_PTR(_cache_received_data[i], &data_handle, avail);
  192. if (avail)
  193. {
  194. _STARPU_MPI_DEBUG(2, "Clearing send cache for data %p\n", data_handle);
  195. HASH_DEL(_cache_received_data[i], avail);
  196. _starpu_mpi_cache_stats_dec(i, data_handle);
  197. free(avail);
  198. }
  199. }
  200. }
  201. void starpu_mpi_cache_flush(MPI_Comm comm, starpu_data_handle_t data_handle)
  202. {
  203. int my_rank, mpi_rank;
  204. _starpu_mpi_cache_flush( data_handle);
  205. MPI_Comm_rank(comm, &my_rank);
  206. mpi_rank = starpu_mpi_data_get_rank(data_handle);
  207. if (mpi_rank != my_rank && mpi_rank != -1)
  208. starpu_data_invalidate_submit(data_handle);
  209. }
  210. void *_starpu_mpi_cache_received_data_set(starpu_data_handle_t data)
  211. {
  212. int mpi_rank = starpu_mpi_data_get_rank(data);
  213. if (_starpu_cache_enabled == 0) return NULL;
  214. struct _starpu_data_entry *already_received;
  215. HASH_FIND_PTR(_cache_received_data[mpi_rank], &data, already_received);
  216. if (already_received == NULL)
  217. {
  218. struct _starpu_data_entry *entry = (struct _starpu_data_entry *)malloc(sizeof(*entry));
  219. entry->data = data;
  220. HASH_ADD_PTR(_cache_received_data[mpi_rank], data, entry);
  221. _starpu_mpi_cache_stats_inc(mpi_rank, data);
  222. }
  223. else
  224. {
  225. _STARPU_MPI_DEBUG(2, "Do not receive data %p from node %d as it is already available\n", data, mpi_rank);
  226. }
  227. return already_received;
  228. }
  229. void *_starpu_mpi_cache_received_data_get(starpu_data_handle_t data)
  230. {
  231. int mpi_rank = starpu_mpi_data_get_rank(data);
  232. struct _starpu_data_entry *already_received;
  233. if (_starpu_cache_enabled == 0) return NULL;
  234. HASH_FIND_PTR(_cache_received_data[mpi_rank], &data, already_received);
  235. return already_received;
  236. }
  237. void *_starpu_mpi_cache_sent_data_set(starpu_data_handle_t data, int dest)
  238. {
  239. if (_starpu_cache_enabled == 0) return NULL;
  240. struct _starpu_data_entry *already_sent;
  241. HASH_FIND_PTR(_cache_sent_data[dest], &data, already_sent);
  242. if (already_sent == NULL)
  243. {
  244. struct _starpu_data_entry *entry = (struct _starpu_data_entry *)malloc(sizeof(*entry));
  245. entry->data = data;
  246. HASH_ADD_PTR(_cache_sent_data[dest], data, entry);
  247. _STARPU_MPI_DEBUG(2, "Noting that data %p has already been sent to %d\n", data, dest);
  248. }
  249. else
  250. {
  251. _STARPU_MPI_DEBUG(2, "Do not send data %p to node %d as it has already been sent\n", data, dest);
  252. }
  253. return already_sent;
  254. }