mpi_like.c 4.8 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170
  1. /*
  2. * StarPU
  3. * Copyright (C) INRIA 2008-2010 (see AUTHORS file)
  4. *
  5. * This program 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. * This program 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.h>
  17. #include <pthread.h>
  18. #define NTHREADS 4
  19. #define NITER 128
  20. static pthread_cond_t cond;
  21. static pthread_mutex_t mutex;
  22. struct thread_data {
  23. unsigned index;
  24. unsigned val;
  25. starpu_data_handle handle;
  26. pthread_t thread;
  27. pthread_cond_t recv_cond;
  28. pthread_mutex_t recv_mutex;
  29. unsigned recv_flag; // set when a message is received
  30. unsigned recv_buf;
  31. struct thread_data *neighbour;
  32. };
  33. static struct thread_data problem_data[NTHREADS];
  34. /* We implement some ring transfer, every thread will try to receive a piece of
  35. * data from its neighbour and increment it before transmitting it to its
  36. * successor. */
  37. static void increment_handle(struct thread_data *thread_data)
  38. {
  39. starpu_data_sync_with_mem(thread_data->handle, STARPU_RW);
  40. thread_data->val++;
  41. starpu_data_release_from_mem(thread_data->handle);
  42. }
  43. static void recv_handle(struct thread_data *thread_data)
  44. {
  45. starpu_data_sync_with_mem(thread_data->handle, STARPU_W);
  46. pthread_mutex_lock(&thread_data->recv_mutex);
  47. /* We wait for the previous thread to notify that the data is available */
  48. while (!thread_data->recv_flag)
  49. pthread_cond_wait(&thread_data->recv_cond, &thread_data->recv_mutex);
  50. /* We overwrite thread's data with the received value */
  51. thread_data->val = thread_data->recv_buf;
  52. /* Notify that we read the value */
  53. thread_data->recv_flag = 0;
  54. pthread_cond_signal(&thread_data->recv_cond);
  55. // fprintf(stderr, "Thread %d received value %d from thread %d\n", thread_data->index, thread_data->val, (thread_data->index - 1)%NTHREADS);
  56. pthread_mutex_unlock(&thread_data->recv_mutex);
  57. starpu_data_release_from_mem(thread_data->handle);
  58. }
  59. static void send_handle(struct thread_data *thread_data)
  60. {
  61. struct thread_data *neighbour_data = thread_data->neighbour;
  62. starpu_data_sync_with_mem(thread_data->handle, STARPU_R);
  63. // fprintf(stderr, "Thread %d sends value %d to thread %d\n", thread_data->index, thread_data->val, neighbour_data->index);
  64. /* send the message */
  65. pthread_mutex_lock(&neighbour_data->recv_mutex);
  66. neighbour_data->recv_buf = thread_data->val;
  67. neighbour_data->recv_flag = 1;
  68. pthread_cond_signal(&neighbour_data->recv_cond);
  69. /* wait until it's received (ie. neighbour's recv_flag is set back to 0) */
  70. while (neighbour_data->recv_flag)
  71. pthread_cond_wait(&neighbour_data->recv_cond, &neighbour_data->recv_mutex);
  72. pthread_mutex_unlock(&neighbour_data->recv_mutex);
  73. starpu_data_release_from_mem(thread_data->handle);
  74. }
  75. static void *thread_func(void *arg)
  76. {
  77. unsigned iter;
  78. struct thread_data *thread_data = arg;
  79. unsigned index = thread_data->index;
  80. // fprintf(stderr, "Hello from thread %d\n", thread_data->index);
  81. starpu_variable_data_register(&thread_data->handle, 0, (uintptr_t)&thread_data->val, sizeof(unsigned));
  82. for (iter = 0; iter < NITER; iter++)
  83. {
  84. /* The first thread initiates the first transfer */
  85. if (!((index == 0) && (iter == 0)))
  86. {
  87. recv_handle(thread_data);
  88. }
  89. increment_handle(thread_data);
  90. if (!((index == (NTHREADS - 1)) && (iter == (NITER - 1))))
  91. {
  92. send_handle(thread_data);
  93. }
  94. }
  95. // starpu_data_sync_with_mem(thread_data->handle, STARPU_R);
  96. // fprintf(stderr, "Final value on thread %d: %d\n", thread_data->index, thread_data->val);
  97. // starpu_data_release_from_mem(thread_data->handle);
  98. return NULL;
  99. }
  100. int main(int argc, char **argv)
  101. {
  102. int ret;
  103. starpu_init(NULL);
  104. unsigned t;
  105. for (t = 0; t < NTHREADS; t++)
  106. {
  107. problem_data[t].index = t;
  108. problem_data[t].val = 0;
  109. pthread_cond_init(&problem_data[t].recv_cond, NULL);
  110. pthread_mutex_init(&problem_data[t].recv_mutex, NULL);
  111. problem_data[t].recv_flag = 0;
  112. problem_data[t].neighbour = &problem_data[(t+1)%NTHREADS];
  113. }
  114. for (t = 0; t < NTHREADS; t++)
  115. {
  116. ret = pthread_create(&problem_data[t].thread, NULL, thread_func, &problem_data[t]);
  117. STARPU_ASSERT(!ret);
  118. }
  119. for (t = 0; t < NTHREADS; t++)
  120. {
  121. void *retval;
  122. ret = pthread_join(problem_data[t].thread, &retval);
  123. STARPU_ASSERT(retval == NULL);
  124. }
  125. /* We check that the value in the "last" thread is valid */
  126. starpu_data_handle last_handle = problem_data[NTHREADS - 1].handle;
  127. starpu_data_sync_with_mem(last_handle, STARPU_R);
  128. if (problem_data[NTHREADS - 1].val != (NTHREADS * NITER))
  129. STARPU_ABORT();
  130. starpu_data_release_from_mem(last_handle);
  131. starpu_shutdown();
  132. return 0;
  133. }