dining_philosophers.c 2.6 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109
  1. /* StarPU --- Runtime system for heterogeneous multicore architectures.
  2. *
  3. * Copyright (C) 2009, 2010 Université de Bordeaux 1
  4. * Copyright (C) 2010, 2011, 2012 Centre National de la Recherche Scientifique
  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. static 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, NULL},
  30. .cpu_funcs = {eat_kernel, NULL},
  31. .opencl_funcs = {eat_kernel, NULL},
  32. .nbuffers = 2
  33. };
  34. int submit_one_task(unsigned p)
  35. {
  36. struct starpu_task *task = starpu_task_create();
  37. task->cl = &eating_cl;
  38. unsigned left = p;
  39. unsigned right = (p+1)%N;
  40. task->handles[0] = fork_handles[left];
  41. task->handles[1] = fork_handles[right];
  42. int ret = starpu_task_submit(task);
  43. return ret;
  44. }
  45. int main(int argc, char **argv)
  46. {
  47. int ret;
  48. ret = starpu_init(NULL);
  49. if (ret == -ENODEV) return STARPU_TEST_SKIPPED;
  50. STARPU_CHECK_RETURN_VALUE(ret, "starpu_init");
  51. /* initialize the forks */
  52. unsigned f;
  53. for (f = 0; f < N; f++)
  54. {
  55. forks[f] = 0;
  56. starpu_vector_data_register(&fork_handles[f], 0, (uintptr_t)&forks[f], 1, sizeof(unsigned));
  57. }
  58. unsigned ntasks = 1024;
  59. unsigned t;
  60. for (t = 0; t < ntasks; t++)
  61. {
  62. /* select one philosopher randomly */
  63. unsigned philosopher = rand() % N;
  64. ret = submit_one_task(philosopher);
  65. if (ret == -ENODEV) goto enodev;
  66. STARPU_CHECK_RETURN_VALUE(ret, "starpu_task_submit");
  67. }
  68. ret = starpu_task_wait_for_all();
  69. STARPU_CHECK_RETURN_VALUE(ret, "starpu_task_wait_for_all");
  70. FPRINTF(stderr, "waiting done\n");
  71. for (f = 0; f < N; f++)
  72. {
  73. starpu_data_unregister(fork_handles[f]);
  74. }
  75. starpu_shutdown();
  76. return EXIT_SUCCESS;
  77. enodev:
  78. for (f = 0; f < N; f++)
  79. {
  80. starpu_data_unregister(fork_handles[f]);
  81. }
  82. fprintf(stderr, "WARNING: No one can execute this task\n");
  83. /* yes, we do not perform the computation but we did detect that no one
  84. * could perform the kernel, so this is not an error from StarPU */
  85. starpu_shutdown();
  86. return STARPU_TEST_SKIPPED;
  87. }