sched_policy.c 22 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412413414415416417418419420421422423424425426427428429430431432433434435436437438439440441442443444445446447448449450451452453454455456457458459460461462463464465466467468469470471472473474475476477478479480481482483484485486487488489490491492493494495496497498499500501502503504505506507508509510511512513514515516517518519520521522523524525526527528529530531532533534535536537538539540541542543544545546547548549550551552553554555556557558559560561562563564565566567568569570571572573574575576577578579580581582583584585586587588589590591592593594595596597598599600601602603604605606607608609610611612613614615616617618619620621622623624625626627628629630631632633634635636637638639640641642643644645646647648649650651652653654655656657658659660661662663664665666667668669670671672673674675676677678679680681682683684685686687688689690691692693694695696697698699700701702703704705706707708709710711712713714715716717718719720721722723724725726727728729730731732733734735736737738739740741742743744745746747748749750751752753754755756757758759760761762763764765766767768769770
  1. /* StarPU --- Runtime system for heterogeneous multicore architectures.
  2. *
  3. * Copyright (C) 2010-2013 Université de Bordeaux 1
  4. * Copyright (C) 2010-2013 Centre National de la Recherche Scientifique
  5. * Copyright (C) 2011 INRIA
  6. *
  7. * StarPU is free software; you can redistribute it and/or modify
  8. * it under the terms of the GNU Lesser General Public License as published by
  9. * the Free Software Foundation; either version 2.1 of the License, or (at
  10. * your option) any later version.
  11. *
  12. * StarPU is distributed in the hope that it will be useful, but
  13. * WITHOUT ANY WARRANTY; without even the implied warranty of
  14. * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.
  15. *
  16. * See the GNU Lesser General Public License in COPYING.LGPL for more details.
  17. */
  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. #include <core/debug.h>
  25. static int use_prefetch = 0;
  26. int starpu_get_prefetch_flag(void)
  27. {
  28. return use_prefetch;
  29. }
  30. static struct starpu_sched_policy *predefined_policies[] =
  31. {
  32. &_starpu_sched_eager_policy,
  33. &_starpu_sched_prio_policy,
  34. &_starpu_sched_random_policy,
  35. &_starpu_sched_ws_policy,
  36. &_starpu_sched_dm_policy,
  37. &_starpu_sched_dmda_policy,
  38. &_starpu_sched_dmda_ready_policy,
  39. &_starpu_sched_dmda_sorted_policy,
  40. &_starpu_sched_parallel_heft_policy,
  41. &_starpu_sched_peager_policy,
  42. NULL
  43. };
  44. struct starpu_sched_policy **starpu_sched_get_predefined_policies()
  45. {
  46. return predefined_policies;
  47. }
  48. struct starpu_sched_policy *_starpu_get_sched_policy(struct _starpu_sched_ctx *sched_ctx)
  49. {
  50. return sched_ctx->sched_policy;
  51. }
  52. /*
  53. * Methods to initialize the scheduling policy
  54. */
  55. static void load_sched_policy(struct starpu_sched_policy *sched_policy, struct _starpu_sched_ctx *sched_ctx)
  56. {
  57. STARPU_ASSERT(sched_policy);
  58. #ifdef STARPU_VERBOSE
  59. if (sched_policy->policy_name)
  60. {
  61. if (sched_policy->policy_description)
  62. _STARPU_DEBUG("Use %s scheduler (%s)\n", sched_policy->policy_name, sched_policy->policy_description);
  63. else
  64. _STARPU_DEBUG("Use %s scheduler \n", sched_policy->policy_name);
  65. }
  66. #endif
  67. struct starpu_sched_policy *policy = sched_ctx->sched_policy;
  68. memcpy(policy, sched_policy, sizeof(*policy));
  69. }
  70. static struct starpu_sched_policy *find_sched_policy_from_name(const char *policy_name)
  71. {
  72. if (!policy_name)
  73. return NULL;
  74. if (strncmp(policy_name, "heft", 5) == 0)
  75. {
  76. _STARPU_DISP("Warning: heft is now called \"dmda\".\n");
  77. return &_starpu_sched_dmda_policy;
  78. }
  79. struct starpu_sched_policy **policy;
  80. for(policy=predefined_policies ; *policy!=NULL ; policy++)
  81. {
  82. struct starpu_sched_policy *p = *policy;
  83. if (p->policy_name)
  84. {
  85. if (strcmp(policy_name, p->policy_name) == 0)
  86. {
  87. /* we found a policy with the requested name */
  88. return p;
  89. }
  90. }
  91. }
  92. fprintf(stderr, "Warning: scheduling policy \"%s\" was not found, try \"help\" to get a list\n", policy_name);
  93. /* nothing was found */
  94. return NULL;
  95. }
  96. static void display_sched_help_message(void)
  97. {
  98. const char *sched_env = getenv("STARPU_SCHED");
  99. if (sched_env && (strcmp(sched_env, "help") == 0))
  100. {
  101. /* display the description of all predefined policies */
  102. struct starpu_sched_policy **policy;
  103. fprintf(stderr, "STARPU_SCHED can be either of\n");
  104. for(policy=predefined_policies ; *policy!=NULL ; policy++)
  105. {
  106. struct starpu_sched_policy *p = *policy;
  107. fprintf(stderr, "%s\t-> %s\n", p->policy_name, p->policy_description);
  108. }
  109. }
  110. }
  111. static struct starpu_sched_policy *select_sched_policy(struct _starpu_machine_config *config, const char *required_policy)
  112. {
  113. struct starpu_sched_policy *selected_policy = NULL;
  114. struct starpu_conf *user_conf = config->conf;
  115. if(required_policy)
  116. selected_policy = find_sched_policy_from_name(required_policy);
  117. /* First, we check whether the application explicitely gave a scheduling policy or not */
  118. if (!selected_policy && user_conf && (user_conf->sched_policy))
  119. return user_conf->sched_policy;
  120. /* Otherwise, we look if the application specified the name of a policy to load */
  121. const char *sched_pol_name;
  122. sched_pol_name = getenv("STARPU_SCHED");
  123. if (sched_pol_name == NULL && user_conf && user_conf->sched_policy_name)
  124. sched_pol_name = user_conf->sched_policy_name;
  125. if (!selected_policy && sched_pol_name)
  126. selected_policy = find_sched_policy_from_name(sched_pol_name);
  127. /* Perhaps there was no policy that matched the name */
  128. if (selected_policy)
  129. return selected_policy;
  130. /* If no policy was specified, we use the greedy policy as a default */
  131. return &_starpu_sched_eager_policy;
  132. }
  133. void _starpu_init_sched_policy(struct _starpu_machine_config *config, struct _starpu_sched_ctx *sched_ctx, const char *required_policy)
  134. {
  135. /* Perhaps we have to display some help */
  136. display_sched_help_message();
  137. /* Prefetch is activated by default */
  138. use_prefetch = starpu_get_env_number("STARPU_PREFETCH");
  139. if (use_prefetch == -1)
  140. use_prefetch = 1;
  141. /* Set calibrate flag */
  142. _starpu_set_calibrate_flag(config->conf->calibrate);
  143. struct starpu_sched_policy *selected_policy;
  144. selected_policy = select_sched_policy(config, required_policy);
  145. load_sched_policy(selected_policy, sched_ctx);
  146. sched_ctx->sched_policy->init_sched(sched_ctx->id);
  147. }
  148. void _starpu_deinit_sched_policy(struct _starpu_sched_ctx *sched_ctx)
  149. {
  150. struct starpu_sched_policy *policy = sched_ctx->sched_policy;
  151. if (policy->deinit_sched)
  152. policy->deinit_sched(sched_ctx->id);
  153. }
  154. /* Enqueue a task into the list of tasks explicitely attached to a worker. In
  155. * case workerid identifies a combined worker, a task will be enqueued into
  156. * each worker of the combination. */
  157. static int _starpu_push_task_on_specific_worker(struct starpu_task *task, int workerid)
  158. {
  159. int nbasic_workers = (int)starpu_worker_get_count();
  160. /* Is this a basic worker or a combined worker ? */
  161. int is_basic_worker = (workerid < nbasic_workers);
  162. unsigned memory_node;
  163. struct _starpu_worker *worker = NULL;
  164. struct _starpu_combined_worker *combined_worker = NULL;
  165. if (is_basic_worker)
  166. {
  167. worker = _starpu_get_worker_struct(workerid);
  168. memory_node = worker->memory_node;
  169. }
  170. else
  171. {
  172. combined_worker = _starpu_get_combined_worker_struct(workerid);
  173. memory_node = combined_worker->memory_node;
  174. }
  175. if (use_prefetch)
  176. starpu_prefetch_task_input_on_node(task, memory_node);
  177. /* if we push a task on a specific worker, notify all the sched_ctxs the worker belongs to */
  178. unsigned i;
  179. struct _starpu_sched_ctx *sched_ctx;
  180. for(i = 0; i < STARPU_NMAX_SCHED_CTXS; i++)
  181. {
  182. sched_ctx = worker->sched_ctx[i];
  183. if (sched_ctx != NULL && sched_ctx->sched_policy != NULL && sched_ctx->sched_policy->push_task_notify)
  184. sched_ctx->sched_policy->push_task_notify(task, workerid, sched_ctx->id);
  185. }
  186. #ifdef STARPU_USE_SC_HYPERVISOR
  187. starpu_sched_ctx_call_pushed_task_cb(workerid, task->sched_ctx);
  188. #endif //STARPU_USE_SC_HYPERVISOR
  189. if (is_basic_worker)
  190. {
  191. unsigned node = starpu_worker_get_memory_node(workerid);
  192. if (_starpu_task_uses_multiformat_handles(task))
  193. {
  194. for (i = 0; i < task->cl->nbuffers; i++)
  195. {
  196. struct starpu_task *conversion_task;
  197. starpu_data_handle_t handle;
  198. handle = STARPU_TASK_GET_HANDLE(task, i);
  199. if (!_starpu_handle_needs_conversion_task(handle, node))
  200. continue;
  201. conversion_task = _starpu_create_conversion_task(handle, node);
  202. conversion_task->mf_skip = 1;
  203. conversion_task->execute_on_a_specific_worker = 1;
  204. conversion_task->workerid = workerid;
  205. _starpu_task_submit_conversion_task(conversion_task, workerid);
  206. //_STARPU_DEBUG("Pushing a conversion task\n");
  207. }
  208. for (i = 0; i < task->cl->nbuffers; i++)
  209. {
  210. starpu_data_handle_t handle = STARPU_TASK_GET_HANDLE(task, i);
  211. handle->mf_node = node;
  212. }
  213. }
  214. // if(task->sched_ctx != _starpu_get_initial_sched_ctx()->id)
  215. if(task->priority > 0)
  216. return _starpu_push_local_task(worker, task, 1);
  217. else
  218. return _starpu_push_local_task(worker, task, 0);
  219. }
  220. else
  221. {
  222. /* This is a combined worker so we create task aliases */
  223. int worker_size = combined_worker->worker_size;
  224. int *combined_workerid = combined_worker->combined_workerid;
  225. int ret = 0;
  226. struct _starpu_job *job = _starpu_get_job_associated_to_task(task);
  227. job->task_size = worker_size;
  228. job->combined_workerid = workerid;
  229. job->active_task_alias_count = 0;
  230. STARPU_PTHREAD_BARRIER_INIT(&job->before_work_barrier, NULL, worker_size);
  231. STARPU_PTHREAD_BARRIER_INIT(&job->after_work_barrier, NULL, worker_size);
  232. /* Note: we have to call that early, or else the task may have
  233. * disappeared already */
  234. starpu_push_task_end(task);
  235. int j;
  236. for (j = 0; j < worker_size; j++)
  237. {
  238. struct starpu_task *alias = starpu_task_dup(task);
  239. worker = _starpu_get_worker_struct(combined_workerid[j]);
  240. ret |= _starpu_push_local_task(worker, alias, 0);
  241. }
  242. return ret;
  243. }
  244. }
  245. static int _starpu_nworkers_able_to_execute_task(struct starpu_task *task, struct _starpu_sched_ctx *sched_ctx)
  246. {
  247. unsigned worker = 0, nworkers = 0;
  248. struct starpu_worker_collection *workers = sched_ctx->workers;
  249. struct starpu_sched_ctx_iterator it;
  250. if(workers->init_iterator)
  251. workers->init_iterator(workers, &it);
  252. while(workers->has_next(workers, &it))
  253. {
  254. worker = workers->get_next(workers, &it);
  255. if (starpu_worker_can_execute_task(worker, task, 0) && starpu_sched_ctx_is_ctxs_turn(worker, sched_ctx->id))
  256. nworkers++;
  257. }
  258. return nworkers;
  259. }
  260. /* the generic interface that call the proper underlying implementation */
  261. int _starpu_push_task(struct _starpu_job *j)
  262. {
  263. struct starpu_task *task = j->task;
  264. struct _starpu_sched_ctx *sched_ctx = _starpu_get_sched_ctx_struct(task->sched_ctx);
  265. unsigned nworkers = 0;
  266. int ret;
  267. _STARPU_LOG_IN();
  268. _STARPU_TRACE_JOB_PUSH(task, task->priority > 0);
  269. _starpu_increment_nready_tasks();
  270. task->status = STARPU_TASK_READY;
  271. #ifdef HAVE_AYUDAME_H
  272. if (AYU_event)
  273. {
  274. int id = -1;
  275. AYU_event(AYU_ADDTASKTOQUEUE, j->job_id, &id);
  276. }
  277. #endif
  278. /* if the context does not have any workers save the tasks in a temp list */
  279. if(!sched_ctx->is_initial_sched)
  280. {
  281. /*if there are workers in the ctx that are not able to execute tasks
  282. we consider the ctx empty */
  283. nworkers = _starpu_nworkers_able_to_execute_task(task, sched_ctx);
  284. if(nworkers == 0)
  285. {
  286. STARPU_PTHREAD_MUTEX_LOCK(&sched_ctx->empty_ctx_mutex);
  287. starpu_task_list_push_front(&sched_ctx->empty_ctx_tasks, task);
  288. STARPU_PTHREAD_MUTEX_UNLOCK(&sched_ctx->empty_ctx_mutex);
  289. return 0;
  290. }
  291. }
  292. /* in case there is no codelet associated to the task (that's a control
  293. * task), we directly execute its callback and enforce the
  294. * corresponding dependencies */
  295. if (task->cl == NULL)
  296. {
  297. _starpu_handle_job_termination(j);
  298. _STARPU_LOG_OUT_TAG("handle_job_termination");
  299. return 0;
  300. }
  301. ret = _starpu_push_task_to_workers(task);
  302. if (ret == -EAGAIN)
  303. /* pushed to empty context, that's fine */
  304. ret = 0;
  305. return ret;
  306. }
  307. int _starpu_push_task_to_workers(struct starpu_task *task)
  308. {
  309. struct _starpu_sched_ctx *sched_ctx = _starpu_get_sched_ctx_struct(task->sched_ctx);
  310. unsigned nworkers = 0;
  311. /* if the contexts still does not have workers put the task back to its place in
  312. the empty ctx list */
  313. if(!sched_ctx->is_initial_sched)
  314. {
  315. /*if there are workers in the ctx that are not able to execute tasks
  316. we consider the ctx empty */
  317. nworkers = _starpu_nworkers_able_to_execute_task(task, sched_ctx);
  318. if (nworkers == 0)
  319. {
  320. STARPU_PTHREAD_MUTEX_LOCK(&sched_ctx->empty_ctx_mutex);
  321. starpu_task_list_push_back(&sched_ctx->empty_ctx_tasks, task);
  322. STARPU_PTHREAD_MUTEX_UNLOCK(&sched_ctx->empty_ctx_mutex);
  323. return -EAGAIN;
  324. }
  325. }
  326. _starpu_profiling_set_task_push_start_time(task);
  327. int ret;
  328. if (STARPU_UNLIKELY(task->execute_on_a_specific_worker))
  329. {
  330. ret = _starpu_push_task_on_specific_worker(task, task->workerid);
  331. }
  332. else
  333. {
  334. STARPU_ASSERT(sched_ctx->sched_policy->push_task);
  335. /* check out if there are any workers in the context */
  336. starpu_pthread_mutex_t *changing_ctx_mutex = _starpu_sched_ctx_get_changing_ctx_mutex(sched_ctx->id);
  337. STARPU_PTHREAD_MUTEX_LOCK(changing_ctx_mutex);
  338. nworkers = starpu_sched_ctx_get_nworkers(sched_ctx->id);
  339. ret = nworkers == 0 ? -1 : sched_ctx->sched_policy->push_task(task);
  340. STARPU_PTHREAD_MUTEX_UNLOCK(changing_ctx_mutex);
  341. if(ret == -1)
  342. {
  343. fprintf(stderr, "repush task \n");
  344. _STARPU_TRACE_JOB_POP(task, task->priority > 0);
  345. ret = _starpu_push_task_to_workers(task);
  346. }
  347. }
  348. /* Note: from here, the task might have been destroyed already! */
  349. _STARPU_LOG_OUT();
  350. return ret;
  351. }
  352. /* This is called right after the scheduler has pushed a task to a queue
  353. * but just before releasing mutexes: we need the task to still be alive!
  354. */
  355. int starpu_push_task_end(struct starpu_task *task)
  356. {
  357. _starpu_profiling_set_task_push_end_time(task);
  358. task->scheduled = 1;
  359. return 0;
  360. }
  361. /*
  362. * Given a handle that needs to be converted in order to be used on the given
  363. * node, returns a task that takes care of the conversion.
  364. */
  365. struct starpu_task *_starpu_create_conversion_task(starpu_data_handle_t handle,
  366. unsigned int node)
  367. {
  368. return _starpu_create_conversion_task_for_arch(handle, starpu_node_get_kind(node));
  369. }
  370. struct starpu_task *_starpu_create_conversion_task_for_arch(starpu_data_handle_t handle,
  371. enum starpu_node_kind node_kind)
  372. {
  373. struct starpu_task *conversion_task;
  374. #if defined(STARPU_USE_OPENCL) || defined(STARPU_USE_CUDA) || defined(STARPU_USE_MIC) || defined(STARPU_USE_SCC) || defined(STARPU_SIMGRID)
  375. struct starpu_multiformat_interface *format_interface;
  376. #endif
  377. conversion_task = starpu_task_create();
  378. conversion_task->synchronous = 0;
  379. STARPU_TASK_SET_HANDLE(conversion_task, handle, 0);
  380. #if defined(STARPU_USE_OPENCL) || defined(STARPU_USE_CUDA) || defined(STARPU_USE_MIC) || defined(STARPU_USE_SCC) || defined(STARPU_SIMGRID)
  381. /* The node does not really matter here */
  382. format_interface = (struct starpu_multiformat_interface *) starpu_data_get_interface_on_node(handle, 0);
  383. #endif
  384. _starpu_spin_lock(&handle->header_lock);
  385. handle->refcnt++;
  386. handle->busy_count++;
  387. _starpu_spin_unlock(&handle->header_lock);
  388. switch(node_kind)
  389. {
  390. case STARPU_CPU_RAM:
  391. case STARPU_SCC_RAM:
  392. case STARPU_SCC_SHM:
  393. switch (starpu_node_get_kind(handle->mf_node))
  394. {
  395. case STARPU_CPU_RAM:
  396. case STARPU_SCC_RAM:
  397. case STARPU_SCC_SHM:
  398. STARPU_ABORT();
  399. #if defined(STARPU_USE_CUDA) || defined(STARPU_SIMGRID)
  400. case STARPU_CUDA_RAM:
  401. {
  402. struct starpu_multiformat_data_interface_ops *mf_ops;
  403. mf_ops = (struct starpu_multiformat_data_interface_ops *) handle->ops->get_mf_ops(format_interface);
  404. conversion_task->cl = mf_ops->cuda_to_cpu_cl;
  405. break;
  406. }
  407. #endif
  408. #if defined(STARPU_USE_OPENCL) || defined(STARPU_SIMGRID)
  409. case STARPU_OPENCL_RAM:
  410. {
  411. struct starpu_multiformat_data_interface_ops *mf_ops;
  412. mf_ops = (struct starpu_multiformat_data_interface_ops *) handle->ops->get_mf_ops(format_interface);
  413. conversion_task->cl = mf_ops->opencl_to_cpu_cl;
  414. break;
  415. }
  416. #endif
  417. #ifdef STARPU_USE_MIC
  418. case STARPU_MIC_RAM:
  419. {
  420. struct starpu_multiformat_data_interface_ops *mf_ops;
  421. mf_ops = (struct starpu_multiformat_data_interface_ops *) handle->ops->get_mf_ops(format_interface);
  422. conversion_task->cl = mf_ops->mic_to_cpu_cl;
  423. break;
  424. }
  425. #endif
  426. default:
  427. _STARPU_ERROR("Oops : %u\n", handle->mf_node);
  428. }
  429. break;
  430. #if defined(STARPU_USE_CUDA) || defined(STARPU_SIMGRID)
  431. case STARPU_CUDA_RAM:
  432. {
  433. struct starpu_multiformat_data_interface_ops *mf_ops;
  434. mf_ops = (struct starpu_multiformat_data_interface_ops *) handle->ops->get_mf_ops(format_interface);
  435. conversion_task->cl = mf_ops->cpu_to_cuda_cl;
  436. break;
  437. }
  438. #endif
  439. #if defined(STARPU_USE_OPENCL) || defined(STARPU_SIMGRID)
  440. case STARPU_OPENCL_RAM:
  441. {
  442. struct starpu_multiformat_data_interface_ops *mf_ops;
  443. mf_ops = (struct starpu_multiformat_data_interface_ops *) handle->ops->get_mf_ops(format_interface);
  444. conversion_task->cl = mf_ops->cpu_to_opencl_cl;
  445. break;
  446. }
  447. #endif
  448. #ifdef STARPU_USE_MIC
  449. case STARPU_MIC_RAM:
  450. {
  451. struct starpu_multiformat_data_interface_ops *mf_ops;
  452. mf_ops = (struct starpu_multiformat_data_interface_ops *) handle->ops->get_mf_ops(format_interface);
  453. conversion_task->cl = mf_ops->cpu_to_mic_cl;
  454. break;
  455. }
  456. #endif
  457. default:
  458. STARPU_ABORT();
  459. }
  460. STARPU_CODELET_SET_MODE(conversion_task->cl, STARPU_RW, 0);
  461. return conversion_task;
  462. }
  463. struct _starpu_sched_ctx* _get_next_sched_ctx_to_pop_into(struct _starpu_worker *worker)
  464. {
  465. while(1)
  466. {
  467. struct _starpu_sched_ctx *sched_ctx, *good_sched_ctx = NULL;
  468. unsigned smallest_counter = worker->nsched_ctxs;
  469. unsigned i;
  470. for(i = 0; i < STARPU_NMAX_SCHED_CTXS; i++)
  471. {
  472. sched_ctx = worker->sched_ctx[i];
  473. if(sched_ctx != NULL && sched_ctx->id != STARPU_NMAX_SCHED_CTXS && worker->removed_from_ctx[sched_ctx->id])
  474. return sched_ctx;
  475. if(sched_ctx != NULL && sched_ctx->id != STARPU_NMAX_SCHED_CTXS &&
  476. sched_ctx->pop_counter[worker->workerid] < worker->nsched_ctxs &&
  477. smallest_counter > sched_ctx->pop_counter[worker->workerid])
  478. {
  479. good_sched_ctx = sched_ctx;
  480. smallest_counter = sched_ctx->pop_counter[worker->workerid];
  481. }
  482. }
  483. if(good_sched_ctx == NULL)
  484. {
  485. for(i = 0; i < STARPU_NMAX_SCHED_CTXS; i++)
  486. {
  487. sched_ctx = worker->sched_ctx[i];
  488. if(sched_ctx != NULL && sched_ctx->id != STARPU_NMAX_SCHED_CTXS)
  489. sched_ctx->pop_counter[worker->workerid] = 0;
  490. }
  491. continue;
  492. }
  493. return good_sched_ctx;
  494. }
  495. }
  496. struct starpu_task *_starpu_pop_task(struct _starpu_worker *worker)
  497. {
  498. struct starpu_task *task;
  499. int worker_id;
  500. unsigned node;
  501. /* We can't tell in advance which task will be picked up, so we measure
  502. * a timestamp, and will attribute it afterwards to the task. */
  503. int profiling = starpu_profiling_status_get();
  504. struct timespec pop_start_time;
  505. if (profiling)
  506. _starpu_clock_gettime(&pop_start_time);
  507. pick:
  508. /* perhaps there is some local task to be executed first */
  509. task = _starpu_pop_local_task(worker);
  510. /* get tasks from the stacks of the strategy */
  511. if(!task)
  512. {
  513. struct _starpu_sched_ctx *sched_ctx;
  514. //unsigned lucky_ctx = STARPU_NMAX_SCHED_CTXS;
  515. int been_here[STARPU_NMAX_SCHED_CTXS];
  516. int i;
  517. for(i = 0; i < STARPU_NMAX_SCHED_CTXS; i++)
  518. been_here[i] = 0;
  519. while(!task)
  520. {
  521. if(worker->nsched_ctxs == 1)
  522. sched_ctx = _starpu_get_initial_sched_ctx();
  523. else
  524. sched_ctx = _get_next_sched_ctx_to_pop_into(worker);
  525. if(sched_ctx != NULL && sched_ctx->id != STARPU_NMAX_SCHED_CTXS)
  526. {
  527. if (sched_ctx->sched_policy && sched_ctx->sched_policy->pop_task)
  528. {
  529. task = sched_ctx->sched_policy->pop_task(sched_ctx->id);
  530. //lucky_ctx = sched_ctx->id;
  531. }
  532. }
  533. if(!task && worker->removed_from_ctx[sched_ctx->id])
  534. {
  535. _starpu_worker_gets_out_of_ctx(sched_ctx->id, worker);
  536. worker->removed_from_ctx[sched_ctx->id] = 0;
  537. }
  538. if((!task && sched_ctx->pop_counter[worker->workerid] == 0 && been_here[sched_ctx->id]) || worker->nsched_ctxs == 1)
  539. break;
  540. been_here[sched_ctx->id] = 1;
  541. sched_ctx->pop_counter[worker->workerid]++;
  542. }
  543. }
  544. if (!task)
  545. return NULL;
  546. /* Make sure we do not bother with all the multiformat-specific code if
  547. * it is not necessary. */
  548. if (!_starpu_task_uses_multiformat_handles(task))
  549. goto profiling;
  550. /* This is either a conversion task, or a regular task for which the
  551. * conversion tasks have already been created and submitted */
  552. if (task->mf_skip)
  553. goto profiling;
  554. worker_id = starpu_worker_get_id();
  555. if (!starpu_worker_can_execute_task(worker_id, task, 0))
  556. return task;
  557. node = starpu_worker_get_memory_node(worker_id);
  558. /*
  559. * We do have a task that uses multiformat handles. Let's create the
  560. * required conversion tasks.
  561. */
  562. unsigned i;
  563. for (i = 0; i < task->cl->nbuffers; i++)
  564. {
  565. struct starpu_task *conversion_task;
  566. starpu_data_handle_t handle;
  567. handle = STARPU_TASK_GET_HANDLE(task, i);
  568. if (!_starpu_handle_needs_conversion_task(handle, node))
  569. continue;
  570. conversion_task = _starpu_create_conversion_task(handle, node);
  571. conversion_task->mf_skip = 1;
  572. conversion_task->execute_on_a_specific_worker = 1;
  573. conversion_task->workerid = worker_id;
  574. /*
  575. * Next tasks will need to know where these handles have gone.
  576. */
  577. handle->mf_node = node;
  578. _starpu_task_submit_conversion_task(conversion_task, worker_id);
  579. }
  580. task->mf_skip = 1;
  581. starpu_task_list_push_back(&worker->local_tasks, task);
  582. goto pick;
  583. profiling:
  584. if (profiling)
  585. {
  586. struct starpu_profiling_task_info *profiling_info;
  587. profiling_info = task->profiling_info;
  588. /* The task may have been created before profiling was enabled,
  589. * so we check if the profiling_info structure is available
  590. * even though we already tested if profiling is enabled. */
  591. if (profiling_info)
  592. {
  593. memcpy(&profiling_info->pop_start_time,
  594. &pop_start_time, sizeof(struct timespec));
  595. _starpu_clock_gettime(&profiling_info->pop_end_time);
  596. }
  597. }
  598. return task;
  599. }
  600. struct starpu_task *_starpu_pop_every_task(struct _starpu_sched_ctx *sched_ctx)
  601. {
  602. STARPU_ASSERT(sched_ctx->sched_policy->pop_every_task);
  603. /* TODO set profiling info */
  604. if(sched_ctx->sched_policy->pop_every_task)
  605. return sched_ctx->sched_policy->pop_every_task(sched_ctx->id);
  606. return NULL;
  607. }
  608. void _starpu_sched_pre_exec_hook(struct starpu_task *task)
  609. {
  610. struct _starpu_sched_ctx *sched_ctx = _starpu_get_sched_ctx_struct(task->sched_ctx);
  611. if (sched_ctx->sched_policy->pre_exec_hook)
  612. sched_ctx->sched_policy->pre_exec_hook(task);
  613. }
  614. void _starpu_sched_post_exec_hook(struct starpu_task *task)
  615. {
  616. struct _starpu_sched_ctx *sched_ctx = _starpu_get_sched_ctx_struct(task->sched_ctx);
  617. #ifdef STARPU_USE_SC_HYPERVISOR
  618. if(task->hypervisor_tag > 0 && sched_ctx != NULL &&
  619. sched_ctx->id != 0 && sched_ctx->perf_counters != NULL)
  620. sched_ctx->perf_counters->notify_post_exec_hook(sched_ctx->id, task->hypervisor_tag);
  621. #endif //STARPU_USE_SC_HYPERVISOR
  622. if (sched_ctx->sched_policy->post_exec_hook)
  623. sched_ctx->sched_policy->post_exec_hook(task);
  624. }
  625. void _starpu_wait_on_sched_event(void)
  626. {
  627. struct _starpu_worker *worker = _starpu_get_local_worker_key();
  628. STARPU_PTHREAD_MUTEX_LOCK(&worker->sched_mutex);
  629. _starpu_handle_all_pending_node_data_requests(worker->memory_node);
  630. if (_starpu_machine_is_running())
  631. {
  632. #ifndef STARPU_NON_BLOCKING_DRIVERS
  633. STARPU_PTHREAD_COND_WAIT(&worker->sched_cond,
  634. &worker->sched_mutex);
  635. #endif
  636. }
  637. STARPU_PTHREAD_MUTEX_UNLOCK(&worker->sched_mutex);
  638. }
  639. /* The scheduling policy may put tasks directly into a worker's local queue so
  640. * that it is not always necessary to create its own queue when the local queue
  641. * is sufficient. If "back" not null, the task is put at the back of the queue
  642. * where the worker will pop tasks first. Setting "back" to 0 therefore ensures
  643. * a FIFO ordering. */
  644. int starpu_push_local_task(int workerid, struct starpu_task *task, int prio)
  645. {
  646. struct _starpu_worker *worker = _starpu_get_worker_struct(workerid);
  647. return _starpu_push_local_task(worker, task, prio);
  648. }