insert_task_cache.c 3.7 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146
  1. /* StarPU --- Runtime system for heterogeneous multicore architectures.
  2. *
  3. * Copyright (C) 2011, 2012, 2013 Centre National de la Recherche Scientifique
  4. *
  5. * StarPU is free software; you can redistribute it and/or modify
  6. * it under the terms of the GNU Lesser General Public License as published by
  7. * the Free Software Foundation; either version 2.1 of the License, or (at
  8. * your option) any later version.
  9. *
  10. * StarPU is distributed in the hope that it will be useful, but
  11. * WITHOUT ANY WARRANTY; without even the implied warranty of
  12. * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.
  13. *
  14. * See the GNU Lesser General Public License in COPYING.LGPL for more details.
  15. */
  16. #include <starpu.h>
  17. #include <starpu_mpi.h>
  18. #include <math.h>
  19. #include "helper.h"
  20. #if !defined(STARPU_HAVE_UNSETENV)
  21. #warning unsetenv is not defined. Skipping test
  22. int main(int argc, char **argv)
  23. {
  24. return STARPU_TEST_SKIPPED;
  25. }
  26. #else
  27. void func_cpu(STARPU_ATTRIBUTE_UNUSED void *descr[], STARPU_ATTRIBUTE_UNUSED void *_args)
  28. {
  29. }
  30. struct starpu_codelet mycodelet =
  31. {
  32. .cpu_funcs = {func_cpu, NULL},
  33. .nbuffers = 2,
  34. .modes = {STARPU_RW, STARPU_R}
  35. };
  36. #define N 1000
  37. /* Returns the MPI node number where data indexes index is */
  38. int my_distrib(int x)
  39. {
  40. return x;
  41. }
  42. void test_cache(int rank, int size, int enabled, size_t *comm_amount)
  43. {
  44. int i;
  45. int ret;
  46. unsigned v[2][N];
  47. starpu_data_handle_t data_handles[2];
  48. char string[50];
  49. sprintf(string, "STARPU_MPI_CACHE=%d", enabled);
  50. putenv(string);
  51. ret = starpu_init(NULL);
  52. STARPU_CHECK_RETURN_VALUE(ret, "starpu_init");
  53. ret = starpu_mpi_init(NULL, NULL, 0);
  54. STARPU_CHECK_RETURN_VALUE(ret, "starpu_mpi_init");
  55. for(i = 0; i < 2; i++)
  56. {
  57. int mpi_rank = my_distrib(i);
  58. if (mpi_rank == rank)
  59. {
  60. //FPRINTF(stderr, "[%d] Owning data[%d][%d]\n", rank, x, y);
  61. starpu_vector_data_register(&data_handles[i], STARPU_MAIN_RAM, (uintptr_t)&(v[i]), N, sizeof(unsigned));
  62. }
  63. else
  64. {
  65. /* I don't own that index, but will need it for my computations */
  66. //FPRINTF(stderr, "[%d] Neighbour of data[%d][%d]\n", rank, x, y);
  67. starpu_vector_data_register(&data_handles[i], -1, (uintptr_t)NULL, N, sizeof(unsigned));
  68. }
  69. starpu_data_set_rank(data_handles[i], mpi_rank);
  70. starpu_data_set_tag(data_handles[i], i);
  71. }
  72. for(i = 0; i < 5; i++)
  73. {
  74. ret = starpu_mpi_insert_task(MPI_COMM_WORLD, &mycodelet, STARPU_RW, data_handles[0], STARPU_R, data_handles[1], 0);
  75. STARPU_CHECK_RETURN_VALUE(ret, "starpu_mpi_insert_task");
  76. }
  77. for(i = 0; i < 5; i++)
  78. {
  79. ret = starpu_mpi_insert_task(MPI_COMM_WORLD, &mycodelet, STARPU_RW, data_handles[1], STARPU_R, data_handles[0], 0);
  80. STARPU_CHECK_RETURN_VALUE(ret, "starpu_mpi_insert_task");
  81. }
  82. starpu_task_wait_for_all();
  83. for(i = 0; i < 2; i++)
  84. {
  85. starpu_data_unregister(data_handles[i]);
  86. }
  87. starpu_mpi_comm_amounts_retrieve(comm_amount);
  88. starpu_mpi_shutdown();
  89. starpu_shutdown();
  90. }
  91. int main(int argc, char **argv)
  92. {
  93. int dst, rank, size;
  94. int result=0;
  95. size_t *comm_amount_with_cache;
  96. size_t *comm_amount_without_cache;
  97. char *string;
  98. MPI_Init(&argc, &argv);
  99. MPI_Comm_rank(MPI_COMM_WORLD, &rank);
  100. MPI_Comm_size(MPI_COMM_WORLD, &size);
  101. string = malloc(50);
  102. sprintf(string, "STARPU_COMM_STATS=1");
  103. putenv(string);
  104. comm_amount_with_cache = malloc(size * sizeof(size_t));
  105. comm_amount_without_cache = malloc(size * sizeof(size_t));
  106. test_cache(rank, size, 0, comm_amount_with_cache);
  107. test_cache(rank, size, 1, comm_amount_without_cache);
  108. if (rank == 0 || rank == 1)
  109. {
  110. dst = (rank == 0) ? 1 : 0;
  111. result = (comm_amount_with_cache[dst] == comm_amount_without_cache[dst] * 5);
  112. fprintf(stderr, "Communication cache mechanism is %sworking\n", result?"":"NOT ");
  113. }
  114. else
  115. result = 1;
  116. free(comm_amount_without_cache);
  117. free(comm_amount_with_cache);
  118. free(string);
  119. MPI_Finalize();
  120. return !result;
  121. }
  122. #endif