sched_policy.c 22 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412413414415416417418419420421422423424425426427428429430431432433434435436437438439440441442443444445446447448449450451452453454455456457458459460461462463464465466467468469470471472473474475476477478479480481482483484485486487488489490491492493494495496497498499500501502503504505506507508509510511512513514515516517518519520521522523524525526527528529530531532533534535536537538539540541542543544545546547548549550551552553554555556557558559560561562563564565566567568569570571572573574575576577578579580581582583584585586587588589590591592593594595596597598599600601602603604605606607608609610611612613614615616617618619620621622623624625626627628629630631632633634635636637638639640641642643644645646647648649650651652653654655656657658659660661662663664665666667668669670671672673674675676677678679680681682683684685686687688689690691692693694695696697698699700701702703704705706707708709710711712713714715716717718719720721722723724725726727728729730731732733734735736737738739740741742743744745746747748749750751752753754755756757758759760761762763764765766767768
  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. struct starpu_sched_policy *_starpu_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, struct starpu_sched_policy *selected_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. load_sched_policy(selected_policy, sched_ctx);
  144. sched_ctx->sched_policy->init_sched(sched_ctx->id);
  145. }
  146. void _starpu_deinit_sched_policy(struct _starpu_sched_ctx *sched_ctx)
  147. {
  148. struct starpu_sched_policy *policy = sched_ctx->sched_policy;
  149. if (policy->deinit_sched)
  150. policy->deinit_sched(sched_ctx->id);
  151. }
  152. /* Enqueue a task into the list of tasks explicitely attached to a worker. In
  153. * case workerid identifies a combined worker, a task will be enqueued into
  154. * each worker of the combination. */
  155. static int _starpu_push_task_on_specific_worker(struct starpu_task *task, int workerid)
  156. {
  157. int nbasic_workers = (int)starpu_worker_get_count();
  158. /* Is this a basic worker or a combined worker ? */
  159. int is_basic_worker = (workerid < nbasic_workers);
  160. unsigned memory_node;
  161. struct _starpu_worker *worker = NULL;
  162. struct _starpu_combined_worker *combined_worker = NULL;
  163. if (is_basic_worker)
  164. {
  165. worker = _starpu_get_worker_struct(workerid);
  166. memory_node = worker->memory_node;
  167. }
  168. else
  169. {
  170. combined_worker = _starpu_get_combined_worker_struct(workerid);
  171. memory_node = combined_worker->memory_node;
  172. }
  173. if (use_prefetch)
  174. starpu_prefetch_task_input_on_node(task, memory_node);
  175. /* if we push a task on a specific worker, notify all the sched_ctxs the worker belongs to */
  176. unsigned i;
  177. struct _starpu_sched_ctx *sched_ctx;
  178. for(i = 0; i < STARPU_NMAX_SCHED_CTXS; i++)
  179. {
  180. sched_ctx = worker->sched_ctx[i];
  181. if (sched_ctx != NULL && sched_ctx->sched_policy != NULL && sched_ctx->sched_policy->push_task_notify)
  182. sched_ctx->sched_policy->push_task_notify(task, workerid, sched_ctx->id);
  183. }
  184. #ifdef STARPU_USE_SC_HYPERVISOR
  185. starpu_sched_ctx_call_pushed_task_cb(workerid, task->sched_ctx);
  186. #endif //STARPU_USE_SC_HYPERVISOR
  187. if (is_basic_worker)
  188. {
  189. unsigned node = starpu_worker_get_memory_node(workerid);
  190. if (_starpu_task_uses_multiformat_handles(task))
  191. {
  192. for (i = 0; i < task->cl->nbuffers; i++)
  193. {
  194. struct starpu_task *conversion_task;
  195. starpu_data_handle_t handle;
  196. handle = STARPU_TASK_GET_HANDLE(task, i);
  197. if (!_starpu_handle_needs_conversion_task(handle, node))
  198. continue;
  199. conversion_task = _starpu_create_conversion_task(handle, node);
  200. conversion_task->mf_skip = 1;
  201. conversion_task->execute_on_a_specific_worker = 1;
  202. conversion_task->workerid = workerid;
  203. _starpu_task_submit_conversion_task(conversion_task, workerid);
  204. //_STARPU_DEBUG("Pushing a conversion task\n");
  205. }
  206. for (i = 0; i < task->cl->nbuffers; i++)
  207. {
  208. starpu_data_handle_t handle = STARPU_TASK_GET_HANDLE(task, i);
  209. handle->mf_node = node;
  210. }
  211. }
  212. // if(task->sched_ctx != _starpu_get_initial_sched_ctx()->id)
  213. if(task->priority > 0)
  214. return _starpu_push_local_task(worker, task, 1);
  215. else
  216. return _starpu_push_local_task(worker, task, 0);
  217. }
  218. else
  219. {
  220. /* This is a combined worker so we create task aliases */
  221. int worker_size = combined_worker->worker_size;
  222. int *combined_workerid = combined_worker->combined_workerid;
  223. int ret = 0;
  224. struct _starpu_job *job = _starpu_get_job_associated_to_task(task);
  225. job->task_size = worker_size;
  226. job->combined_workerid = workerid;
  227. job->active_task_alias_count = 0;
  228. STARPU_PTHREAD_BARRIER_INIT(&job->before_work_barrier, NULL, worker_size);
  229. STARPU_PTHREAD_BARRIER_INIT(&job->after_work_barrier, NULL, worker_size);
  230. /* Note: we have to call that early, or else the task may have
  231. * disappeared already */
  232. starpu_push_task_end(task);
  233. int j;
  234. for (j = 0; j < worker_size; j++)
  235. {
  236. struct starpu_task *alias = starpu_task_dup(task);
  237. worker = _starpu_get_worker_struct(combined_workerid[j]);
  238. ret |= _starpu_push_local_task(worker, alias, 0);
  239. }
  240. return ret;
  241. }
  242. }
  243. static int _starpu_nworkers_able_to_execute_task(struct starpu_task *task, struct _starpu_sched_ctx *sched_ctx)
  244. {
  245. unsigned worker = 0, nworkers = 0;
  246. struct starpu_worker_collection *workers = sched_ctx->workers;
  247. struct starpu_sched_ctx_iterator it;
  248. if(workers->init_iterator)
  249. workers->init_iterator(workers, &it);
  250. while(workers->has_next(workers, &it))
  251. {
  252. worker = workers->get_next(workers, &it);
  253. if (starpu_worker_can_execute_task(worker, task, 0) && starpu_sched_ctx_is_ctxs_turn(worker, sched_ctx->id))
  254. nworkers++;
  255. }
  256. return nworkers;
  257. }
  258. /* the generic interface that call the proper underlying implementation */
  259. int _starpu_push_task(struct _starpu_job *j)
  260. {
  261. struct starpu_task *task = j->task;
  262. struct _starpu_sched_ctx *sched_ctx = _starpu_get_sched_ctx_struct(task->sched_ctx);
  263. unsigned nworkers = 0;
  264. int ret;
  265. _STARPU_LOG_IN();
  266. _STARPU_TRACE_JOB_PUSH(task, task->priority > 0);
  267. _starpu_increment_nready_tasks();
  268. task->status = STARPU_TASK_READY;
  269. #ifdef HAVE_AYUDAME_H
  270. if (AYU_event)
  271. {
  272. intptr_t id = -1;
  273. AYU_event(AYU_ADDTASKTOQUEUE, j->job_id, &id);
  274. }
  275. #endif
  276. /* if the context does not have any workers save the tasks in a temp list */
  277. if(!sched_ctx->is_initial_sched)
  278. {
  279. /*if there are workers in the ctx that are not able to execute tasks
  280. we consider the ctx empty */
  281. nworkers = _starpu_nworkers_able_to_execute_task(task, sched_ctx);
  282. if(nworkers == 0)
  283. {
  284. STARPU_PTHREAD_MUTEX_LOCK(&sched_ctx->empty_ctx_mutex);
  285. starpu_task_list_push_front(&sched_ctx->empty_ctx_tasks, task);
  286. STARPU_PTHREAD_MUTEX_UNLOCK(&sched_ctx->empty_ctx_mutex);
  287. return 0;
  288. }
  289. }
  290. /* in case there is no codelet associated to the task (that's a control
  291. * task), we directly execute its callback and enforce the
  292. * corresponding dependencies */
  293. if (task->cl == NULL)
  294. {
  295. _starpu_handle_job_termination(j);
  296. _STARPU_LOG_OUT_TAG("handle_job_termination");
  297. return 0;
  298. }
  299. ret = _starpu_push_task_to_workers(task);
  300. if (ret == -EAGAIN)
  301. /* pushed to empty context, that's fine */
  302. ret = 0;
  303. return ret;
  304. }
  305. int _starpu_push_task_to_workers(struct starpu_task *task)
  306. {
  307. struct _starpu_sched_ctx *sched_ctx = _starpu_get_sched_ctx_struct(task->sched_ctx);
  308. unsigned nworkers = 0;
  309. /* if the contexts still does not have workers put the task back to its place in
  310. the empty ctx list */
  311. if(!sched_ctx->is_initial_sched)
  312. {
  313. /*if there are workers in the ctx that are not able to execute tasks
  314. we consider the ctx empty */
  315. nworkers = _starpu_nworkers_able_to_execute_task(task, sched_ctx);
  316. if (nworkers == 0)
  317. {
  318. STARPU_PTHREAD_MUTEX_LOCK(&sched_ctx->empty_ctx_mutex);
  319. starpu_task_list_push_back(&sched_ctx->empty_ctx_tasks, task);
  320. STARPU_PTHREAD_MUTEX_UNLOCK(&sched_ctx->empty_ctx_mutex);
  321. return -EAGAIN;
  322. }
  323. }
  324. _starpu_profiling_set_task_push_start_time(task);
  325. int ret;
  326. if (STARPU_UNLIKELY(task->execute_on_a_specific_worker))
  327. {
  328. ret = _starpu_push_task_on_specific_worker(task, task->workerid);
  329. }
  330. else
  331. {
  332. STARPU_ASSERT(sched_ctx->sched_policy->push_task);
  333. /* check out if there are any workers in the context */
  334. starpu_pthread_mutex_t *changing_ctx_mutex = _starpu_sched_ctx_get_changing_ctx_mutex(sched_ctx->id);
  335. STARPU_PTHREAD_MUTEX_LOCK(changing_ctx_mutex);
  336. nworkers = starpu_sched_ctx_get_nworkers(sched_ctx->id);
  337. ret = nworkers == 0 ? -1 : sched_ctx->sched_policy->push_task(task);
  338. STARPU_PTHREAD_MUTEX_UNLOCK(changing_ctx_mutex);
  339. if(ret == -1)
  340. {
  341. fprintf(stderr, "repush task \n");
  342. _STARPU_TRACE_JOB_POP(task, task->priority > 0);
  343. ret = _starpu_push_task_to_workers(task);
  344. }
  345. }
  346. /* Note: from here, the task might have been destroyed already! */
  347. _STARPU_LOG_OUT();
  348. return ret;
  349. }
  350. /* This is called right after the scheduler has pushed a task to a queue
  351. * but just before releasing mutexes: we need the task to still be alive!
  352. */
  353. int starpu_push_task_end(struct starpu_task *task)
  354. {
  355. _starpu_profiling_set_task_push_end_time(task);
  356. task->scheduled = 1;
  357. return 0;
  358. }
  359. /*
  360. * Given a handle that needs to be converted in order to be used on the given
  361. * node, returns a task that takes care of the conversion.
  362. */
  363. struct starpu_task *_starpu_create_conversion_task(starpu_data_handle_t handle,
  364. unsigned int node)
  365. {
  366. return _starpu_create_conversion_task_for_arch(handle, starpu_node_get_kind(node));
  367. }
  368. struct starpu_task *_starpu_create_conversion_task_for_arch(starpu_data_handle_t handle,
  369. enum starpu_node_kind node_kind)
  370. {
  371. struct starpu_task *conversion_task;
  372. #if defined(STARPU_USE_OPENCL) || defined(STARPU_USE_CUDA) || defined(STARPU_USE_MIC) || defined(STARPU_USE_SCC) || defined(STARPU_SIMGRID)
  373. struct starpu_multiformat_interface *format_interface;
  374. #endif
  375. conversion_task = starpu_task_create();
  376. conversion_task->synchronous = 0;
  377. STARPU_TASK_SET_HANDLE(conversion_task, handle, 0);
  378. #if defined(STARPU_USE_OPENCL) || defined(STARPU_USE_CUDA) || defined(STARPU_USE_MIC) || defined(STARPU_USE_SCC) || defined(STARPU_SIMGRID)
  379. /* The node does not really matter here */
  380. format_interface = (struct starpu_multiformat_interface *) starpu_data_get_interface_on_node(handle, 0);
  381. #endif
  382. _starpu_spin_lock(&handle->header_lock);
  383. handle->refcnt++;
  384. handle->busy_count++;
  385. _starpu_spin_unlock(&handle->header_lock);
  386. switch(node_kind)
  387. {
  388. case STARPU_CPU_RAM:
  389. case STARPU_SCC_RAM:
  390. case STARPU_SCC_SHM:
  391. switch (starpu_node_get_kind(handle->mf_node))
  392. {
  393. case STARPU_CPU_RAM:
  394. case STARPU_SCC_RAM:
  395. case STARPU_SCC_SHM:
  396. STARPU_ABORT();
  397. #if defined(STARPU_USE_CUDA) || defined(STARPU_SIMGRID)
  398. case STARPU_CUDA_RAM:
  399. {
  400. struct starpu_multiformat_data_interface_ops *mf_ops;
  401. mf_ops = (struct starpu_multiformat_data_interface_ops *) handle->ops->get_mf_ops(format_interface);
  402. conversion_task->cl = mf_ops->cuda_to_cpu_cl;
  403. break;
  404. }
  405. #endif
  406. #if defined(STARPU_USE_OPENCL) || defined(STARPU_SIMGRID)
  407. case STARPU_OPENCL_RAM:
  408. {
  409. struct starpu_multiformat_data_interface_ops *mf_ops;
  410. mf_ops = (struct starpu_multiformat_data_interface_ops *) handle->ops->get_mf_ops(format_interface);
  411. conversion_task->cl = mf_ops->opencl_to_cpu_cl;
  412. break;
  413. }
  414. #endif
  415. #ifdef STARPU_USE_MIC
  416. case STARPU_MIC_RAM:
  417. {
  418. struct starpu_multiformat_data_interface_ops *mf_ops;
  419. mf_ops = (struct starpu_multiformat_data_interface_ops *) handle->ops->get_mf_ops(format_interface);
  420. conversion_task->cl = mf_ops->mic_to_cpu_cl;
  421. break;
  422. }
  423. #endif
  424. default:
  425. _STARPU_ERROR("Oops : %u\n", handle->mf_node);
  426. }
  427. break;
  428. #if defined(STARPU_USE_CUDA) || defined(STARPU_SIMGRID)
  429. case STARPU_CUDA_RAM:
  430. {
  431. struct starpu_multiformat_data_interface_ops *mf_ops;
  432. mf_ops = (struct starpu_multiformat_data_interface_ops *) handle->ops->get_mf_ops(format_interface);
  433. conversion_task->cl = mf_ops->cpu_to_cuda_cl;
  434. break;
  435. }
  436. #endif
  437. #if defined(STARPU_USE_OPENCL) || defined(STARPU_SIMGRID)
  438. case STARPU_OPENCL_RAM:
  439. {
  440. struct starpu_multiformat_data_interface_ops *mf_ops;
  441. mf_ops = (struct starpu_multiformat_data_interface_ops *) handle->ops->get_mf_ops(format_interface);
  442. conversion_task->cl = mf_ops->cpu_to_opencl_cl;
  443. break;
  444. }
  445. #endif
  446. #ifdef STARPU_USE_MIC
  447. case STARPU_MIC_RAM:
  448. {
  449. struct starpu_multiformat_data_interface_ops *mf_ops;
  450. mf_ops = (struct starpu_multiformat_data_interface_ops *) handle->ops->get_mf_ops(format_interface);
  451. conversion_task->cl = mf_ops->cpu_to_mic_cl;
  452. break;
  453. }
  454. #endif
  455. default:
  456. STARPU_ABORT();
  457. }
  458. STARPU_CODELET_SET_MODE(conversion_task->cl, STARPU_RW, 0);
  459. return conversion_task;
  460. }
  461. struct _starpu_sched_ctx* _get_next_sched_ctx_to_pop_into(struct _starpu_worker *worker)
  462. {
  463. while(1)
  464. {
  465. struct _starpu_sched_ctx *sched_ctx, *good_sched_ctx = NULL;
  466. unsigned smallest_counter = worker->nsched_ctxs;
  467. unsigned i;
  468. for(i = 0; i < STARPU_NMAX_SCHED_CTXS; i++)
  469. {
  470. sched_ctx = worker->sched_ctx[i];
  471. if(sched_ctx != NULL && sched_ctx->id != STARPU_NMAX_SCHED_CTXS && worker->removed_from_ctx[sched_ctx->id])
  472. return sched_ctx;
  473. if(sched_ctx != NULL && sched_ctx->id != STARPU_NMAX_SCHED_CTXS &&
  474. sched_ctx->pop_counter[worker->workerid] < worker->nsched_ctxs &&
  475. smallest_counter > sched_ctx->pop_counter[worker->workerid])
  476. {
  477. good_sched_ctx = sched_ctx;
  478. smallest_counter = sched_ctx->pop_counter[worker->workerid];
  479. }
  480. }
  481. if(good_sched_ctx == NULL)
  482. {
  483. for(i = 0; i < STARPU_NMAX_SCHED_CTXS; i++)
  484. {
  485. sched_ctx = worker->sched_ctx[i];
  486. if(sched_ctx != NULL && sched_ctx->id != STARPU_NMAX_SCHED_CTXS)
  487. sched_ctx->pop_counter[worker->workerid] = 0;
  488. }
  489. continue;
  490. }
  491. return good_sched_ctx;
  492. }
  493. }
  494. struct starpu_task *_starpu_pop_task(struct _starpu_worker *worker)
  495. {
  496. struct starpu_task *task;
  497. int worker_id;
  498. unsigned node;
  499. /* We can't tell in advance which task will be picked up, so we measure
  500. * a timestamp, and will attribute it afterwards to the task. */
  501. int profiling = starpu_profiling_status_get();
  502. struct timespec pop_start_time;
  503. if (profiling)
  504. _starpu_clock_gettime(&pop_start_time);
  505. pick:
  506. /* perhaps there is some local task to be executed first */
  507. task = _starpu_pop_local_task(worker);
  508. /* get tasks from the stacks of the strategy */
  509. if(!task)
  510. {
  511. struct _starpu_sched_ctx *sched_ctx;
  512. //unsigned lucky_ctx = STARPU_NMAX_SCHED_CTXS;
  513. int been_here[STARPU_NMAX_SCHED_CTXS];
  514. int i;
  515. for(i = 0; i < STARPU_NMAX_SCHED_CTXS; i++)
  516. been_here[i] = 0;
  517. while(!task)
  518. {
  519. if(worker->nsched_ctxs == 1)
  520. sched_ctx = _starpu_get_initial_sched_ctx();
  521. else
  522. sched_ctx = _get_next_sched_ctx_to_pop_into(worker);
  523. if(sched_ctx != NULL && sched_ctx->id != STARPU_NMAX_SCHED_CTXS)
  524. {
  525. if (sched_ctx->sched_policy && sched_ctx->sched_policy->pop_task)
  526. {
  527. task = sched_ctx->sched_policy->pop_task(sched_ctx->id);
  528. //lucky_ctx = sched_ctx->id;
  529. }
  530. }
  531. if(!task && worker->removed_from_ctx[sched_ctx->id])
  532. {
  533. _starpu_worker_gets_out_of_ctx(sched_ctx->id, worker);
  534. worker->removed_from_ctx[sched_ctx->id] = 0;
  535. }
  536. if((!task && sched_ctx->pop_counter[worker->workerid] == 0 && been_here[sched_ctx->id]) || worker->nsched_ctxs == 1)
  537. break;
  538. been_here[sched_ctx->id] = 1;
  539. sched_ctx->pop_counter[worker->workerid]++;
  540. }
  541. }
  542. if (!task)
  543. return NULL;
  544. /* Make sure we do not bother with all the multiformat-specific code if
  545. * it is not necessary. */
  546. if (!_starpu_task_uses_multiformat_handles(task))
  547. goto profiling;
  548. /* This is either a conversion task, or a regular task for which the
  549. * conversion tasks have already been created and submitted */
  550. if (task->mf_skip)
  551. goto profiling;
  552. worker_id = starpu_worker_get_id();
  553. if (!starpu_worker_can_execute_task(worker_id, task, 0))
  554. return task;
  555. node = starpu_worker_get_memory_node(worker_id);
  556. /*
  557. * We do have a task that uses multiformat handles. Let's create the
  558. * required conversion tasks.
  559. */
  560. unsigned i;
  561. for (i = 0; i < task->cl->nbuffers; i++)
  562. {
  563. struct starpu_task *conversion_task;
  564. starpu_data_handle_t handle;
  565. handle = STARPU_TASK_GET_HANDLE(task, i);
  566. if (!_starpu_handle_needs_conversion_task(handle, node))
  567. continue;
  568. conversion_task = _starpu_create_conversion_task(handle, node);
  569. conversion_task->mf_skip = 1;
  570. conversion_task->execute_on_a_specific_worker = 1;
  571. conversion_task->workerid = worker_id;
  572. /*
  573. * Next tasks will need to know where these handles have gone.
  574. */
  575. handle->mf_node = node;
  576. _starpu_task_submit_conversion_task(conversion_task, worker_id);
  577. }
  578. task->mf_skip = 1;
  579. starpu_task_list_push_back(&worker->local_tasks, task);
  580. goto pick;
  581. profiling:
  582. if (profiling)
  583. {
  584. struct starpu_profiling_task_info *profiling_info;
  585. profiling_info = task->profiling_info;
  586. /* The task may have been created before profiling was enabled,
  587. * so we check if the profiling_info structure is available
  588. * even though we already tested if profiling is enabled. */
  589. if (profiling_info)
  590. {
  591. memcpy(&profiling_info->pop_start_time,
  592. &pop_start_time, sizeof(struct timespec));
  593. _starpu_clock_gettime(&profiling_info->pop_end_time);
  594. }
  595. }
  596. return task;
  597. }
  598. struct starpu_task *_starpu_pop_every_task(struct _starpu_sched_ctx *sched_ctx)
  599. {
  600. STARPU_ASSERT(sched_ctx->sched_policy->pop_every_task);
  601. /* TODO set profiling info */
  602. if(sched_ctx->sched_policy->pop_every_task)
  603. return sched_ctx->sched_policy->pop_every_task(sched_ctx->id);
  604. return NULL;
  605. }
  606. void _starpu_sched_pre_exec_hook(struct starpu_task *task)
  607. {
  608. struct _starpu_sched_ctx *sched_ctx = _starpu_get_sched_ctx_struct(task->sched_ctx);
  609. if (sched_ctx->sched_policy->pre_exec_hook)
  610. sched_ctx->sched_policy->pre_exec_hook(task);
  611. }
  612. void _starpu_sched_post_exec_hook(struct starpu_task *task)
  613. {
  614. struct _starpu_sched_ctx *sched_ctx = _starpu_get_sched_ctx_struct(task->sched_ctx);
  615. #ifdef STARPU_USE_SC_HYPERVISOR
  616. if(task->hypervisor_tag > 0 && sched_ctx != NULL &&
  617. sched_ctx->id != 0 && sched_ctx->perf_counters != NULL)
  618. sched_ctx->perf_counters->notify_post_exec_hook(sched_ctx->id, task->hypervisor_tag);
  619. #endif //STARPU_USE_SC_HYPERVISOR
  620. if (sched_ctx->sched_policy->post_exec_hook)
  621. sched_ctx->sched_policy->post_exec_hook(task);
  622. }
  623. void _starpu_wait_on_sched_event(void)
  624. {
  625. struct _starpu_worker *worker = _starpu_get_local_worker_key();
  626. STARPU_PTHREAD_MUTEX_LOCK(&worker->sched_mutex);
  627. _starpu_handle_all_pending_node_data_requests(worker->memory_node);
  628. if (_starpu_machine_is_running())
  629. {
  630. #ifndef STARPU_NON_BLOCKING_DRIVERS
  631. STARPU_PTHREAD_COND_WAIT(&worker->sched_cond,
  632. &worker->sched_mutex);
  633. #endif
  634. }
  635. STARPU_PTHREAD_MUTEX_UNLOCK(&worker->sched_mutex);
  636. }
  637. /* The scheduling policy may put tasks directly into a worker's local queue so
  638. * that it is not always necessary to create its own queue when the local queue
  639. * is sufficient. If "back" not null, the task is put at the back of the queue
  640. * where the worker will pop tasks first. Setting "back" to 0 therefore ensures
  641. * a FIFO ordering. */
  642. int starpu_push_local_task(int workerid, struct starpu_task *task, int prio)
  643. {
  644. struct _starpu_worker *worker = _starpu_get_worker_struct(workerid);
  645. return _starpu_push_local_task(worker, task, prio);
  646. }