dummy_sched.c 5.2 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191
  1. /* StarPU --- Runtime system for heterogeneous multicore architectures.
  2. *
  3. * Copyright (C) 2010-2011 Université de Bordeaux 1
  4. * Copyright (C) 2010-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 <pthread.h>
  18. #include <starpu.h>
  19. #define NTASKS 32000
  20. #define FPRINTF(ofile, fmt, args ...) do { if (!getenv("STARPU_SSILENT")) {fprintf(ofile, fmt, ##args); }} while(0)
  21. typedef struct dummy_sched_data {
  22. struct starpu_task_list sched_list;
  23. pthread_mutex_t sched_mutex;
  24. pthread_cond_t sched_cond;
  25. } dummy_sched_data;
  26. static void dummy_sched_add_workers(unsigned sched_ctx_id, int *workerids, unsigned nworkers)
  27. {
  28. struct dummy_sched_data *data = (struct dummy_sched_data*)starpu_get_sched_ctx_policy_data(sched_ctx_id);
  29. unsigned i;
  30. int workerid;
  31. for(i = 0; i < nworkers; i++)
  32. {
  33. workerid = workerids[i];
  34. starpu_worker_set_sched_condition(sched_ctx_id, workerid, &data->sched_mutex, &data->sched_cond);
  35. }
  36. }
  37. static void dummy_sched_remove_workers(unsigned sched_ctx_id, int *workerids, unsigned nworkers)
  38. {
  39. unsigned i;
  40. int workerid;
  41. for(i = 0; i < nworkers; i++)
  42. {
  43. workerid = workerids[i];
  44. starpu_worker_set_sched_condition(sched_ctx_id, workerid, NULL, NULL);
  45. }
  46. }
  47. static void init_dummy_sched(unsigned sched_ctx_id)
  48. {
  49. starpu_create_worker_collection_for_sched_ctx(sched_ctx_id, WORKER_LIST);
  50. struct dummy_sched_data *data = (struct dummy_sched_data*)malloc(sizeof(struct dummy_sched_data));
  51. /* Create a linked-list of tasks and a condition variable to protect it */
  52. starpu_task_list_init(&data->sched_list);
  53. pthread_mutex_init(&data->sched_mutex, NULL);
  54. pthread_cond_init(&data->sched_cond, NULL);
  55. starpu_set_sched_ctx_policy_data(sched_ctx_id, (void*)data);
  56. FPRINTF(stderr, "Initialising Dummy scheduler\n");
  57. }
  58. static void deinit_dummy_sched(unsigned sched_ctx_id)
  59. {
  60. struct dummy_sched_data *data = (struct dummy_sched_data*)starpu_get_sched_ctx_policy_data(sched_ctx_id);
  61. STARPU_ASSERT(starpu_task_list_empty(&data->sched_list));
  62. pthread_cond_destroy(&data->sched_cond);
  63. pthread_mutex_destroy(&data->sched_mutex);
  64. starpu_delete_worker_collection_for_sched_ctx(sched_ctx_id);
  65. free(data);
  66. FPRINTF(stderr, "Destroying Dummy scheduler\n");
  67. }
  68. static int push_task_dummy(struct starpu_task *task)
  69. {
  70. unsigned sched_ctx_id = task->sched_ctx;
  71. struct dummy_sched_data *data = (struct dummy_sched_data*)starpu_get_sched_ctx_policy_data(sched_ctx_id);
  72. pthread_mutex_lock(&data->sched_mutex);
  73. starpu_task_list_push_front(&data->sched_list, task);
  74. pthread_cond_signal(&data->sched_cond);
  75. pthread_mutex_unlock(&data->sched_mutex);
  76. return 0;
  77. }
  78. /* The mutex associated to the calling worker is already taken by StarPU */
  79. static struct starpu_task *pop_task_dummy(unsigned sched_ctx_id)
  80. {
  81. /* NB: In this simplistic strategy, we assume that all workers are able
  82. * to execute all tasks, otherwise, it would have been necessary to go
  83. * through the entire list until we find a task that is executable from
  84. * the calling worker. So we just take the head of the list and give it
  85. * to the worker. */
  86. struct dummy_sched_data *data = (struct dummy_sched_data*)starpu_get_sched_ctx_policy_data(sched_ctx_id);
  87. return starpu_task_list_pop_back(&data->sched_list);
  88. }
  89. static struct starpu_sched_policy dummy_sched_policy =
  90. {
  91. .init_sched = init_dummy_sched,
  92. .add_workers = dummy_sched_add_workers,
  93. .remove_workers = dummy_sched_remove_workers,
  94. .deinit_sched = deinit_dummy_sched,
  95. .push_task = push_task_dummy,
  96. .pop_task = pop_task_dummy,
  97. .post_exec_hook = NULL,
  98. .pop_every_task = NULL,
  99. .policy_name = "dummy",
  100. .policy_description = "dummy scheduling strategy"
  101. };
  102. static struct starpu_conf conf =
  103. {
  104. .sched_policy_name = NULL,
  105. .sched_policy = &dummy_sched_policy,
  106. .ncpus = -1,
  107. .ncuda = -1,
  108. .nopencl = -1,
  109. .nspus = -1,
  110. .use_explicit_workers_bindid = 0,
  111. .use_explicit_workers_cuda_gpuid = 0,
  112. .use_explicit_workers_opencl_gpuid = 0,
  113. .calibrate = 0
  114. };
  115. static void dummy_func(void *descr[] __attribute__ ((unused)), void *arg __attribute__ ((unused)))
  116. {
  117. }
  118. static struct starpu_codelet dummy_codelet =
  119. {
  120. .where = STARPU_CPU|STARPU_CUDA|STARPU_OPENCL,
  121. .cpu_funcs = {dummy_func, NULL},
  122. .cuda_funcs = {dummy_func, NULL},
  123. .opencl_funcs = {dummy_func, NULL},
  124. .model = NULL,
  125. .nbuffers = 0
  126. };
  127. int main(int argc, char **argv)
  128. {
  129. int ntasks = NTASKS;
  130. int ret;
  131. ret = starpu_init(&conf);
  132. if (ret == -ENODEV)
  133. return 77;
  134. STARPU_CHECK_RETURN_VALUE(ret, "starpu_init");
  135. #ifdef STARPU_SLOW_MACHINE
  136. ntasks /= 100;
  137. #endif
  138. unsigned i;
  139. for (i = 0; i < ntasks; i++)
  140. {
  141. struct starpu_task *task = starpu_task_create();
  142. task->cl = &dummy_codelet;
  143. task->cl_arg = NULL;
  144. ret = starpu_task_submit(task);
  145. STARPU_CHECK_RETURN_VALUE(ret, "starpu_task_submit");
  146. }
  147. starpu_task_wait_for_all();
  148. starpu_shutdown();
  149. return 0;
  150. }