stencil5.c 5.0 KB

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