insert_task_recv_cache.c 4.2 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161
  1. /* StarPU --- Runtime system for heterogeneous multicore architectures.
  2. *
  3. * Copyright (C) 2011-2018 CNRS
  4. * Copyright (C) 2014-2015,2017 Université de Bordeaux
  5. *
  6. * StarPU is free software; you can redistribute it and/or modify
  7. * it under the terms of the GNU Lesser General Public License as published by
  8. * the Free Software Foundation; either version 2.1 of the License, or (at
  9. * your option) any later version.
  10. *
  11. * StarPU is distributed in the hope that it will be useful, but
  12. * WITHOUT ANY WARRANTY; without even the implied warranty of
  13. * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.
  14. *
  15. * See the GNU Lesser General Public License in COPYING.LGPL for more details.
  16. */
  17. #include <starpu.h>
  18. #include <starpu_mpi.h>
  19. #include <math.h>
  20. #include "helper.h"
  21. #if !defined(STARPU_HAVE_SETENV)
  22. #warning setenv is not defined. Skipping test
  23. int main(void)
  24. {
  25. return STARPU_TEST_SKIPPED;
  26. }
  27. #else
  28. void func_cpu(void *descr[], void *_args)
  29. {
  30. (void)descr;
  31. (void)_args;
  32. }
  33. struct starpu_codelet mycodelet =
  34. {
  35. .cpu_funcs = {func_cpu},
  36. .nbuffers = 2,
  37. .modes = {STARPU_RW, STARPU_R},
  38. .model = &starpu_perfmodel_nop,
  39. };
  40. #define N 1000
  41. /* Returns the MPI node number where data indexes index is */
  42. int my_distrib(int x)
  43. {
  44. return x;
  45. }
  46. void test_cache(int rank, char *enabled, size_t *comm_amount)
  47. {
  48. int i;
  49. int ret;
  50. unsigned *v[2];
  51. starpu_data_handle_t data_handles[2];
  52. FPRINTF_MPI(stderr, "Testing with STARPU_MPI_CACHE=%s\n", enabled);
  53. setenv("STARPU_MPI_CACHE", enabled, 1);
  54. ret = starpu_init(NULL);
  55. STARPU_CHECK_RETURN_VALUE(ret, "starpu_init");
  56. ret = starpu_mpi_init(NULL, NULL, 0);
  57. STARPU_CHECK_RETURN_VALUE(ret, "starpu_mpi_init");
  58. for(i = 0; i < 2; i++)
  59. {
  60. int j;
  61. v[i] = calloc(N, sizeof(unsigned));
  62. for(j=0 ; j<N ; j++)
  63. {
  64. v[i][j] = 12;
  65. }
  66. }
  67. for(i = 0; i < 2; i++)
  68. {
  69. int mpi_rank = my_distrib(i);
  70. if (mpi_rank == rank)
  71. {
  72. starpu_vector_data_register(&data_handles[i], STARPU_MAIN_RAM, (uintptr_t)v[i], N, sizeof(unsigned));
  73. }
  74. else
  75. {
  76. /* I don't own this index, but will need it for my computations */
  77. starpu_vector_data_register(&data_handles[i], -1, (uintptr_t)NULL, N, sizeof(unsigned));
  78. }
  79. starpu_mpi_data_register(data_handles[i], i, mpi_rank);
  80. }
  81. // We call starpu_mpi_task_insert twice, when the cache is enabled, the 1st time puts the
  82. // data in the cache, the 2nd time allows to check the data is not sent again
  83. for(i = 0; i < 2; i++)
  84. {
  85. ret = starpu_mpi_task_insert(MPI_COMM_WORLD, &mycodelet, STARPU_RW, data_handles[0], STARPU_R, data_handles[1], 0);
  86. STARPU_CHECK_RETURN_VALUE(ret, "starpu_mpi_task_insert");
  87. }
  88. // Flush the cache for data_handles[1] which has been sent from node1 to node0
  89. starpu_mpi_cache_flush(MPI_COMM_WORLD, data_handles[1]);
  90. // Check again
  91. for(i = 0; i < 2; i++)
  92. {
  93. ret = starpu_mpi_task_insert(MPI_COMM_WORLD, &mycodelet, STARPU_RW, data_handles[0], STARPU_R, data_handles[1], 0);
  94. STARPU_CHECK_RETURN_VALUE(ret, "starpu_mpi_task_insert");
  95. }
  96. starpu_task_wait_for_all();
  97. for(i = 0; i < 2; i++)
  98. {
  99. starpu_data_unregister(data_handles[i]);
  100. free(v[i]);
  101. }
  102. starpu_mpi_comm_amounts_retrieve(comm_amount);
  103. starpu_mpi_shutdown();
  104. starpu_shutdown();
  105. }
  106. int main(int argc, char **argv)
  107. {
  108. int rank, size;
  109. int result=0;
  110. size_t *comm_amount_with_cache;
  111. size_t *comm_amount_without_cache;
  112. MPI_INIT_THREAD_real(&argc, &argv, MPI_THREAD_SERIALIZED);
  113. starpu_mpi_comm_rank(MPI_COMM_WORLD, &rank);
  114. starpu_mpi_comm_size(MPI_COMM_WORLD, &size);
  115. setenv("STARPU_COMM_STATS", "1", 1);
  116. setenv("STARPU_MPI_CACHE_STATS", "1", 1);
  117. comm_amount_with_cache = malloc(size * sizeof(size_t));
  118. comm_amount_without_cache = malloc(size * sizeof(size_t));
  119. test_cache(rank, "0", comm_amount_with_cache);
  120. test_cache(rank, "1", comm_amount_without_cache);
  121. if (rank == 1)
  122. {
  123. result = (comm_amount_with_cache[0] == comm_amount_without_cache[0] * 2);
  124. FPRINTF_MPI(stderr, "Communication cache mechanism is %sworking (with cache: %ld) (without cache: %ld)\n", result?"":"NOT ", (long)comm_amount_with_cache[0], (long)comm_amount_without_cache[0]);
  125. }
  126. else
  127. {
  128. result = 1;
  129. }
  130. free(comm_amount_without_cache);
  131. free(comm_amount_with_cache);
  132. MPI_Finalize();
  133. return !result;
  134. }
  135. #endif