stencil5.c 4.3 KB

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