dining_philosophers.c 2.6 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111
  1. /* StarPU --- Runtime system for heterogeneous multicore architectures.
  2. *
  3. * Copyright (C) 2009, 2010 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 <starpu.h>
  18. #include "../helper.h"
  19. /* number of philosophers */
  20. #define N 16
  21. starpu_data_handle_t fork_handles[N];
  22. unsigned forks[N];
  23. void eat_kernel(void *descr[], void *arg)
  24. {
  25. }
  26. static struct starpu_codelet eating_cl =
  27. {
  28. .modes = { STARPU_RW, STARPU_RW },
  29. .cuda_funcs = {eat_kernel},
  30. .cpu_funcs = {eat_kernel},
  31. .opencl_funcs = {eat_kernel},
  32. .cpu_funcs_name = {"eat_kernel"},
  33. .nbuffers = 2
  34. };
  35. static
  36. int submit_one_task(unsigned p)
  37. {
  38. struct starpu_task *task = starpu_task_create();
  39. task->cl = &eating_cl;
  40. unsigned left = p;
  41. unsigned right = (p+1)%N;
  42. task->handles[0] = fork_handles[left];
  43. task->handles[1] = fork_handles[right];
  44. int ret = starpu_task_submit(task);
  45. return ret;
  46. }
  47. int main(int argc, char **argv)
  48. {
  49. int ret;
  50. ret = starpu_initialize(NULL, &argc, &argv);
  51. if (ret == -ENODEV) return STARPU_TEST_SKIPPED;
  52. STARPU_CHECK_RETURN_VALUE(ret, "starpu_init");
  53. /* initialize the forks */
  54. unsigned f;
  55. for (f = 0; f < N; f++)
  56. {
  57. forks[f] = 0;
  58. starpu_vector_data_register(&fork_handles[f], STARPU_MAIN_RAM, (uintptr_t)&forks[f], 1, sizeof(unsigned));
  59. }
  60. unsigned ntasks = 1024;
  61. unsigned t;
  62. for (t = 0; t < ntasks; t++)
  63. {
  64. /* select one philosopher randomly */
  65. unsigned philosopher = rand() % N;
  66. ret = submit_one_task(philosopher);
  67. if (ret == -ENODEV) goto enodev;
  68. STARPU_CHECK_RETURN_VALUE(ret, "starpu_task_submit");
  69. }
  70. ret = starpu_task_wait_for_all();
  71. STARPU_CHECK_RETURN_VALUE(ret, "starpu_task_wait_for_all");
  72. FPRINTF(stderr, "waiting done\n");
  73. for (f = 0; f < N; f++)
  74. {
  75. starpu_data_unregister(fork_handles[f]);
  76. }
  77. starpu_shutdown();
  78. return EXIT_SUCCESS;
  79. enodev:
  80. for (f = 0; f < N; f++)
  81. {
  82. starpu_data_unregister(fork_handles[f]);
  83. }
  84. fprintf(stderr, "WARNING: No one can execute this task\n");
  85. /* yes, we do not perform the computation but we did detect that no one
  86. * could perform the kernel, so this is not an error from StarPU */
  87. starpu_shutdown();
  88. return STARPU_TEST_SKIPPED;
  89. }