sched_policy.c 11 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389
  1. /* StarPU --- Runtime system for heterogeneous multicore architectures.
  2. *
  3. * Copyright (C) 2010-2011 Université de Bordeaux 1
  4. * Copyright (C) 2010-2011 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. #include <common/config.h>
  20. #include <common/utils.h>
  21. #include <core/sched_policy.h>
  22. #include <profiling/profiling.h>
  23. #include <common/barrier.h>
  24. static struct starpu_sched_policy policy;
  25. static int use_prefetch = 0;
  26. int starpu_get_prefetch_flag(void)
  27. {
  28. return use_prefetch;
  29. }
  30. /*
  31. * Predefined policies
  32. */
  33. extern struct starpu_sched_policy _starpu_sched_ws_policy;
  34. extern struct starpu_sched_policy _starpu_sched_prio_policy;
  35. extern struct starpu_sched_policy _starpu_sched_random_policy;
  36. extern struct starpu_sched_policy _starpu_sched_dm_policy;
  37. extern struct starpu_sched_policy _starpu_sched_dmda_policy;
  38. extern struct starpu_sched_policy _starpu_sched_dmda_ready_policy;
  39. extern struct starpu_sched_policy _starpu_sched_dmda_sorted_policy;
  40. extern struct starpu_sched_policy _starpu_sched_eager_policy;
  41. extern struct starpu_sched_policy _starpu_sched_parallel_heft_policy;
  42. extern struct starpu_sched_policy _starpu_sched_pgreedy_policy;
  43. extern struct starpu_sched_policy heft_policy;
  44. static struct starpu_sched_policy *predefined_policies[] = {
  45. &_starpu_sched_ws_policy,
  46. &_starpu_sched_prio_policy,
  47. &_starpu_sched_dm_policy,
  48. &_starpu_sched_dmda_policy,
  49. &heft_policy,
  50. &_starpu_sched_dmda_ready_policy,
  51. &_starpu_sched_dmda_sorted_policy,
  52. &_starpu_sched_random_policy,
  53. &_starpu_sched_eager_policy,
  54. &_starpu_sched_parallel_heft_policy,
  55. &_starpu_sched_pgreedy_policy
  56. };
  57. struct starpu_sched_policy *_starpu_get_sched_policy(void)
  58. {
  59. return &policy;
  60. }
  61. /*
  62. * Methods to initialize the scheduling policy
  63. */
  64. static void load_sched_policy(struct starpu_sched_policy *sched_policy)
  65. {
  66. STARPU_ASSERT(sched_policy);
  67. #ifdef STARPU_VERBOSE
  68. if (sched_policy->policy_name)
  69. {
  70. if (sched_policy->policy_description)
  71. _STARPU_DEBUG("Use %s scheduler (%s)\n", sched_policy->policy_name, sched_policy->policy_description);
  72. else
  73. _STARPU_DEBUG("Use %s scheduler \n", sched_policy->policy_name);
  74. }
  75. #endif
  76. policy.init_sched = sched_policy->init_sched;
  77. policy.deinit_sched = sched_policy->deinit_sched;
  78. policy.push_task = sched_policy->push_task;
  79. policy.push_task_notify = sched_policy->push_task_notify;
  80. policy.pop_task = sched_policy->pop_task;
  81. policy.post_exec_hook = sched_policy->post_exec_hook;
  82. policy.pop_every_task = sched_policy->pop_every_task;
  83. }
  84. static struct starpu_sched_policy *find_sched_policy_from_name(const char *policy_name)
  85. {
  86. if (!policy_name)
  87. return NULL;
  88. unsigned i;
  89. for (i = 0; i < sizeof(predefined_policies)/sizeof(predefined_policies[0]); i++)
  90. {
  91. struct starpu_sched_policy *p;
  92. p = predefined_policies[i];
  93. if (p->policy_name)
  94. {
  95. if (strcmp(policy_name, p->policy_name) == 0) {
  96. /* we found a policy with the requested name */
  97. return p;
  98. }
  99. }
  100. }
  101. fprintf(stderr, "Warning: scheduling policy \"%s\" was not found, try \"help\" to get a list\n", policy_name);
  102. /* nothing was found */
  103. return NULL;
  104. }
  105. static void display_sched_help_message(void)
  106. {
  107. const char *sched_env = getenv("STARPU_SCHED");
  108. if (sched_env && (strcmp(sched_env, "help") == 0)) {
  109. fprintf(stderr, "STARPU_SCHED can be either of\n");
  110. /* display the description of all predefined policies */
  111. unsigned i;
  112. for (i = 0; i < sizeof(predefined_policies)/sizeof(predefined_policies[0]); i++)
  113. {
  114. struct starpu_sched_policy *p;
  115. p = predefined_policies[i];
  116. fprintf(stderr, "%s\t-> %s\n", p->policy_name, p->policy_description);
  117. }
  118. }
  119. }
  120. static struct starpu_sched_policy *select_sched_policy(struct starpu_machine_config_s *config)
  121. {
  122. struct starpu_sched_policy *selected_policy = NULL;
  123. struct starpu_conf *user_conf = config->user_conf;
  124. /* First, we check whether the application explicitely gave a scheduling policy or not */
  125. if (user_conf && (user_conf->sched_policy))
  126. return user_conf->sched_policy;
  127. /* Otherwise, we look if the application specified the name of a policy to load */
  128. const char *sched_pol_name;
  129. if (user_conf && (user_conf->sched_policy_name))
  130. {
  131. sched_pol_name = user_conf->sched_policy_name;
  132. }
  133. else {
  134. sched_pol_name = getenv("STARPU_SCHED");
  135. }
  136. if (sched_pol_name)
  137. selected_policy = find_sched_policy_from_name(sched_pol_name);
  138. /* Perhaps there was no policy that matched the name */
  139. if (selected_policy)
  140. return selected_policy;
  141. /* If no policy was specified, we use the greedy policy as a default */
  142. return &_starpu_sched_eager_policy;
  143. }
  144. void _starpu_init_sched_policy(struct starpu_machine_config_s *config)
  145. {
  146. /* Perhaps we have to display some help */
  147. display_sched_help_message();
  148. /* Prefetch is activated by default */
  149. use_prefetch = starpu_get_env_number("STARPU_PREFETCH");
  150. if (use_prefetch == -1)
  151. use_prefetch = 1;
  152. /* By default, we don't calibrate */
  153. unsigned do_calibrate = 0;
  154. if (config->user_conf && (config->user_conf->calibrate != -1))
  155. {
  156. do_calibrate = config->user_conf->calibrate;
  157. }
  158. else {
  159. int res = starpu_get_env_number("STARPU_CALIBRATE");
  160. do_calibrate = (res < 0)?0:(unsigned)res;
  161. }
  162. _starpu_set_calibrate_flag(do_calibrate);
  163. struct starpu_sched_policy *selected_policy;
  164. selected_policy = select_sched_policy(config);
  165. load_sched_policy(selected_policy);
  166. policy.init_sched(&config->topology, &policy);
  167. }
  168. void _starpu_deinit_sched_policy(struct starpu_machine_config_s *config)
  169. {
  170. if (policy.deinit_sched)
  171. policy.deinit_sched(&config->topology, &policy);
  172. }
  173. /* Enqueue a task into the list of tasks explicitely attached to a worker. In
  174. * case workerid identifies a combined worker, a task will be enqueued into
  175. * each worker of the combination. */
  176. static int _starpu_push_task_on_specific_worker(struct starpu_task *task, int workerid)
  177. {
  178. int nbasic_workers = (int)starpu_worker_get_count();
  179. /* Is this a basic worker or a combined worker ? */
  180. int is_basic_worker = (workerid < nbasic_workers);
  181. unsigned memory_node;
  182. struct starpu_worker_s *worker = NULL;
  183. struct starpu_combined_worker_s *combined_worker = NULL;
  184. if (is_basic_worker)
  185. {
  186. worker = _starpu_get_worker_struct(workerid);
  187. memory_node = worker->memory_node;
  188. }
  189. else
  190. {
  191. combined_worker = _starpu_get_combined_worker_struct(workerid);
  192. memory_node = combined_worker->memory_node;
  193. }
  194. if (use_prefetch)
  195. starpu_prefetch_task_input_on_node(task, memory_node);
  196. if (policy.push_task_notify)
  197. policy.push_task_notify(task, workerid);
  198. if (is_basic_worker)
  199. {
  200. return _starpu_push_local_task(worker, task, 0);
  201. }
  202. else {
  203. /* This is a combined worker so we create task aliases */
  204. int worker_size = combined_worker->worker_size;
  205. int *combined_workerid = combined_worker->combined_workerid;
  206. int ret = 0;
  207. int i;
  208. starpu_job_t j = _starpu_get_job_associated_to_task(task);
  209. j->task_size = worker_size;
  210. j->combined_workerid = workerid;
  211. j->active_task_alias_count = 0;
  212. _STARPU_PTHREAD_BARRIER_INIT(&j->before_work_barrier, NULL, worker_size);
  213. _STARPU_PTHREAD_BARRIER_INIT(&j->after_work_barrier, NULL, worker_size);
  214. for (i = 0; i < worker_size; i++)
  215. {
  216. struct starpu_task *alias = _starpu_create_task_alias(task);
  217. worker = _starpu_get_worker_struct(combined_workerid[i]);
  218. ret |= _starpu_push_local_task(worker, alias, 0);
  219. }
  220. return ret;
  221. }
  222. }
  223. /* the generic interface that call the proper underlying implementation */
  224. int _starpu_push_task(starpu_job_t j, unsigned job_is_already_locked)
  225. {
  226. struct starpu_task *task = j->task;
  227. _STARPU_LOG_IN();
  228. task->status = STARPU_TASK_READY;
  229. _starpu_profiling_set_task_push_start_time(task);
  230. /* in case there is no codelet associated to the task (that's a control
  231. * task), we directly execute its callback and enforce the
  232. * corresponding dependencies */
  233. if (task->cl == NULL)
  234. {
  235. _starpu_handle_job_termination(j, job_is_already_locked);
  236. _STARPU_LOG_OUT_TAG("handle_job_termination");
  237. return 0;
  238. }
  239. int ret;
  240. if (STARPU_UNLIKELY(task->execute_on_a_specific_worker))
  241. {
  242. ret = _starpu_push_task_on_specific_worker(task, task->workerid);
  243. }
  244. else {
  245. STARPU_ASSERT(policy.push_task);
  246. ret = policy.push_task(task);
  247. }
  248. _starpu_profiling_set_task_push_end_time(task);
  249. _STARPU_LOG_OUT();
  250. return ret;
  251. }
  252. struct starpu_task *_starpu_pop_task(struct starpu_worker_s *worker)
  253. {
  254. struct starpu_task *task;
  255. /* We can't tell in advance which task will be picked up, so we measure
  256. * a timestamp, and will attribute it afterwards to the task. */
  257. int profiling = starpu_profiling_status_get();
  258. struct timespec pop_start_time;
  259. if (profiling)
  260. starpu_clock_gettime(&pop_start_time);
  261. /* perhaps there is some local task to be executed first */
  262. task = _starpu_pop_local_task(worker);
  263. if (!task && policy.pop_task)
  264. task = policy.pop_task();
  265. /* Note that we may get a NULL task in case the scheduler was unlocked
  266. * for some reason. */
  267. if (profiling && task)
  268. {
  269. struct starpu_task_profiling_info *profiling_info;
  270. profiling_info = task->profiling_info;
  271. /* The task may have been created before profiling was enabled,
  272. * so we check if the profiling_info structure is available
  273. * even though we already tested if profiling is enabled. */
  274. if (profiling_info)
  275. {
  276. memcpy(&profiling_info->pop_start_time,
  277. &pop_start_time, sizeof(struct timespec));
  278. starpu_clock_gettime(&profiling_info->pop_end_time);
  279. }
  280. }
  281. return task;
  282. }
  283. struct starpu_task *_starpu_pop_every_task(void)
  284. {
  285. STARPU_ASSERT(policy.pop_every_task);
  286. /* TODO set profiling info */
  287. return policy.pop_every_task();
  288. }
  289. void _starpu_sched_post_exec_hook(struct starpu_task *task)
  290. {
  291. if (policy.post_exec_hook)
  292. policy.post_exec_hook(task);
  293. }
  294. void _starpu_wait_on_sched_event(void)
  295. {
  296. struct starpu_worker_s *worker = _starpu_get_local_worker_key();
  297. _STARPU_PTHREAD_MUTEX_LOCK(worker->sched_mutex);
  298. _starpu_handle_all_pending_node_data_requests(worker->memory_node);
  299. if (_starpu_machine_is_running())
  300. {
  301. #ifndef STARPU_NON_BLOCKING_DRIVERS
  302. pthread_cond_wait(worker->sched_cond, worker->sched_mutex);
  303. #endif
  304. }
  305. _STARPU_PTHREAD_MUTEX_UNLOCK(worker->sched_mutex);
  306. }
  307. /* The scheduling policy may put tasks directly into a worker's local queue so
  308. * that it is not always necessary to create its own queue when the local queue
  309. * is sufficient. If "back" not null, the task is put at the back of the queue
  310. * where the worker will pop tasks first. Setting "back" to 0 therefore ensures
  311. * a FIFO ordering. */
  312. int starpu_push_local_task(int workerid, struct starpu_task *task, int back)
  313. {
  314. struct starpu_worker_s *worker = _starpu_get_worker_struct(workerid);
  315. return _starpu_push_local_task(worker, task, back);
  316. }