in_place_partition.c 2.9 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111
  1. /* StarPU --- Runtime system for heterogeneous multicore architectures.
  2. *
  3. * Copyright (C) 2011-2021 Université de Bordeaux, CNRS (LaBRI UMR 5800), Inria
  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.h>
  17. #include "../helper.h"
  18. #include "scal.h"
  19. /*
  20. * Trigger in-place partitioning by prefetching the whole data before
  21. * partitioning
  22. */
  23. int main(int argc, char **argv)
  24. {
  25. unsigned *foo;
  26. starpu_data_handle_t handle;
  27. int ret;
  28. unsigned n, i, size;
  29. ret = starpu_initialize(NULL, &argc, &argv);
  30. if (ret == -ENODEV) return STARPU_TEST_SKIPPED;
  31. STARPU_CHECK_RETURN_VALUE(ret, "starpu_init");
  32. #ifdef STARPU_USE_OPENCL
  33. ret = starpu_opencl_load_opencl_from_file("tests/datawizard/scal_opencl.cl", &opencl_program, NULL);
  34. STARPU_CHECK_RETURN_VALUE(ret, "starpu_opencl_load_opencl_from_file");
  35. #endif
  36. n = starpu_worker_get_count();
  37. if (n == 1)
  38. {
  39. starpu_shutdown();
  40. return STARPU_TEST_SKIPPED;
  41. }
  42. size = 10 * n;
  43. foo = (unsigned *) calloc(size, sizeof(*foo));
  44. for (i = 0; i < size; i++)
  45. foo[i] = i;
  46. starpu_vector_data_register(&handle, STARPU_MAIN_RAM, (uintptr_t)foo, size, sizeof(*foo));
  47. /* Broadcast the data to force in-place partitioning */
  48. for (i = 0; i < n; i++)
  49. starpu_data_prefetch_on_node(handle, starpu_worker_get_memory_node(i), 0);
  50. struct starpu_data_filter f =
  51. {
  52. .filter_func = starpu_vector_filter_block,
  53. .nchildren = n,
  54. };
  55. starpu_data_partition(handle, &f);
  56. for (i = 0; i < f.nchildren; i++)
  57. {
  58. struct starpu_task *task = starpu_task_create();
  59. task->handles[0] = starpu_data_get_sub_data(handle, 1, i);
  60. task->cl = &scal_codelet;
  61. task->execute_on_a_specific_worker = 1;
  62. task->workerid = i;
  63. ret = starpu_task_submit(task);
  64. if (ret == -ENODEV) goto enodev;
  65. STARPU_CHECK_RETURN_VALUE(ret, "starpu_task_submit");
  66. }
  67. ret = starpu_task_wait_for_all();
  68. STARPU_CHECK_RETURN_VALUE(ret, "starpu_task_wait_for_all");
  69. starpu_data_unpartition(handle, STARPU_MAIN_RAM);
  70. starpu_data_unregister(handle);
  71. starpu_shutdown();
  72. ret = EXIT_SUCCESS;
  73. for (i = 0; i < size; i++)
  74. {
  75. if (foo[i] != i*2)
  76. {
  77. FPRINTF(stderr,"value %u is %u instead of %u\n", i, foo[i], 2*i);
  78. ret = EXIT_FAILURE;
  79. }
  80. }
  81. free(foo);
  82. return ret;
  83. enodev:
  84. starpu_data_unregister(handle);
  85. fprintf(stderr, "WARNING: No one can execute this task\n");
  86. /* yes, we do not perform the computation but we did detect that no one
  87. * could perform the kernel, so this is not an error from StarPU */
  88. starpu_shutdown();
  89. return STARPU_TEST_SKIPPED;
  90. }