mpi_earlyrecv.c 2.7 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103
  1. /* StarPU --- Runtime system for heterogeneous multicore architectures.
  2. *
  3. * Copyright (C) 2009, 2010 Université de Bordeaux 1
  4. * Copyright (C) 2010, 2011, 2012, 2013 Centre National de la Recherche Scientifique
  5. *
  6. * StarPU is free software; you can redistribute it and/or modify
  7. * it under the terms of the GNU Lesser General Public License as published by
  8. * the Free Software Foundation; either version 2.1 of the License, or (at
  9. * your option) any later version.
  10. *
  11. * StarPU is distributed in the hope that it will be useful, but
  12. * WITHOUT ANY WARRANTY; without even the implied warranty of
  13. * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.
  14. *
  15. * See the GNU Lesser General Public License in COPYING.LGPL for more details.
  16. */
  17. #include <starpu_mpi.h>
  18. #include "helper.h"
  19. #include <unistd.h>
  20. //#define NB 1000
  21. #define NB 10
  22. int main(int argc, char **argv)
  23. {
  24. int ret, rank, size, i, nb_requests;
  25. starpu_data_handle_t tab_handle[NB];
  26. starpu_mpi_req request[NB];
  27. MPI_Init(NULL, NULL);
  28. MPI_Comm_rank(MPI_COMM_WORLD, &rank);
  29. MPI_Comm_size(MPI_COMM_WORLD, &size);
  30. if (size%2 != 0)
  31. {
  32. if (rank == 0)
  33. FPRINTF(stderr, "We need a even number of processes.\n");
  34. MPI_Finalize();
  35. return STARPU_TEST_SKIPPED;
  36. }
  37. ret = starpu_init(NULL);
  38. STARPU_CHECK_RETURN_VALUE(ret, "starpu_init");
  39. ret = starpu_mpi_init(NULL, NULL, 0);
  40. STARPU_CHECK_RETURN_VALUE(ret, "starpu_mpi_init");
  41. for(i=0 ; i<NB ; i++)
  42. {
  43. starpu_variable_data_register(&tab_handle[i], 0, (uintptr_t)&rank, sizeof(int));
  44. starpu_data_set_tag(tab_handle[i], i);
  45. request[i] = NULL;
  46. }
  47. int other_rank = rank%2 == 0 ? rank+1 : rank-1;
  48. fprintf(stderr, "rank %d exchanging with rank %d\n", rank, other_rank);
  49. if (rank%2)
  50. {
  51. starpu_mpi_isend(tab_handle[0], &request[0], other_rank, 0, MPI_COMM_WORLD);
  52. starpu_mpi_recv(tab_handle[2], other_rank, 2, MPI_COMM_WORLD, NULL);
  53. starpu_mpi_isend(tab_handle[1], &request[1], other_rank, 1, MPI_COMM_WORLD);
  54. nb_requests = 2;
  55. }
  56. else
  57. {
  58. starpu_mpi_irecv(tab_handle[0], &request[0], other_rank, 0, MPI_COMM_WORLD);
  59. starpu_mpi_irecv(tab_handle[1], &request[1], other_rank, 1, MPI_COMM_WORLD);
  60. starpu_mpi_isend(tab_handle[2], &request[2], other_rank, 2, MPI_COMM_WORLD);
  61. nb_requests = 3;
  62. }
  63. int finished=0;
  64. while (!finished)
  65. {
  66. for(i=0 ; i<nb_requests ; i++)
  67. {
  68. if (request[i])
  69. {
  70. int flag;
  71. MPI_Status status;
  72. starpu_mpi_test(&request[i], &flag, &status);
  73. if (flag)
  74. fprintf(stderr, "request[%d] = %d %p\n", i, flag, request[i]);
  75. }
  76. }
  77. finished = request[0] == NULL;
  78. for(i=1 ; i<nb_requests ; i++) finished = finished && request[i] == NULL;
  79. }
  80. for(i=0 ; i<NB ; i++)
  81. starpu_data_unregister(tab_handle[i]);
  82. starpu_mpi_shutdown();
  83. starpu_shutdown();
  84. MPI_Finalize();
  85. return 0;
  86. }