stencil5.c 4.4 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179
  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_mpi.h>
  17. #include <math.h>
  18. void stencil5_cpu(void *descr[], __attribute__ ((unused)) void *_args)
  19. {
  20. unsigned *xy = (unsigned *)STARPU_VARIABLE_GET_PTR(descr[0]);
  21. unsigned *xm1y = (unsigned *)STARPU_VARIABLE_GET_PTR(descr[1]);
  22. unsigned *xp1y = (unsigned *)STARPU_VARIABLE_GET_PTR(descr[2]);
  23. unsigned *xym1 = (unsigned *)STARPU_VARIABLE_GET_PTR(descr[3]);
  24. unsigned *xyp1 = (unsigned *)STARPU_VARIABLE_GET_PTR(descr[4]);
  25. //fprintf(stdout, "VALUES: %d %d %d %d %d\n", *xy, *xm1y, *xp1y, *xym1, *xyp1);
  26. *xy = (*xy + *xm1y + *xp1y + *xym1 + *xyp1) / 5;
  27. }
  28. struct starpu_codelet stencil5_cl =
  29. {
  30. .cpu_funcs = {stencil5_cpu, NULL},
  31. .nbuffers = 5,
  32. .modes = {STARPU_RW, STARPU_R, STARPU_R, STARPU_R, STARPU_R}
  33. };
  34. #ifdef STARPU_QUICK_CHECK
  35. # define NITER_DEF 5
  36. # define X 3
  37. # define Y 3
  38. #else
  39. # define NITER_DEF 500
  40. # define X 20
  41. # define Y 20
  42. #endif
  43. int display = 0;
  44. int niter = NITER_DEF;
  45. /* Returns the MPI node number where data indexes index is */
  46. int my_distrib(int x, int y, int nb_nodes)
  47. {
  48. /* Block distrib */
  49. return ((int)(x / sqrt(nb_nodes) + (y / sqrt(nb_nodes)) * sqrt(nb_nodes))) % nb_nodes;
  50. }
  51. static void parse_args(int argc, char **argv)
  52. {
  53. int i;
  54. for (i = 1; i < argc; i++)
  55. {
  56. if (strcmp(argv[i], "-iter") == 0)
  57. {
  58. char *argptr;
  59. niter = strtol(argv[++i], &argptr, 10);
  60. }
  61. if (strcmp(argv[i], "-display") == 0)
  62. {
  63. display = 1;
  64. }
  65. }
  66. }
  67. int main(int argc, char **argv)
  68. {
  69. int my_rank, size, x, y, loop;
  70. int value=0, mean=0;
  71. unsigned matrix[X][Y];
  72. starpu_data_handle_t data_handles[X][Y];
  73. int ret = starpu_init(NULL);
  74. STARPU_CHECK_RETURN_VALUE(ret, "starpu_init");
  75. starpu_mpi_init(&argc, &argv, 1);
  76. MPI_Comm_rank(MPI_COMM_WORLD, &my_rank);
  77. MPI_Comm_size(MPI_COMM_WORLD, &size);
  78. parse_args(argc, argv);
  79. for(x = 0; x < X; x++)
  80. {
  81. for (y = 0; y < Y; y++)
  82. {
  83. matrix[x][y] = (my_rank+1)*10 + value;
  84. value++;
  85. mean += matrix[x][y];
  86. }
  87. }
  88. mean /= value;
  89. for(x = 0; x < X; x++)
  90. {
  91. for (y = 0; y < Y; y++)
  92. {
  93. int mpi_rank = my_distrib(x, y, size);
  94. if (mpi_rank == my_rank)
  95. {
  96. //fprintf(stderr, "[%d] Owning data[%d][%d]\n", my_rank, x, y);
  97. starpu_variable_data_register(&data_handles[x][y], 0, (uintptr_t)&(matrix[x][y]), sizeof(unsigned));
  98. }
  99. else if (my_rank == my_distrib(x+1, y, size) || my_rank == my_distrib(x-1, y, size)
  100. || my_rank == my_distrib(x, y+1, size) || my_rank == my_distrib(x, y-1, size))
  101. {
  102. /* I don't own that index, but will need it for my computations */
  103. //fprintf(stderr, "[%d] Neighbour of data[%d][%d]\n", my_rank, x, y);
  104. starpu_variable_data_register(&data_handles[x][y], -1, (uintptr_t)NULL, sizeof(unsigned));
  105. }
  106. else
  107. {
  108. /* I know it's useless to allocate anything for this */
  109. data_handles[x][y] = NULL;
  110. }
  111. if (data_handles[x][y])
  112. {
  113. starpu_data_set_rank(data_handles[x][y], mpi_rank);
  114. starpu_data_set_tag(data_handles[x][y], (y*X)+x);
  115. }
  116. }
  117. }
  118. for(loop=0 ; loop<niter; loop++)
  119. {
  120. for (x = 1; x < X-1; x++)
  121. {
  122. for (y = 1; y < Y-1; y++)
  123. {
  124. starpu_mpi_insert_task(MPI_COMM_WORLD, &stencil5_cl, STARPU_RW, data_handles[x][y],
  125. STARPU_R, data_handles[x-1][y], STARPU_R, data_handles[x+1][y],
  126. STARPU_R, data_handles[x][y-1], STARPU_R, data_handles[x][y+1],
  127. 0);
  128. }
  129. }
  130. }
  131. fprintf(stderr, "Waiting ...\n");
  132. starpu_task_wait_for_all();
  133. for(x = 0; x < X; x++)
  134. {
  135. for (y = 0; y < Y; y++)
  136. {
  137. if (data_handles[x][y])
  138. {
  139. starpu_data_unregister(data_handles[x][y]);
  140. }
  141. }
  142. }
  143. starpu_mpi_shutdown();
  144. starpu_shutdown();
  145. if (display)
  146. {
  147. fprintf(stdout, "[%d] mean=%d\n", my_rank, mean);
  148. for(x = 0; x < X; x++)
  149. {
  150. fprintf(stdout, "[%d] ", my_rank);
  151. for (y = 0; y < Y; y++)
  152. {
  153. fprintf(stdout, "%3u ", matrix[x][y]);
  154. }
  155. fprintf(stdout, "\n");
  156. }
  157. }
  158. return 0;
  159. }