insert_task_compute.c 4.1 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154
  1. /* StarPU --- Runtime system for heterogeneous multicore architectures.
  2. *
  3. * Copyright (C) 2013, 2014 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 "helper.h"
  18. void func_cpu(void *descr[], STARPU_ATTRIBUTE_UNUSED void *_args)
  19. {
  20. int *x = (int *)STARPU_VARIABLE_GET_PTR(descr[0]);
  21. int *y = (int *)STARPU_VARIABLE_GET_PTR(descr[1]);
  22. FPRINTF(stdout, "VALUES: %u %u\n", *x, *y);
  23. *x = *x * *y;
  24. }
  25. struct starpu_codelet mycodelet =
  26. {
  27. .cpu_funcs = {func_cpu},
  28. .nbuffers = 2,
  29. .modes = {STARPU_RW, STARPU_R}
  30. };
  31. int test(int rank, int node, int *before, int *after, int task_insert, int data_array)
  32. {
  33. int ok, ret, i, x[2];
  34. starpu_data_handle_t data_handles[2];
  35. ret = starpu_init(NULL);
  36. STARPU_CHECK_RETURN_VALUE(ret, "starpu_init");
  37. ret = starpu_mpi_init(NULL, NULL, 0);
  38. STARPU_CHECK_RETURN_VALUE(ret, "starpu_mpi_init");
  39. if (starpu_cpu_worker_get_count() <= 0)
  40. {
  41. // If there is no cpu to execute the codelet, mpi will block trying to do the post-execution communication
  42. ret = -ENODEV;
  43. goto nodata;
  44. }
  45. for(i=0 ; i<2 ; i++)
  46. {
  47. x[i] = before[rank*2+i];
  48. if (rank <= 1)
  49. FPRINTF_MPI("before computation x[%d] = %d\n", i, x[i]);
  50. starpu_variable_data_register(&data_handles[i], STARPU_MAIN_RAM, (uintptr_t)&x[i], sizeof(int));
  51. starpu_mpi_data_register(data_handles[i], i, i);
  52. }
  53. if (task_insert)
  54. {
  55. if (data_array)
  56. ret = starpu_mpi_task_insert(MPI_COMM_WORLD, &mycodelet,
  57. STARPU_DATA_ARRAY, data_handles, 2,
  58. STARPU_EXECUTE_ON_NODE, node, 0);
  59. else
  60. ret = starpu_mpi_task_insert(MPI_COMM_WORLD, &mycodelet,
  61. STARPU_RW, data_handles[0], STARPU_R, data_handles[1],
  62. STARPU_EXECUTE_ON_NODE, node, 0);
  63. STARPU_CHECK_RETURN_VALUE(ret, "starpu_mpi_task_insert");
  64. }
  65. else
  66. {
  67. struct starpu_task *task = NULL;
  68. if (data_array)
  69. task = starpu_mpi_task_build(MPI_COMM_WORLD, &mycodelet,
  70. STARPU_DATA_ARRAY, data_handles, 2,
  71. STARPU_EXECUTE_ON_NODE, node, 0);
  72. else
  73. task = starpu_mpi_task_build(MPI_COMM_WORLD, &mycodelet,
  74. STARPU_RW, data_handles[0], STARPU_R, data_handles[1],
  75. STARPU_EXECUTE_ON_NODE, node, 0);
  76. if (task)
  77. {
  78. ret = starpu_task_submit(task);
  79. if (ret == -ENODEV) goto enodev;
  80. STARPU_CHECK_RETURN_VALUE(ret, "starpu_task_submit");
  81. }
  82. if (data_array)
  83. starpu_mpi_task_post_build(MPI_COMM_WORLD, &mycodelet,
  84. STARPU_DATA_ARRAY, descrs, 2,
  85. STARPU_EXECUTE_ON_NODE, node, 0);
  86. else
  87. starpu_mpi_task_post_build(MPI_COMM_WORLD, &mycodelet,
  88. STARPU_RW, data_handles[0], STARPU_R, data_handles[1],
  89. STARPU_EXECUTE_ON_NODE, node, 0);
  90. }
  91. starpu_task_wait_for_all();
  92. enodev:
  93. for(i=0; i<2; i++)
  94. {
  95. starpu_data_unregister(data_handles[i]);
  96. }
  97. ok = 1;
  98. if (rank <= 1)
  99. {
  100. for(i=0; i<2; i++)
  101. {
  102. ok = ok && (x[i] == after[rank*2+i]);
  103. FPRINTF_MPI("after computation x[%d] = %d, should be %d\n", i, x[i], after[rank*2+i]);
  104. }
  105. FPRINTF_MPI("result is %s\n", ok?"CORRECT":"NOT CORRECT");
  106. }
  107. nodata:
  108. starpu_mpi_shutdown();
  109. starpu_shutdown();
  110. return ret == -ENODEV ? ret : !ok;
  111. }
  112. int main(int argc, char **argv)
  113. {
  114. int rank;
  115. int ret;
  116. int before[4] = {10, 20, 11, 22};
  117. int after_node[2][4] = {{220, 22, 11, 22}, {220, 20, 220, 22}};
  118. int node, insert_task, data_array;
  119. MPI_Init(&argc, &argv);
  120. MPI_Comm_rank(MPI_COMM_WORLD, &rank);
  121. for(node=0 ; node<=1 ; node++)
  122. {
  123. for(insert_task=0 ; insert_task<=1 ; insert_task++)
  124. {
  125. for(data_array=0 ; data_array<=1 ; data_array++)
  126. {
  127. ret = test(rank, node, before, after_node[node], insert_task, data_array);
  128. if (ret == -ENODEV || ret) goto end;
  129. }
  130. }
  131. }
  132. end:
  133. MPI_Finalize();
  134. return ret==-ENODEV?STARPU_TEST_SKIPPED:ret;
  135. }