ring_async.c 3.2 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139
  1. /* StarPU --- Runtime system for heterogeneous multicore architectures.
  2. *
  3. * Copyright (C) 2009, 2010 Université de Bordeaux 1
  4. * Copyright (C) 2010, 2011, 2012 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. #ifdef STARPU_QUICK_CHECK
  20. # define NITER 32
  21. #else
  22. # define NITER 2048
  23. #endif
  24. unsigned token = 42;
  25. starpu_data_handle_t token_handle;
  26. #ifdef STARPU_USE_CUDA
  27. extern void increment_cuda(void *descr[], __attribute__ ((unused)) void *_args);
  28. #endif
  29. void increment_cpu(void *descr[], __attribute__ ((unused)) void *_args)
  30. {
  31. unsigned *tokenptr = (unsigned *)STARPU_VECTOR_GET_PTR(descr[0]);
  32. (*tokenptr)++;
  33. }
  34. static struct starpu_codelet increment_cl =
  35. {
  36. .where = STARPU_CPU|STARPU_CUDA,
  37. #ifdef STARPU_USE_CUDA
  38. .cuda_funcs = {increment_cuda, NULL},
  39. #endif
  40. .cpu_funcs = {increment_cpu, NULL},
  41. .nbuffers = 1,
  42. .modes = {STARPU_RW}
  43. };
  44. void increment_token(void)
  45. {
  46. struct starpu_task *task = starpu_task_create();
  47. task->cl = &increment_cl;
  48. task->handles[0] = token_handle;
  49. task->synchronous = 1;
  50. int ret = starpu_task_submit(task);
  51. STARPU_CHECK_RETURN_VALUE(ret, "starpu_task_submit");
  52. }
  53. int main(int argc, char **argv)
  54. {
  55. int ret, rank, size;
  56. MPI_Init(NULL, NULL);
  57. MPI_Comm_rank(MPI_COMM_WORLD, &rank);
  58. MPI_Comm_size(MPI_COMM_WORLD, &size);
  59. if (size < 2)
  60. {
  61. if (rank == 0)
  62. FPRINTF(stderr, "We need at least 2 processes.\n");
  63. MPI_Finalize();
  64. return STARPU_TEST_SKIPPED;
  65. }
  66. ret = starpu_init(NULL);
  67. STARPU_CHECK_RETURN_VALUE(ret, "starpu_init");
  68. ret = starpu_mpi_init(NULL, NULL, 0);
  69. STARPU_CHECK_RETURN_VALUE(ret, "starpu_mpi_init");
  70. starpu_vector_data_register(&token_handle, 0, (uintptr_t)&token, 1, sizeof(unsigned));
  71. unsigned nloops = NITER;
  72. unsigned loop;
  73. unsigned last_loop = nloops - 1;
  74. unsigned last_rank = size - 1;
  75. for (loop = 0; loop < nloops; loop++)
  76. {
  77. int tag = loop*size + rank;
  78. if (loop == 0 && rank == 0)
  79. {
  80. token = 0;
  81. FPRINTF(stdout, "Start with token value %u\n", token);
  82. }
  83. else
  84. {
  85. MPI_Status status;
  86. starpu_mpi_req req;
  87. starpu_mpi_irecv(token_handle, &req, (rank+size-1)%size, tag, MPI_COMM_WORLD);
  88. starpu_mpi_wait(&req, &status);
  89. }
  90. increment_token();
  91. if (loop == last_loop && rank == last_rank)
  92. {
  93. starpu_data_acquire(token_handle, STARPU_R);
  94. FPRINTF(stdout, "Finished : token value %u\n", token);
  95. starpu_data_release(token_handle);
  96. }
  97. else {
  98. starpu_mpi_req req;
  99. MPI_Status status;
  100. starpu_mpi_isend(token_handle, &req, (rank+1)%size, tag+1, MPI_COMM_WORLD);
  101. starpu_mpi_wait(&req, &status);
  102. }
  103. }
  104. starpu_data_unregister(token_handle);
  105. starpu_mpi_shutdown();
  106. starpu_shutdown();
  107. MPI_Finalize();
  108. if (rank == last_rank)
  109. {
  110. STARPU_ASSERT(token == nloops*size);
  111. }
  112. return 0;
  113. }