stencil5.c 5.0 KB

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