parallel_kernels_spmd.c 3.2 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125
  1. /* StarPU --- Runtime system for heterogeneous multicore architectures.
  2. *
  3. * Copyright (C) 2010, 2012, 2015-2016 Université de Bordeaux
  4. * Copyright (C) 2010, 2011, 2012, 2013 CNRS
  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 <config.h>
  18. #include <starpu.h>
  19. #include <limits.h>
  20. #include <unistd.h>
  21. #include "../helper.h"
  22. /*
  23. * Submit dumb parallel spmd tasks
  24. */
  25. #ifndef STARPU_QUICK_CHECK
  26. #define N 1000
  27. #else
  28. #define N 100
  29. #endif
  30. #define VECTORSIZE 1024
  31. void codelet_null(void *descr[], STARPU_ATTRIBUTE_UNUSED void *_args)
  32. {
  33. STARPU_SKIP_IF_VALGRIND;
  34. int worker_size = starpu_combined_worker_get_size();
  35. STARPU_ASSERT(worker_size > 0);
  36. usleep(1000/worker_size);
  37. #if 0
  38. int id = starpu_worker_get_id();
  39. int combined_id = starpu_combined_worker_get_id();
  40. int rank = starpu_combined_worker_get_rank();
  41. FPRINTF(stderr, "worker id %d - combined id %d - worker size %d - SPMD rank %d\n", id, combined_id, worker_size, rank);
  42. #endif
  43. }
  44. struct starpu_perfmodel model =
  45. {
  46. .type = STARPU_HISTORY_BASED,
  47. .symbol = "parallel_kernel_test_spmd"
  48. };
  49. static struct starpu_codelet cl =
  50. {
  51. .type = STARPU_SPMD,
  52. .max_parallelism = INT_MAX,
  53. .cpu_funcs = {codelet_null},
  54. .cpu_funcs_name = {"codelet_null"},
  55. .cuda_funcs = {codelet_null},
  56. .opencl_funcs = {codelet_null},
  57. .model = &model,
  58. .nbuffers = 1,
  59. .modes = {STARPU_R}
  60. };
  61. int main(int argc, char **argv)
  62. {
  63. int ret;
  64. starpu_data_handle_t v_handle;
  65. unsigned *v;
  66. struct starpu_conf conf;
  67. starpu_conf_init(&conf);
  68. conf.sched_policy_name = "pheft";
  69. conf.calibrate = 1;
  70. ret = starpu_init(&conf);
  71. if (ret == -ENODEV) return STARPU_TEST_SKIPPED;
  72. STARPU_CHECK_RETURN_VALUE(ret, "starpu_init");
  73. starpu_malloc((void **)&v, VECTORSIZE*sizeof(unsigned));
  74. starpu_vector_data_register(&v_handle, STARPU_MAIN_RAM, (uintptr_t)v, VECTORSIZE, sizeof(unsigned));
  75. unsigned nworker = starpu_worker_get_count() + starpu_combined_worker_get_count();
  76. unsigned iter, worker;
  77. for (iter = 0; iter < N; iter++)
  78. {
  79. for (worker = 0; worker < nworker; worker++)
  80. {
  81. /* execute a task on that worker */
  82. struct starpu_task *task = starpu_task_create();
  83. task->cl = &cl;
  84. task->handles[0] = v_handle;
  85. ret = starpu_task_submit(task);
  86. if (ret == -ENODEV) goto enodev;
  87. STARPU_CHECK_RETURN_VALUE(ret, "starpu_task_submit");
  88. }
  89. }
  90. ret = starpu_task_wait_for_all();
  91. STARPU_CHECK_RETURN_VALUE(ret, "starpu_task_wait_for_all");
  92. starpu_data_unregister(v_handle);
  93. starpu_free(v);
  94. starpu_shutdown();
  95. STARPU_RETURN(EXIT_SUCCESS);
  96. enodev:
  97. starpu_data_unregister(v_handle);
  98. starpu_free(v);
  99. fprintf(stderr, "WARNING: No one can execute this task\n");
  100. /* yes, we do not perform the computation but we did detect that no one
  101. * could perform the kernel, so this is not an error from StarPU */
  102. starpu_shutdown();
  103. STARPU_RETURN(STARPU_TEST_SKIPPED);
  104. }