sched_ctx.c 71 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412413414415416417418419420421422423424425426427428429430431432433434435436437438439440441442443444445446447448449450451452453454455456457458459460461462463464465466467468469470471472473474475476477478479480481482483484485486487488489490491492493494495496497498499500501502503504505506507508509510511512513514515516517518519520521522523524525526527528529530531532533534535536537538539540541542543544545546547548549550551552553554555556557558559560561562563564565566567568569570571572573574575576577578579580581582583584585586587588589590591592593594595596597598599600601602603604605606607608609610611612613614615616617618619620621622623624625626627628629630631632633634635636637638639640641642643644645646647648649650651652653654655656657658659660661662663664665666667668669670671672673674675676677678679680681682683684685686687688689690691692693694695696697698699700701702703704705706707708709710711712713714715716717718719720721722723724725726727728729730731732733734735736737738739740741742743744745746747748749750751752753754755756757758759760761762763764765766767768769770771772773774775776777778779780781782783784785786787788789790791792793794795796797798799800801802803804805806807808809810811812813814815816817818819820821822823824825826827828829830831832833834835836837838839840841842843844845846847848849850851852853854855856857858859860861862863864865866867868869870871872873874875876877878879880881882883884885886887888889890891892893894895896897898899900901902903904905906907908909910911912913914915916917918919920921922923924925926927928929930931932933934935936937938939940941942943944945946947948949950951952953954955956957958959960961962963964965966967968969970971972973974975976977978979980981982983984985986987988989990991992993994995996997998999100010011002100310041005100610071008100910101011101210131014101510161017101810191020102110221023102410251026102710281029103010311032103310341035103610371038103910401041104210431044104510461047104810491050105110521053105410551056105710581059106010611062106310641065106610671068106910701071107210731074107510761077107810791080108110821083108410851086108710881089109010911092109310941095109610971098109911001101110211031104110511061107110811091110111111121113111411151116111711181119112011211122112311241125112611271128112911301131113211331134113511361137113811391140114111421143114411451146114711481149115011511152115311541155115611571158115911601161116211631164116511661167116811691170117111721173117411751176117711781179118011811182118311841185118611871188118911901191119211931194119511961197119811991200120112021203120412051206120712081209121012111212121312141215121612171218121912201221122212231224122512261227122812291230123112321233123412351236123712381239124012411242124312441245124612471248124912501251125212531254125512561257125812591260126112621263126412651266126712681269127012711272127312741275127612771278127912801281128212831284128512861287128812891290129112921293129412951296129712981299130013011302130313041305130613071308130913101311131213131314131513161317131813191320132113221323132413251326132713281329133013311332133313341335133613371338133913401341134213431344134513461347134813491350135113521353135413551356135713581359136013611362136313641365136613671368136913701371137213731374137513761377137813791380138113821383138413851386138713881389139013911392139313941395139613971398139914001401140214031404140514061407140814091410141114121413141414151416141714181419142014211422142314241425142614271428142914301431143214331434143514361437143814391440144114421443144414451446144714481449145014511452145314541455145614571458145914601461146214631464146514661467146814691470147114721473147414751476147714781479148014811482148314841485148614871488148914901491149214931494149514961497149814991500150115021503150415051506150715081509151015111512151315141515151615171518151915201521152215231524152515261527152815291530153115321533153415351536153715381539154015411542154315441545154615471548154915501551155215531554155515561557155815591560156115621563156415651566156715681569157015711572157315741575157615771578157915801581158215831584158515861587158815891590159115921593159415951596159715981599160016011602160316041605160616071608160916101611161216131614161516161617161816191620162116221623162416251626162716281629163016311632163316341635163616371638163916401641164216431644164516461647164816491650165116521653165416551656165716581659166016611662166316641665166616671668166916701671167216731674167516761677167816791680168116821683168416851686168716881689169016911692169316941695169616971698169917001701170217031704170517061707170817091710171117121713171417151716171717181719172017211722172317241725172617271728172917301731173217331734173517361737173817391740174117421743174417451746174717481749175017511752175317541755175617571758175917601761176217631764176517661767176817691770177117721773177417751776177717781779178017811782178317841785178617871788178917901791179217931794179517961797179817991800180118021803180418051806180718081809181018111812181318141815181618171818181918201821182218231824182518261827182818291830183118321833183418351836183718381839184018411842184318441845184618471848184918501851185218531854185518561857185818591860186118621863186418651866186718681869187018711872187318741875187618771878187918801881188218831884188518861887188818891890189118921893189418951896189718981899190019011902190319041905190619071908190919101911191219131914191519161917191819191920192119221923192419251926192719281929193019311932193319341935193619371938193919401941194219431944194519461947194819491950195119521953195419551956195719581959196019611962196319641965196619671968196919701971197219731974197519761977197819791980198119821983198419851986198719881989199019911992199319941995199619971998199920002001200220032004200520062007200820092010201120122013201420152016201720182019202020212022202320242025202620272028202920302031203220332034203520362037203820392040204120422043204420452046204720482049205020512052205320542055205620572058205920602061206220632064206520662067206820692070207120722073207420752076207720782079208020812082208320842085208620872088208920902091209220932094209520962097209820992100210121022103210421052106210721082109211021112112211321142115211621172118211921202121212221232124212521262127212821292130213121322133213421352136213721382139214021412142214321442145214621472148214921502151215221532154215521562157215821592160216121622163216421652166216721682169217021712172217321742175217621772178217921802181218221832184218521862187218821892190219121922193219421952196219721982199220022012202220322042205220622072208220922102211221222132214221522162217221822192220222122222223222422252226222722282229223022312232223322342235223622372238223922402241224222432244224522462247224822492250225122522253225422552256225722582259226022612262226322642265226622672268226922702271227222732274227522762277227822792280228122822283228422852286
  1. /* StarPU --- Runtime system for heterogeneous multicore architectures.
  2. *
  3. * Copyright (C) 2011, 2013 INRIA
  4. *
  5. * StarPU is free software; you can redistribute it and/or modify
  6. * it under the terms of the GNU Lesser General Public License as published by
  7. * the Free Software Foundation; either version 2.1 of the License, or (at
  8. * your option) any later version.
  9. *
  10. * StarPU is distributed in the hope that it will be useful, but
  11. * WITHOUT ANY WARRANTY; without even the implied warranty of
  12. * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.
  13. *
  14. * See the GNU Lesser General Public License in COPYING.LGPL for more details.
  15. */
  16. #include <core/sched_policy.h>
  17. #include <core/sched_ctx.h>
  18. #include <common/utils.h>
  19. #include <stdarg.h>
  20. starpu_pthread_rwlock_t changing_ctx_mutex[STARPU_NMAX_SCHED_CTXS];
  21. static starpu_pthread_mutex_t sched_ctx_manag = STARPU_PTHREAD_MUTEX_INITIALIZER;
  22. static starpu_pthread_mutex_t finished_submit_mutex = STARPU_PTHREAD_MUTEX_INITIALIZER;
  23. static struct starpu_task stop_submission_task = STARPU_TASK_INITIALIZER;
  24. starpu_pthread_key_t sched_ctx_key;
  25. static unsigned with_hypervisor = 0;
  26. static double hyp_start_sample[STARPU_NMAX_SCHED_CTXS];
  27. static double hyp_start_allow_sample[STARPU_NMAX_SCHED_CTXS];
  28. static double flops[STARPU_NMAX_SCHED_CTXS][STARPU_NMAXWORKERS];
  29. static size_t data_size[STARPU_NMAX_SCHED_CTXS][STARPU_NMAXWORKERS];
  30. static double hyp_actual_start_sample[STARPU_NMAX_SCHED_CTXS];
  31. static unsigned _starpu_get_first_free_sched_ctx(struct _starpu_machine_config *config);
  32. static void _starpu_sched_ctx_add_workers_to_master(unsigned sched_ctx_id, int *workerids, int nworkers, int new_master);
  33. static void _starpu_sched_ctx_wake_these_workers_up(unsigned sched_ctx_id, int *workerids, int nworkers);
  34. static int _starpu_sched_ctx_find_master(unsigned sched_ctx_id, int *workerids, int nworkers);
  35. static void _starpu_sched_ctx_set_master(struct _starpu_sched_ctx *sched_ctx, int *workerids, int nworkers, int master);
  36. static void _starpu_worker_gets_into_ctx(unsigned sched_ctx_id, struct _starpu_worker *worker)
  37. {
  38. unsigned ret_sched_ctx = _starpu_sched_ctx_list_get_sched_ctx(worker->sched_ctx_list, sched_ctx_id);
  39. /* the worker was planning to go away in another ctx but finally he changed his mind &
  40. he's staying */
  41. if (ret_sched_ctx == STARPU_NMAX_SCHED_CTXS)
  42. {
  43. /* add context to worker */
  44. _starpu_sched_ctx_list_add(&worker->sched_ctx_list, sched_ctx_id);
  45. worker->nsched_ctxs++;
  46. }
  47. worker->removed_from_ctx[sched_ctx_id] = 0;
  48. if(worker->tmp_sched_ctx == (int) sched_ctx_id)
  49. worker->tmp_sched_ctx = -1;
  50. return;
  51. }
  52. void _starpu_worker_gets_out_of_ctx(unsigned sched_ctx_id, struct _starpu_worker *worker)
  53. {
  54. unsigned ret_sched_ctx = _starpu_sched_ctx_list_get_sched_ctx(worker->sched_ctx_list, sched_ctx_id);
  55. /* remove context from worker */
  56. if(ret_sched_ctx != STARPU_NMAX_SCHED_CTXS)
  57. {
  58. /* don't remove scheduling data here, there might be tasks running and when post_exec
  59. executes scheduling data is not there any more, do it when deleting context, then
  60. we really won't need it anymore */
  61. /* struct _starpu_sched_ctx *sched_ctx = _starpu_get_sched_ctx_struct(sched_ctx_id); */
  62. /* if(sched_ctx && sched_ctx->sched_policy && sched_ctx->sched_policy->remove_workers) */
  63. /* { */
  64. /* _STARPU_TRACE_WORKER_SCHEDULING_PUSH; */
  65. /* sched_ctx->sched_policy->remove_workers(sched_ctx_id, &worker->workerid, 1); */
  66. /* _STARPU_TRACE_WORKER_SCHEDULING_POP; */
  67. /* } */
  68. _starpu_sched_ctx_list_remove(&worker->sched_ctx_list, sched_ctx_id);
  69. worker->nsched_ctxs--;
  70. }
  71. return;
  72. }
  73. static void _starpu_update_workers_with_ctx(int *workerids, int nworkers, int sched_ctx_id)
  74. {
  75. int i;
  76. struct _starpu_worker *worker = NULL;
  77. for(i = 0; i < nworkers; i++)
  78. {
  79. worker = _starpu_get_worker_struct(workerids[i]);
  80. STARPU_PTHREAD_MUTEX_LOCK(&worker->sched_mutex);
  81. _starpu_worker_gets_into_ctx(sched_ctx_id, worker);
  82. STARPU_PTHREAD_MUTEX_UNLOCK(&worker->sched_mutex);
  83. }
  84. return;
  85. }
  86. static void _starpu_update_workers_without_ctx(int *workerids, int nworkers, int sched_ctx_id, unsigned now)
  87. {
  88. int i;
  89. struct _starpu_worker *worker = NULL;
  90. for(i = 0; i < nworkers; i++)
  91. {
  92. worker = _starpu_get_worker_struct(workerids[i]);
  93. if(now)
  94. {
  95. STARPU_PTHREAD_MUTEX_LOCK(&worker->sched_mutex);
  96. _starpu_worker_gets_out_of_ctx(sched_ctx_id, worker);
  97. STARPU_PTHREAD_MUTEX_UNLOCK(&worker->sched_mutex);
  98. }
  99. else
  100. {
  101. STARPU_PTHREAD_MUTEX_LOCK(&worker->sched_mutex);
  102. worker->removed_from_ctx[sched_ctx_id] = 1;
  103. STARPU_PTHREAD_MUTEX_UNLOCK(&worker->sched_mutex);
  104. }
  105. }
  106. return;
  107. }
  108. void starpu_sched_ctx_stop_task_submission()
  109. {
  110. _starpu_exclude_task_from_dag(&stop_submission_task);
  111. _starpu_task_submit_internally(&stop_submission_task);
  112. }
  113. void starpu_sched_ctx_worker_shares_tasks_lists(int workerid, int sched_ctx_id)
  114. {
  115. struct _starpu_worker *worker = _starpu_get_worker_struct(workerid);
  116. struct _starpu_sched_ctx *sched_ctx = _starpu_get_sched_ctx_struct(sched_ctx_id);
  117. int curr_workerid = starpu_worker_get_id();
  118. /* if is the initial sched_ctx no point in taking the mutex, the workers are
  119. not launched yet, or if the current worker is calling this */
  120. if(!sched_ctx->is_initial_sched && workerid != curr_workerid)
  121. STARPU_PTHREAD_MUTEX_LOCK(&worker->sched_mutex);
  122. worker->shares_tasks_lists[sched_ctx_id] = 1;
  123. if(!sched_ctx->is_initial_sched && workerid != curr_workerid)
  124. STARPU_PTHREAD_MUTEX_UNLOCK(&worker->sched_mutex);
  125. }
  126. static void _starpu_add_workers_to_sched_ctx(struct _starpu_sched_ctx *sched_ctx, int *workerids, int nworkers,
  127. int *added_workers, int *n_added_workers)
  128. {
  129. struct starpu_worker_collection *workers = sched_ctx->workers;
  130. struct _starpu_machine_config *config = (struct _starpu_machine_config *)_starpu_get_machine_config();
  131. int nworkers_to_add = nworkers == -1 ? (int)config->topology.nworkers : nworkers;
  132. int workers_to_add[nworkers_to_add];
  133. struct starpu_perfmodel_device devices[nworkers_to_add];
  134. int ndevices = 0;
  135. struct _starpu_worker *str_worker = NULL;
  136. int worker;
  137. int i = 0;
  138. for(i = 0; i < nworkers_to_add; i++)
  139. {
  140. /* added_workers is NULL for the call of this func at the creation of the context*/
  141. /* if the function is called at the creation of the context it's no need to do this verif */
  142. if(added_workers)
  143. {
  144. worker = workers->add(workers, (workerids == NULL ? i : workerids[i]));
  145. if(worker >= 0)
  146. added_workers[(*n_added_workers)++] = worker;
  147. else
  148. {
  149. int curr_workerid = starpu_worker_get_id();
  150. struct _starpu_worker *worker_str = _starpu_get_worker_struct(workerids[i]);
  151. if(curr_workerid != workerids[i])
  152. STARPU_PTHREAD_MUTEX_LOCK(&worker_str->sched_mutex);
  153. worker_str->removed_from_ctx[sched_ctx->id] = 0;
  154. if(curr_workerid != workerids[i])
  155. STARPU_PTHREAD_MUTEX_UNLOCK(&worker_str->sched_mutex);
  156. }
  157. }
  158. else
  159. {
  160. worker = (workerids == NULL ? i : workerids[i]);
  161. workers->add(workers, worker);
  162. workers_to_add[i] = worker;
  163. str_worker = _starpu_get_worker_struct(worker);
  164. str_worker->tmp_sched_ctx = (int)sched_ctx->id;
  165. }
  166. }
  167. int *wa;
  168. int na;
  169. if(added_workers)
  170. {
  171. na = *n_added_workers;
  172. wa = added_workers;
  173. }
  174. else
  175. {
  176. na = nworkers_to_add;
  177. wa = workers_to_add;
  178. }
  179. for(i = 0; i < na; i++)
  180. {
  181. worker = wa[i];
  182. str_worker = _starpu_get_worker_struct(worker);
  183. int dev1, dev2;
  184. unsigned found = 0;
  185. for(dev1 = 0; dev1 < str_worker->perf_arch.ndevices; dev1++)
  186. {
  187. for(dev2 = 0; dev2 < ndevices; dev2++)
  188. {
  189. if(devices[dev2].type == str_worker->perf_arch.devices[dev1].type &&
  190. devices[dev2].devid == str_worker->perf_arch.devices[dev1].devid)
  191. {
  192. devices[dev2].ncores += str_worker->perf_arch.devices[dev1].ncores;
  193. found = 1;
  194. break;
  195. }
  196. }
  197. if(!found)
  198. {
  199. devices[ndevices].type = str_worker->perf_arch.devices[dev1].type;
  200. devices[ndevices].devid = str_worker->perf_arch.devices[dev1].devid;
  201. devices[ndevices].ncores = str_worker->perf_arch.devices[dev1].ncores;
  202. ndevices++;
  203. }
  204. else
  205. found = 0;
  206. }
  207. }
  208. if(ndevices > 0)
  209. {
  210. if(sched_ctx->perf_arch.devices == NULL)
  211. sched_ctx->perf_arch.devices = (struct starpu_perfmodel_device*)malloc(ndevices*sizeof(struct starpu_perfmodel_device));
  212. else
  213. {
  214. int nfinal_devices = 0;
  215. int dev1, dev2;
  216. unsigned found = 0;
  217. for(dev1 = 0; dev1 < ndevices; dev1++)
  218. {
  219. for(dev2 = 0; dev2 < sched_ctx->perf_arch.ndevices; dev2++)
  220. {
  221. if(sched_ctx->perf_arch.devices[dev2].type == devices[dev1].type && sched_ctx->perf_arch.devices[dev2].devid == devices[dev1].devid)
  222. found = 1;
  223. }
  224. if(!found)
  225. {
  226. nfinal_devices++;
  227. }
  228. else
  229. found = 0;
  230. }
  231. int nsize = (sched_ctx->perf_arch.ndevices+nfinal_devices);
  232. sched_ctx->perf_arch.devices = (struct starpu_perfmodel_device*)realloc(sched_ctx->perf_arch.devices, nsize*sizeof(struct starpu_perfmodel_device));
  233. }
  234. int dev1, dev2;
  235. unsigned found = 0;
  236. for(dev1 = 0; dev1 < ndevices; dev1++)
  237. {
  238. for(dev2 = 0; dev2 < sched_ctx->perf_arch.ndevices; dev2++)
  239. {
  240. if(sched_ctx->perf_arch.devices[dev2].type == devices[dev1].type && sched_ctx->perf_arch.devices[dev2].devid == devices[dev1].devid)
  241. {
  242. if(sched_ctx->perf_arch.devices[dev2].type == STARPU_CPU_WORKER)
  243. sched_ctx->perf_arch.devices[dev2].ncores += devices[dev1].ncores;
  244. found = 1;
  245. }
  246. }
  247. if(!found)
  248. {
  249. sched_ctx->perf_arch.devices[sched_ctx->perf_arch.ndevices].type = devices[dev1].type;
  250. sched_ctx->perf_arch.devices[sched_ctx->perf_arch.ndevices].devid = devices[dev1].devid;
  251. sched_ctx->perf_arch.devices[sched_ctx->perf_arch.ndevices].ncores = devices[dev1].ncores;
  252. sched_ctx->perf_arch.ndevices++;
  253. }
  254. else
  255. found = 0;
  256. }
  257. }
  258. if(!sched_ctx->sched_policy)
  259. {
  260. if(!sched_ctx->awake_workers)
  261. {
  262. if(sched_ctx->main_master == -1)
  263. sched_ctx->main_master = starpu_sched_ctx_book_workers_for_task(sched_ctx->id, wa, na);
  264. else
  265. {
  266. _starpu_sched_ctx_add_workers_to_master(sched_ctx->id, wa, na, sched_ctx->main_master);
  267. }
  268. }
  269. else
  270. {
  271. sched_ctx->main_master = _starpu_sched_ctx_find_master(sched_ctx->id, wa, na);
  272. _starpu_sched_ctx_set_master(sched_ctx, wa, na, sched_ctx->main_master);
  273. }
  274. }
  275. else if(sched_ctx->sched_policy->add_workers)
  276. {
  277. _STARPU_TRACE_WORKER_SCHEDULING_PUSH;
  278. if(added_workers)
  279. {
  280. if(*n_added_workers > 0)
  281. sched_ctx->sched_policy->add_workers(sched_ctx->id, added_workers, *n_added_workers);
  282. }
  283. else
  284. {
  285. sched_ctx->sched_policy->add_workers(sched_ctx->id, workers_to_add, nworkers_to_add);
  286. }
  287. _STARPU_TRACE_WORKER_SCHEDULING_POP;
  288. }
  289. return;
  290. }
  291. static void _starpu_remove_workers_from_sched_ctx(struct _starpu_sched_ctx *sched_ctx, int *workerids,
  292. int nworkers, int *removed_workers, int *n_removed_workers)
  293. {
  294. struct starpu_worker_collection *workers = sched_ctx->workers;
  295. struct starpu_perfmodel_device devices[workers->nworkers];
  296. int ndevices = 0;
  297. int i = 0;
  298. for(i = 0; i < nworkers; i++)
  299. {
  300. if(workers->nworkers > 0)
  301. {
  302. if(_starpu_worker_belongs_to_a_sched_ctx(workerids[i], sched_ctx->id))
  303. {
  304. int worker = workers->remove(workers, workerids[i]);
  305. if(worker >= 0)
  306. removed_workers[(*n_removed_workers)++] = worker;
  307. }
  308. }
  309. }
  310. int worker;
  311. unsigned found = 0;
  312. int dev;
  313. struct starpu_sched_ctx_iterator it;
  314. if(workers->init_iterator)
  315. workers->init_iterator(workers, &it);
  316. while(workers->has_next(workers, &it))
  317. {
  318. worker = workers->get_next(workers, &it);
  319. struct _starpu_worker *str_worker = _starpu_get_worker_struct(worker);
  320. for(dev = 0; dev < str_worker->perf_arch.ndevices; dev++)
  321. {
  322. int dev2;
  323. for(dev2 = 0; dev2 < ndevices; dev2++)
  324. {
  325. if(devices[dev2].type == str_worker->perf_arch.devices[dev].type &&
  326. devices[dev2].devid == str_worker->perf_arch.devices[dev].devid)
  327. {
  328. if(devices[dev2].type == STARPU_CPU_WORKER)
  329. devices[dev2].ncores += str_worker->perf_arch.devices[dev].ncores;
  330. }
  331. found = 1;
  332. }
  333. if(!found)
  334. {
  335. devices[ndevices].type = str_worker->perf_arch.devices[dev].type;
  336. devices[ndevices].devid = str_worker->perf_arch.devices[dev].devid;
  337. devices[ndevices].ncores = str_worker->perf_arch.devices[dev].ncores;
  338. ndevices++;
  339. }
  340. else
  341. found = 0;
  342. }
  343. found = 0;
  344. }
  345. sched_ctx->perf_arch.ndevices = ndevices;
  346. for(dev = 0; dev < ndevices; dev++)
  347. {
  348. sched_ctx->perf_arch.devices[dev].type = devices[dev].type;
  349. sched_ctx->perf_arch.devices[dev].devid = devices[dev].devid;
  350. sched_ctx->perf_arch.devices[dev].ncores = devices[dev].ncores;
  351. }
  352. if(!sched_ctx->sched_policy)
  353. {
  354. if(!sched_ctx->awake_workers)
  355. {
  356. _starpu_sched_ctx_wake_these_workers_up(sched_ctx->id, removed_workers, *n_removed_workers);
  357. }
  358. }
  359. return;
  360. }
  361. static void _starpu_sched_ctx_free_scheduling_data(struct _starpu_sched_ctx *sched_ctx)
  362. {
  363. if(sched_ctx->sched_policy && sched_ctx->sched_policy->remove_workers)
  364. {
  365. int *workerids = NULL;
  366. unsigned nworkers_ctx = starpu_sched_ctx_get_workers_list(sched_ctx->id, &workerids);
  367. if(nworkers_ctx > 0)
  368. {
  369. _STARPU_TRACE_WORKER_SCHEDULING_PUSH;
  370. sched_ctx->sched_policy->remove_workers(sched_ctx->id, workerids, nworkers_ctx);
  371. _STARPU_TRACE_WORKER_SCHEDULING_POP;
  372. }
  373. free(workerids);
  374. }
  375. return;
  376. }
  377. #ifdef STARPU_HAVE_HWLOC
  378. static void _starpu_sched_ctx_create_hwloc_tree(struct _starpu_sched_ctx *sched_ctx)
  379. {
  380. sched_ctx->hwloc_workers_set = hwloc_bitmap_alloc();
  381. struct starpu_worker_collection *workers = sched_ctx->workers;
  382. struct _starpu_worker *worker;
  383. struct starpu_sched_ctx_iterator it;
  384. workers->init_iterator(workers, &it);
  385. while(workers->has_next(workers, &it))
  386. {
  387. worker = _starpu_get_worker_struct(workers->get_next(workers, &it));
  388. if(!starpu_worker_is_combined_worker(worker->workerid))
  389. {
  390. hwloc_bitmap_or(sched_ctx->hwloc_workers_set,
  391. sched_ctx->hwloc_workers_set,
  392. worker->hwloc_cpu_set);
  393. }
  394. }
  395. return;
  396. }
  397. #endif
  398. struct _starpu_sched_ctx* _starpu_create_sched_ctx(struct starpu_sched_policy *policy, int *workerids,
  399. int nworkers_ctx, unsigned is_initial_sched,
  400. const char *sched_ctx_name,
  401. int min_prio_set, int min_prio,
  402. int max_prio_set, int max_prio, unsigned awake_workers)
  403. {
  404. struct _starpu_machine_config *config = (struct _starpu_machine_config *)_starpu_get_machine_config();
  405. STARPU_PTHREAD_MUTEX_LOCK(&sched_ctx_manag);
  406. STARPU_ASSERT(config->topology.nsched_ctxs < STARPU_NMAX_SCHED_CTXS);
  407. unsigned id = _starpu_get_first_free_sched_ctx(config);
  408. struct _starpu_sched_ctx *sched_ctx = &config->sched_ctxs[id];
  409. sched_ctx->id = id;
  410. config->topology.nsched_ctxs++;
  411. STARPU_PTHREAD_MUTEX_UNLOCK(&sched_ctx_manag);
  412. int nworkers = config->topology.nworkers;
  413. STARPU_ASSERT(nworkers_ctx <= nworkers);
  414. STARPU_PTHREAD_MUTEX_INIT(&sched_ctx->empty_ctx_mutex, NULL);
  415. starpu_task_list_init(&sched_ctx->empty_ctx_tasks);
  416. STARPU_PTHREAD_MUTEX_INIT(&sched_ctx->waiting_tasks_mutex, NULL);
  417. starpu_task_list_init(&sched_ctx->waiting_tasks);
  418. sched_ctx->sched_policy = policy ? (struct starpu_sched_policy*)malloc(sizeof(struct starpu_sched_policy)) : NULL;
  419. sched_ctx->is_initial_sched = is_initial_sched;
  420. sched_ctx->name = sched_ctx_name;
  421. sched_ctx->inheritor = STARPU_NMAX_SCHED_CTXS;
  422. sched_ctx->finished_submit = 0;
  423. sched_ctx->min_priority_is_set = min_prio_set;
  424. if (sched_ctx->min_priority_is_set) sched_ctx->min_priority = min_prio;
  425. sched_ctx->max_priority_is_set = max_prio_set;
  426. if (sched_ctx->max_priority_is_set) sched_ctx->max_priority = max_prio;
  427. _starpu_barrier_counter_init(&sched_ctx->tasks_barrier, 0);
  428. _starpu_barrier_counter_init(&sched_ctx->ready_tasks_barrier, 0);
  429. sched_ctx->ready_flops = 0.0;
  430. sched_ctx->main_master = -1;
  431. sched_ctx->perf_arch.devices = NULL;
  432. sched_ctx->perf_arch.ndevices = 0;
  433. int w;
  434. for(w = 0; w < nworkers; w++)
  435. {
  436. sem_init(&sched_ctx->fall_asleep_sem[w], 0, 0);
  437. sem_init(&sched_ctx->wake_up_sem[w], 0, 0);
  438. STARPU_PTHREAD_COND_INIT(&sched_ctx->parallel_sect_cond[w], NULL);
  439. STARPU_PTHREAD_MUTEX_INIT(&sched_ctx->parallel_sect_mutex[w], NULL);
  440. sched_ctx->master[w] = -1;
  441. sched_ctx->parallel_sect[w] = 0;
  442. sched_ctx->sleeping[w] = 0;
  443. }
  444. /*init the strategy structs and the worker_collection of the ressources of the context */
  445. if(policy)
  446. {
  447. _starpu_init_sched_policy(config, sched_ctx, policy);
  448. sched_ctx->awake_workers = 1;
  449. }
  450. else
  451. {
  452. sched_ctx->awake_workers = awake_workers;
  453. starpu_sched_ctx_create_worker_collection(sched_ctx->id, STARPU_WORKER_LIST);
  454. }
  455. /* after having an worker_collection on the ressources add them */
  456. _starpu_add_workers_to_sched_ctx(sched_ctx, workerids, nworkers_ctx, NULL, NULL);
  457. #ifdef STARPU_HAVE_HWLOC
  458. /* build hwloc tree of the context */
  459. _starpu_sched_ctx_create_hwloc_tree(sched_ctx);
  460. #endif //STARPU_HAVE_HWLOC
  461. /* if we create the initial big sched ctx we can update workers' status here
  462. because they haven't been launched yet */
  463. if(is_initial_sched)
  464. {
  465. int i;
  466. /*initialize the mutexes for all contexts */
  467. for(i = 0; i < STARPU_NMAX_SCHED_CTXS; i++)
  468. STARPU_PTHREAD_RWLOCK_INIT(&changing_ctx_mutex[i], NULL);
  469. for(i = 0; i < nworkers; i++)
  470. {
  471. struct _starpu_worker *worker = _starpu_get_worker_struct(i);
  472. worker->sched_ctx_list = (struct _starpu_sched_ctx_list*)malloc(sizeof(struct _starpu_sched_ctx_list));
  473. _starpu_sched_ctx_list_init(worker->sched_ctx_list);
  474. _starpu_sched_ctx_list_add(&worker->sched_ctx_list, sched_ctx->id);
  475. worker->nsched_ctxs++;
  476. }
  477. }
  478. return sched_ctx;
  479. }
  480. static void _get_workers(int min, int max, int *workers, int *nw, enum starpu_worker_archtype arch, unsigned allow_overlap)
  481. {
  482. int pus[max];
  483. int npus = 0;
  484. int i;
  485. int n = 0;
  486. struct _starpu_machine_config *config = (struct _starpu_machine_config *)_starpu_get_machine_config();
  487. if(config->topology.nsched_ctxs == 1)
  488. {
  489. /*we have all available resources */
  490. npus = starpu_worker_get_nids_by_type(arch, pus, max);
  491. /*TODO: hierarchical ctxs: get max good workers: close one to another */
  492. for(i = 0; i < npus; i++)
  493. workers[(*nw)++] = pus[i];
  494. }
  495. else
  496. {
  497. unsigned enough_ressources = 0;
  498. npus = starpu_worker_get_nids_ctx_free_by_type(arch, pus, max);
  499. for(i = 0; i < npus; i++)
  500. workers[(*nw)++] = pus[i];
  501. if(npus == max)
  502. /*we have enough available resources */
  503. enough_ressources = 1;
  504. if(!enough_ressources && npus >= min)
  505. /*we have enough available resources */
  506. enough_ressources = 1;
  507. if(!enough_ressources)
  508. {
  509. /* try to get ressources from ctx who have more than the min of workers they need */
  510. int s;
  511. for(s = 1; s < STARPU_NMAX_SCHED_CTXS; s++)
  512. {
  513. if(config->sched_ctxs[s].id != STARPU_NMAX_SCHED_CTXS)
  514. {
  515. int _npus = 0;
  516. int _pus[STARPU_NMAXWORKERS];
  517. _npus = _starpu_get_workers_of_sched_ctx(config->sched_ctxs[s].id, _pus, arch);
  518. int ctx_min = arch == STARPU_CPU_WORKER ? config->sched_ctxs[s].min_ncpus : config->sched_ctxs[s].min_ngpus;
  519. if(_npus > ctx_min)
  520. {
  521. if(npus < min)
  522. {
  523. n = (_npus - ctx_min) > (min - npus) ? min - npus : (_npus - ctx_min);
  524. npus += n;
  525. }
  526. /*TODO: hierarchical ctxs: get n good workers: close to the other ones I already assigned to the ctx */
  527. for(i = 0; i < n; i++)
  528. workers[(*nw)++] = _pus[i];
  529. starpu_sched_ctx_remove_workers(_pus, n, config->sched_ctxs[s].id);
  530. }
  531. }
  532. }
  533. if(npus >= min)
  534. enough_ressources = 1;
  535. }
  536. if(!enough_ressources)
  537. {
  538. /* if there is no available workers to satisfy the minimum required
  539. give them workers proportional to their requirements*/
  540. int global_npus = starpu_worker_get_count_by_type(arch);
  541. int req_npus = 0;
  542. int s;
  543. for(s = 1; s < STARPU_NMAX_SCHED_CTXS; s++)
  544. if(config->sched_ctxs[s].id != STARPU_NMAX_SCHED_CTXS)
  545. req_npus += arch == STARPU_CPU_WORKER ? config->sched_ctxs[s].min_ncpus : config->sched_ctxs[s].min_ngpus;
  546. req_npus += min;
  547. for(s = 1; s < STARPU_NMAX_SCHED_CTXS; s++)
  548. {
  549. if(config->sched_ctxs[s].id != STARPU_NMAX_SCHED_CTXS)
  550. {
  551. int ctx_min = arch == STARPU_CPU_WORKER ? config->sched_ctxs[s].min_ncpus : config->sched_ctxs[s].min_ngpus;
  552. double needed_npus = ((double)ctx_min * (double)global_npus) / (double)req_npus;
  553. int _npus = 0;
  554. int _pus[STARPU_NMAXWORKERS];
  555. _npus = _starpu_get_workers_of_sched_ctx(config->sched_ctxs[s].id, _pus, arch);
  556. if(needed_npus < (double)_npus)
  557. {
  558. double npus_to_rem = (double)_npus - needed_npus;
  559. int x = floor(npus_to_rem);
  560. double x_double = (double)x;
  561. double diff = npus_to_rem - x_double;
  562. int npus_to_remove = diff >= 0.5 ? x+1 : x;
  563. int pus_to_remove[npus_to_remove];
  564. int c = 0;
  565. /*TODO: hierarchical ctxs: get npus_to_remove good workers: close to the other ones I already assigned to the ctx */
  566. for(i = _npus-1; i >= (_npus - npus_to_remove); i--)
  567. {
  568. workers[(*nw)++] = _pus[i];
  569. pus_to_remove[c++] = _pus[i];
  570. }
  571. if(!allow_overlap)
  572. starpu_sched_ctx_remove_workers(pus_to_remove, npus_to_remove, config->sched_ctxs[s].id);
  573. }
  574. }
  575. }
  576. }
  577. }
  578. }
  579. unsigned starpu_sched_ctx_create_inside_interval(const char *policy_name, const char *sched_ctx_name,
  580. int min_ncpus, int max_ncpus, int min_ngpus, int max_ngpus,
  581. unsigned allow_overlap)
  582. {
  583. struct _starpu_machine_config *config = (struct _starpu_machine_config *)_starpu_get_machine_config();
  584. struct starpu_sched_policy *selected_policy = _starpu_select_sched_policy(config, policy_name);
  585. struct _starpu_sched_ctx *sched_ctx = NULL;
  586. int workers[max_ncpus + max_ngpus];
  587. int nw = 0;
  588. STARPU_PTHREAD_MUTEX_LOCK(&sched_ctx_manag);
  589. _get_workers(min_ncpus, max_ncpus, workers, &nw, STARPU_CPU_WORKER, allow_overlap);
  590. _get_workers(min_ngpus, max_ngpus, workers, &nw, STARPU_CUDA_WORKER, allow_overlap);
  591. STARPU_PTHREAD_MUTEX_UNLOCK(&sched_ctx_manag);
  592. int i;
  593. printf("%d: ", nw);
  594. for(i = 0; i < nw; i++)
  595. printf("%d ", workers[i]);
  596. printf("\n");
  597. sched_ctx = _starpu_create_sched_ctx(selected_policy, workers, nw, 0, sched_ctx_name, 0, 0, 0, 0, 1);
  598. sched_ctx->min_ncpus = min_ncpus;
  599. sched_ctx->max_ncpus = max_ncpus;
  600. sched_ctx->min_ngpus = min_ngpus;
  601. sched_ctx->max_ngpus = max_ngpus;
  602. _starpu_unlock_mutex_if_prev_locked();
  603. int *added_workerids;
  604. unsigned nw_ctx = starpu_sched_ctx_get_workers_list(sched_ctx->id, &added_workerids);
  605. _starpu_update_workers_without_ctx(added_workerids, nw_ctx, sched_ctx->id, 0);
  606. free(added_workerids);
  607. _starpu_relock_mutex_if_prev_locked();
  608. #ifdef STARPU_USE_SC_HYPERVISOR
  609. sched_ctx->perf_counters = NULL;
  610. #endif
  611. return sched_ctx->id;
  612. }
  613. unsigned starpu_sched_ctx_create(int *workerids, int nworkers, const char *sched_ctx_name, ...)
  614. {
  615. va_list varg_list;
  616. int arg_type;
  617. int min_prio_set = 0;
  618. int max_prio_set = 0;
  619. int min_prio = 0;
  620. int max_prio = 0;
  621. struct starpu_sched_policy *sched_policy = NULL;
  622. unsigned hierarchy_level = 0;
  623. unsigned nesting_sched_ctx = STARPU_NMAX_SCHED_CTXS;
  624. unsigned awake_workers = 0;
  625. va_start(varg_list, sched_ctx_name);
  626. while ((arg_type = va_arg(varg_list, int)) != 0)
  627. {
  628. if (arg_type == STARPU_SCHED_CTX_POLICY_NAME)
  629. {
  630. char *policy_name = va_arg(varg_list, char *);
  631. struct _starpu_machine_config *config = (struct _starpu_machine_config *)_starpu_get_machine_config();
  632. sched_policy = _starpu_select_sched_policy(config, policy_name);
  633. }
  634. else if (arg_type == STARPU_SCHED_CTX_POLICY_STRUCT)
  635. {
  636. sched_policy = va_arg(varg_list, struct starpu_sched_policy *);
  637. }
  638. else if (arg_type == STARPU_SCHED_CTX_POLICY_MIN_PRIO)
  639. {
  640. min_prio = va_arg(varg_list, int);
  641. min_prio_set = 1;
  642. }
  643. else if (arg_type == STARPU_SCHED_CTX_POLICY_MAX_PRIO)
  644. {
  645. max_prio = va_arg(varg_list, int);
  646. max_prio_set = 1;
  647. }
  648. else if (arg_type == STARPU_SCHED_CTX_HIERARCHY_LEVEL)
  649. {
  650. hierarchy_level = va_arg(varg_list, unsigned);
  651. }
  652. else if (arg_type == STARPU_SCHED_CTX_NESTED)
  653. {
  654. nesting_sched_ctx = va_arg(varg_list, unsigned);
  655. }
  656. else if (arg_type == STARPU_SCHED_CTX_AWAKE_WORKERS)
  657. {
  658. awake_workers = 1;
  659. }
  660. else
  661. {
  662. STARPU_ABORT_MSG("Unrecognized argument %d\n", arg_type);
  663. }
  664. }
  665. va_end(varg_list);
  666. struct _starpu_sched_ctx *sched_ctx = NULL;
  667. sched_ctx = _starpu_create_sched_ctx(sched_policy, workerids, nworkers, 0, sched_ctx_name, min_prio_set, min_prio, max_prio_set, max_prio, awake_workers);
  668. sched_ctx->hierarchy_level = hierarchy_level;
  669. sched_ctx->nesting_sched_ctx = nesting_sched_ctx;
  670. _starpu_unlock_mutex_if_prev_locked();
  671. int *added_workerids;
  672. unsigned nw_ctx = starpu_sched_ctx_get_workers_list(sched_ctx->id, &added_workerids);
  673. _starpu_update_workers_with_ctx(added_workerids, nw_ctx, sched_ctx->id);
  674. free(added_workerids);
  675. _starpu_relock_mutex_if_prev_locked();
  676. #ifdef STARPU_USE_SC_HYPERVISOR
  677. sched_ctx->perf_counters = NULL;
  678. #endif
  679. return sched_ctx->id;
  680. }
  681. void starpu_sched_ctx_register_close_callback(unsigned sched_ctx_id, void (*close_callback)(unsigned sched_ctx_id, void* args), void *args)
  682. {
  683. struct _starpu_sched_ctx *sched_ctx = _starpu_get_sched_ctx_struct(sched_ctx_id);
  684. sched_ctx->close_callback = close_callback;
  685. sched_ctx->close_args = args;
  686. return;
  687. }
  688. #ifdef STARPU_USE_SC_HYPERVISOR
  689. void starpu_sched_ctx_set_perf_counters(unsigned sched_ctx_id, void* perf_counters)
  690. {
  691. struct _starpu_sched_ctx *sched_ctx = _starpu_get_sched_ctx_struct(sched_ctx_id);
  692. sched_ctx->perf_counters = (struct starpu_sched_ctx_performance_counters *)perf_counters;
  693. return;
  694. }
  695. #endif
  696. /* free all structures for the context */
  697. static void _starpu_delete_sched_ctx(struct _starpu_sched_ctx *sched_ctx)
  698. {
  699. STARPU_ASSERT(sched_ctx->id != STARPU_NMAX_SCHED_CTXS);
  700. if(sched_ctx->sched_policy)
  701. {
  702. _starpu_deinit_sched_policy(sched_ctx);
  703. free(sched_ctx->sched_policy);
  704. sched_ctx->sched_policy = NULL;
  705. }
  706. else
  707. {
  708. starpu_sched_ctx_delete_worker_collection(sched_ctx->id);
  709. }
  710. if (sched_ctx->perf_arch.devices)
  711. {
  712. free(sched_ctx->perf_arch.devices);
  713. sched_ctx->perf_arch.devices = NULL;
  714. }
  715. STARPU_PTHREAD_MUTEX_DESTROY(&sched_ctx->empty_ctx_mutex);
  716. STARPU_PTHREAD_MUTEX_DESTROY(&sched_ctx->waiting_tasks_mutex);
  717. sched_ctx->id = STARPU_NMAX_SCHED_CTXS;
  718. #ifdef STARPU_HAVE_HWLOC
  719. hwloc_bitmap_free(sched_ctx->hwloc_workers_set);
  720. #endif //STARPU_HAVE_HWLOC
  721. struct _starpu_machine_config *config = _starpu_get_machine_config();
  722. STARPU_PTHREAD_MUTEX_LOCK(&sched_ctx_manag);
  723. config->topology.nsched_ctxs--;
  724. STARPU_PTHREAD_MUTEX_UNLOCK(&sched_ctx_manag);
  725. }
  726. void starpu_sched_ctx_delete(unsigned sched_ctx_id)
  727. {
  728. struct _starpu_sched_ctx *sched_ctx = _starpu_get_sched_ctx_struct(sched_ctx_id);
  729. #ifdef STARPU_USE_SC_HYPERVISOR
  730. if(sched_ctx != NULL && sched_ctx_id != 0 && sched_ctx_id != STARPU_NMAX_SCHED_CTXS
  731. && sched_ctx->perf_counters != NULL)
  732. {
  733. _STARPU_TRACE_HYPERVISOR_BEGIN();
  734. sched_ctx->perf_counters->notify_delete_context(sched_ctx_id);
  735. _STARPU_TRACE_HYPERVISOR_END();
  736. }
  737. #endif //STARPU_USE_SC_HYPERVISOR
  738. unsigned inheritor_sched_ctx_id = sched_ctx->inheritor;
  739. struct _starpu_sched_ctx *inheritor_sched_ctx = _starpu_get_sched_ctx_struct(sched_ctx->inheritor);
  740. _starpu_unlock_mutex_if_prev_locked();
  741. STARPU_PTHREAD_RWLOCK_WRLOCK(&changing_ctx_mutex[sched_ctx_id]);
  742. STARPU_ASSERT(sched_ctx->id != STARPU_NMAX_SCHED_CTXS);
  743. int *workerids;
  744. unsigned nworkers_ctx = starpu_sched_ctx_get_workers_list(sched_ctx->id, &workerids);
  745. /*if both of them have all the ressources is pointless*/
  746. /*trying to transfer ressources from one ctx to the other*/
  747. struct _starpu_machine_config *config = (struct _starpu_machine_config *)_starpu_get_machine_config();
  748. unsigned nworkers = config->topology.nworkers;
  749. if(nworkers_ctx > 0 && inheritor_sched_ctx && inheritor_sched_ctx->id != STARPU_NMAX_SCHED_CTXS &&
  750. !(nworkers_ctx == nworkers && nworkers_ctx == inheritor_sched_ctx->workers->nworkers))
  751. {
  752. starpu_sched_ctx_add_workers(workerids, nworkers_ctx, inheritor_sched_ctx_id);
  753. starpu_sched_ctx_set_priority(workerids, nworkers_ctx, inheritor_sched_ctx_id, 1);
  754. starpu_sched_ctx_set_priority_on_level(workerids, nworkers_ctx, inheritor_sched_ctx_id, 1);
  755. }
  756. if(!_starpu_wait_for_all_tasks_of_sched_ctx(sched_ctx_id))
  757. {
  758. if(!sched_ctx->sched_policy)
  759. starpu_sched_ctx_unbook_workers_for_task(sched_ctx->id, sched_ctx->main_master);
  760. /*if btw the mutex release & the mutex lock the context has changed take care to free all
  761. scheduling data before deleting the context */
  762. _starpu_update_workers_without_ctx(workerids, nworkers_ctx, sched_ctx_id, 1);
  763. _starpu_sched_ctx_free_scheduling_data(sched_ctx);
  764. _starpu_delete_sched_ctx(sched_ctx);
  765. }
  766. STARPU_PTHREAD_RWLOCK_UNLOCK(&changing_ctx_mutex[sched_ctx_id]);
  767. /* workerids is malloc-ed in starpu_sched_ctx_get_workers_list, don't forget to free it when
  768. you don't use it anymore */
  769. free(workerids);
  770. _starpu_relock_mutex_if_prev_locked();
  771. return;
  772. }
  773. /* called after the workers are terminated so we don't have anything else to do but free the memory*/
  774. void _starpu_delete_all_sched_ctxs()
  775. {
  776. unsigned i;
  777. for(i = 0; i < STARPU_NMAX_SCHED_CTXS; i++)
  778. {
  779. struct _starpu_sched_ctx *sched_ctx = _starpu_get_sched_ctx_struct(i);
  780. STARPU_PTHREAD_RWLOCK_WRLOCK(&changing_ctx_mutex[i]);
  781. if(sched_ctx->id != STARPU_NMAX_SCHED_CTXS)
  782. {
  783. _starpu_sched_ctx_free_scheduling_data(sched_ctx);
  784. _starpu_barrier_counter_destroy(&sched_ctx->tasks_barrier);
  785. _starpu_barrier_counter_destroy(&sched_ctx->ready_tasks_barrier);
  786. _starpu_delete_sched_ctx(sched_ctx);
  787. }
  788. STARPU_PTHREAD_RWLOCK_UNLOCK(&changing_ctx_mutex[i]);
  789. STARPU_PTHREAD_RWLOCK_DESTROY(&changing_ctx_mutex[i]);
  790. }
  791. return;
  792. }
  793. static void _starpu_check_workers(int *workerids, int nworkers)
  794. {
  795. struct _starpu_machine_config *config = (struct _starpu_machine_config *)_starpu_get_machine_config();
  796. int nworkers_conf = config->topology.nworkers;
  797. int i;
  798. for(i = 0; i < nworkers; i++)
  799. {
  800. /* take care the user does not ask for a resource that does not exist */
  801. STARPU_ASSERT_MSG(workerids[i] >= 0 && workerids[i] <= nworkers_conf, "requested to add workerid = %d, but that is beyond the range 0 to %d", workerids[i], nworkers_conf);
  802. }
  803. }
  804. void _starpu_fetch_tasks_from_empty_ctx_list(struct _starpu_sched_ctx *sched_ctx)
  805. {
  806. unsigned unlocked = 0;
  807. STARPU_PTHREAD_MUTEX_LOCK(&sched_ctx->empty_ctx_mutex);
  808. if(starpu_task_list_empty(&sched_ctx->empty_ctx_tasks))
  809. {
  810. STARPU_PTHREAD_MUTEX_UNLOCK(&sched_ctx->empty_ctx_mutex);
  811. return;
  812. }
  813. else
  814. /* you're not suppose to get here if you deleted the context
  815. so no point in having the mutex locked */
  816. STARPU_PTHREAD_RWLOCK_UNLOCK(&changing_ctx_mutex[sched_ctx->id]);
  817. while(!starpu_task_list_empty(&sched_ctx->empty_ctx_tasks))
  818. {
  819. if(unlocked)
  820. STARPU_PTHREAD_MUTEX_LOCK(&sched_ctx->empty_ctx_mutex);
  821. struct starpu_task *old_task = starpu_task_list_pop_back(&sched_ctx->empty_ctx_tasks);
  822. unlocked = 1;
  823. STARPU_PTHREAD_MUTEX_UNLOCK(&sched_ctx->empty_ctx_mutex);
  824. if(old_task == &stop_submission_task)
  825. break;
  826. int ret = _starpu_push_task_to_workers(old_task);
  827. /* if we should stop poping from empty ctx tasks */
  828. if(ret == -EAGAIN) break;
  829. }
  830. if(!unlocked)
  831. STARPU_PTHREAD_MUTEX_UNLOCK(&sched_ctx->empty_ctx_mutex);
  832. /* leave the mutex as it was to avoid pbs in the caller function */
  833. STARPU_PTHREAD_RWLOCK_RDLOCK(&changing_ctx_mutex[sched_ctx->id]);
  834. return;
  835. }
  836. unsigned _starpu_can_push_task(struct _starpu_sched_ctx *sched_ctx, struct starpu_task *task)
  837. {
  838. if(sched_ctx->sched_policy && sched_ctx->sched_policy->simulate_push_task)
  839. {
  840. const char *env_window_size = getenv("STARPU_WINDOW_TIME_SIZE");
  841. if(!env_window_size) return 1;
  842. double window_size = atof(env_window_size);
  843. starpu_pthread_rwlock_t *changing_ctx_mutex = _starpu_sched_ctx_get_changing_ctx_mutex(sched_ctx->id);
  844. STARPU_PTHREAD_RWLOCK_RDLOCK(changing_ctx_mutex);
  845. double expected_end = sched_ctx->sched_policy->simulate_push_task(task);
  846. STARPU_PTHREAD_RWLOCK_UNLOCK(changing_ctx_mutex);
  847. double expected_len = 0.0;
  848. if(hyp_actual_start_sample[sched_ctx->id] != 0.0)
  849. expected_len = expected_end - hyp_actual_start_sample[sched_ctx->id] ;
  850. else
  851. {
  852. printf("%d: sc start is 0.0\n", sched_ctx->id);
  853. expected_len = expected_end - starpu_timing_now();
  854. }
  855. if(expected_len < 0.0)
  856. printf("exp len negative %lf \n", expected_len);
  857. expected_len /= 1000000.0;
  858. // printf("exp_end %lf start %lf expected_len %lf \n", expected_end, hyp_actual_start_sample[sched_ctx->id], expected_len);
  859. if(expected_len > (window_size + 0.2*window_size))
  860. return 0;
  861. }
  862. return 1;
  863. }
  864. void _starpu_fetch_task_from_waiting_list(struct _starpu_sched_ctx *sched_ctx)
  865. {
  866. if(starpu_task_list_empty(&sched_ctx->waiting_tasks))
  867. return;
  868. struct starpu_task *old_task = starpu_task_list_back(&sched_ctx->waiting_tasks);
  869. if(_starpu_can_push_task(sched_ctx, old_task))
  870. {
  871. old_task = starpu_task_list_pop_back(&sched_ctx->waiting_tasks);
  872. int ret = _starpu_push_task_to_workers(old_task);
  873. }
  874. return;
  875. }
  876. void _starpu_push_task_to_waiting_list(struct _starpu_sched_ctx *sched_ctx, struct starpu_task *task)
  877. {
  878. starpu_task_list_push_front(&sched_ctx->waiting_tasks, task);
  879. return;
  880. }
  881. void starpu_sched_ctx_set_priority_on_level(int* workers_to_add, unsigned nworkers_to_add, unsigned sched_ctx, unsigned priority)
  882. {
  883. /* int w; */
  884. /* struct _starpu_worker *worker = NULL; */
  885. /* for(w = 0; w < nworkers_to_add; w++) */
  886. /* { */
  887. /* worker = _starpu_get_worker_struct(workers_to_add[w]); */
  888. /* STARPU_PTHREAD_MUTEX_LOCK(&worker->sched_mutex); */
  889. /* struct _starpu_sched_ctx_list *l = NULL; */
  890. /* for (l = worker->sched_ctx_list; l; l = l->next) */
  891. /* { */
  892. /* if(l->sched_ctx != STARPU_NMAX_SCHED_CTXS && l->sched_ctx != sched_ctx && */
  893. /* starpu_sched_ctx_get_hierarchy_level(l->sched_ctx) == starpu_sched_ctx_get_hierarchy_level(sched_ctx)) */
  894. /* { */
  895. /* /\* the lock is taken inside the func *\/ */
  896. /* STARPU_PTHREAD_MUTEX_UNLOCK(&worker->sched_mutex); */
  897. /* starpu_sched_ctx_set_priority(&workers_to_add[w], 1, l->sched_ctx, priority); */
  898. /* STARPU_PTHREAD_MUTEX_LOCK(&worker->sched_mutex); */
  899. /* } */
  900. /* } */
  901. /* STARPU_PTHREAD_MUTEX_UNLOCK(&worker->sched_mutex); */
  902. /* } */
  903. /* return; */
  904. }
  905. static void _set_priority_hierarchically(int* workers_to_add, unsigned nworkers_to_add, unsigned sched_ctx, unsigned priority)
  906. {
  907. if(starpu_sched_ctx_get_hierarchy_level(sched_ctx) > 0)
  908. {
  909. unsigned father = starpu_sched_ctx_get_inheritor(sched_ctx);
  910. starpu_sched_ctx_set_priority(workers_to_add, nworkers_to_add, father, priority);
  911. starpu_sched_ctx_set_priority_on_level(workers_to_add, nworkers_to_add, father, priority);
  912. _set_priority_hierarchically(workers_to_add, nworkers_to_add, father, priority);
  913. }
  914. return;
  915. }
  916. void starpu_sched_ctx_add_workers(int *workers_to_add, int nworkers_to_add, unsigned sched_ctx_id)
  917. {
  918. struct _starpu_sched_ctx *sched_ctx = _starpu_get_sched_ctx_struct(sched_ctx_id);
  919. int added_workers[nworkers_to_add];
  920. int n_added_workers = 0;
  921. _starpu_unlock_mutex_if_prev_locked();
  922. STARPU_PTHREAD_RWLOCK_WRLOCK(&changing_ctx_mutex[sched_ctx_id]);
  923. STARPU_ASSERT(workers_to_add != NULL && nworkers_to_add > 0);
  924. _starpu_check_workers(workers_to_add, nworkers_to_add);
  925. /* if the context has not already been deleted */
  926. if(sched_ctx->id != STARPU_NMAX_SCHED_CTXS)
  927. {
  928. _starpu_add_workers_to_sched_ctx(sched_ctx, workers_to_add, nworkers_to_add, added_workers, &n_added_workers);
  929. if(n_added_workers > 0)
  930. {
  931. _starpu_update_workers_with_ctx(added_workers, n_added_workers, sched_ctx->id);
  932. }
  933. starpu_sched_ctx_set_priority(workers_to_add, nworkers_to_add, sched_ctx_id, 1);
  934. _set_priority_hierarchically(workers_to_add, nworkers_to_add, sched_ctx_id, 0);
  935. }
  936. STARPU_PTHREAD_RWLOCK_UNLOCK(&changing_ctx_mutex[sched_ctx_id]);
  937. _starpu_relock_mutex_if_prev_locked();
  938. if(sched_ctx->id != STARPU_NMAX_SCHED_CTXS)
  939. {
  940. STARPU_PTHREAD_RWLOCK_RDLOCK(&changing_ctx_mutex[sched_ctx_id]);
  941. _starpu_fetch_tasks_from_empty_ctx_list(sched_ctx);
  942. STARPU_PTHREAD_RWLOCK_UNLOCK(&changing_ctx_mutex[sched_ctx_id]);
  943. }
  944. return;
  945. }
  946. void starpu_sched_ctx_remove_workers(int *workers_to_remove, int nworkers_to_remove, unsigned sched_ctx_id)
  947. {
  948. struct _starpu_sched_ctx *sched_ctx = _starpu_get_sched_ctx_struct(sched_ctx_id);
  949. int removed_workers[sched_ctx->workers->nworkers];
  950. int n_removed_workers = 0;
  951. _starpu_check_workers(workers_to_remove, nworkers_to_remove);
  952. _starpu_unlock_mutex_if_prev_locked();
  953. STARPU_PTHREAD_RWLOCK_WRLOCK(&changing_ctx_mutex[sched_ctx_id]);
  954. /* if the context has not already been deleted */
  955. if(sched_ctx->id != STARPU_NMAX_SCHED_CTXS)
  956. {
  957. _starpu_remove_workers_from_sched_ctx(sched_ctx, workers_to_remove, nworkers_to_remove, removed_workers, &n_removed_workers);
  958. if(n_removed_workers > 0)
  959. {
  960. _starpu_update_workers_without_ctx(removed_workers, n_removed_workers, sched_ctx_id, 0);
  961. starpu_sched_ctx_set_priority(removed_workers, n_removed_workers, sched_ctx_id, 1);
  962. }
  963. }
  964. STARPU_PTHREAD_RWLOCK_UNLOCK(&changing_ctx_mutex[sched_ctx_id]);
  965. _starpu_relock_mutex_if_prev_locked();
  966. return;
  967. }
  968. int _starpu_nworkers_able_to_execute_task(struct starpu_task *task, struct _starpu_sched_ctx *sched_ctx)
  969. {
  970. unsigned worker = 0, nworkers = 0;
  971. STARPU_PTHREAD_RWLOCK_WRLOCK(&changing_ctx_mutex[sched_ctx->id]);
  972. struct starpu_worker_collection *workers = sched_ctx->workers;
  973. struct starpu_sched_ctx_iterator it;
  974. workers->init_iterator(workers, &it);
  975. while(workers->has_next_master(workers, &it))
  976. {
  977. worker = workers->get_next_master(workers, &it);
  978. STARPU_ASSERT_MSG(worker < STARPU_NMAXWORKERS, "worker id %d", worker);
  979. if (starpu_worker_can_execute_task_first_impl(worker, task, NULL))
  980. nworkers++;
  981. }
  982. STARPU_PTHREAD_RWLOCK_UNLOCK(&changing_ctx_mutex[sched_ctx->id]);
  983. return nworkers;
  984. }
  985. /* unused sched_ctx have the id STARPU_NMAX_SCHED_CTXS */
  986. void _starpu_init_all_sched_ctxs(struct _starpu_machine_config *config)
  987. {
  988. starpu_pthread_key_create(&sched_ctx_key, NULL);
  989. unsigned i;
  990. for(i = 0; i < STARPU_NMAX_SCHED_CTXS; i++)
  991. config->sched_ctxs[i].id = STARPU_NMAX_SCHED_CTXS;
  992. return;
  993. }
  994. /* sched_ctx aren't necessarly one next to another */
  995. /* for eg when we remove one its place is free */
  996. /* when we add new one we reuse its place */
  997. static unsigned _starpu_get_first_free_sched_ctx(struct _starpu_machine_config *config)
  998. {
  999. unsigned i;
  1000. for(i = 0; i < STARPU_NMAX_SCHED_CTXS; i++)
  1001. if(config->sched_ctxs[i].id == STARPU_NMAX_SCHED_CTXS)
  1002. return i;
  1003. STARPU_ASSERT(0);
  1004. return STARPU_NMAX_SCHED_CTXS;
  1005. }
  1006. int _starpu_wait_for_all_tasks_of_sched_ctx(unsigned sched_ctx_id)
  1007. {
  1008. struct _starpu_sched_ctx *sched_ctx = _starpu_get_sched_ctx_struct(sched_ctx_id);
  1009. STARPU_ASSERT_MSG(_starpu_worker_may_perform_blocking_calls(), "starpu_task_wait_for_all must not be called from a task or callback");
  1010. return _starpu_barrier_counter_wait_for_empty_counter(&sched_ctx->tasks_barrier);
  1011. }
  1012. void _starpu_decrement_nsubmitted_tasks_of_sched_ctx(unsigned sched_ctx_id)
  1013. {
  1014. struct _starpu_machine_config *config = (struct _starpu_machine_config *)_starpu_get_machine_config();
  1015. if (!config->watchdog_ok)
  1016. config->watchdog_ok = 1;
  1017. struct _starpu_sched_ctx *sched_ctx = _starpu_get_sched_ctx_struct(sched_ctx_id);
  1018. int reached = _starpu_barrier_counter_get_reached_start(&sched_ctx->tasks_barrier);
  1019. int finished = reached == 1;
  1020. /* when finished decrementing the tasks if the user signaled he will not submit tasks anymore
  1021. we can move all its workers to the inheritor context */
  1022. if(finished && sched_ctx->inheritor != STARPU_NMAX_SCHED_CTXS)
  1023. {
  1024. STARPU_PTHREAD_MUTEX_LOCK(&finished_submit_mutex);
  1025. if(sched_ctx->finished_submit)
  1026. {
  1027. STARPU_PTHREAD_MUTEX_UNLOCK(&finished_submit_mutex);
  1028. if(sched_ctx->id != STARPU_NMAX_SCHED_CTXS)
  1029. {
  1030. if(sched_ctx->close_callback)
  1031. sched_ctx->close_callback(sched_ctx->id, sched_ctx->close_args);
  1032. int *workerids = NULL;
  1033. unsigned nworkers = starpu_sched_ctx_get_workers_list(sched_ctx->id, &workerids);
  1034. if(nworkers > 0)
  1035. {
  1036. starpu_sched_ctx_add_workers(workerids, nworkers, sched_ctx->inheritor);
  1037. free(workerids);
  1038. }
  1039. }
  1040. _starpu_barrier_counter_decrement_until_empty_counter(&sched_ctx->tasks_barrier, 0.0);
  1041. return;
  1042. }
  1043. STARPU_PTHREAD_MUTEX_UNLOCK(&finished_submit_mutex);
  1044. }
  1045. /* We also need to check for config->submitting = 0 (i.e. the
  1046. * user calle starpu_drivers_request_termination()), in which
  1047. * case we need to set config->running to 0 and wake workers,
  1048. * so they can terminate, just like
  1049. * starpu_drivers_request_termination() does.
  1050. */
  1051. STARPU_PTHREAD_MUTEX_LOCK(&config->submitted_mutex);
  1052. if(config->submitting == 0)
  1053. {
  1054. if(sched_ctx->id != STARPU_NMAX_SCHED_CTXS)
  1055. {
  1056. if(sched_ctx->close_callback)
  1057. sched_ctx->close_callback(sched_ctx->id, sched_ctx->close_args);
  1058. }
  1059. ANNOTATE_HAPPENS_AFTER(&config->running);
  1060. config->running = 0;
  1061. ANNOTATE_HAPPENS_BEFORE(&config->running);
  1062. int s;
  1063. for(s = 0; s < STARPU_NMAX_SCHED_CTXS; s++)
  1064. {
  1065. if(config->sched_ctxs[s].id != STARPU_NMAX_SCHED_CTXS)
  1066. {
  1067. _starpu_check_nsubmitted_tasks_of_sched_ctx(config->sched_ctxs[s].id);
  1068. }
  1069. }
  1070. }
  1071. STARPU_PTHREAD_MUTEX_UNLOCK(&config->submitted_mutex);
  1072. _starpu_barrier_counter_decrement_until_empty_counter(&sched_ctx->tasks_barrier, 0.0);
  1073. return;
  1074. }
  1075. void _starpu_increment_nsubmitted_tasks_of_sched_ctx(unsigned sched_ctx_id)
  1076. {
  1077. struct _starpu_sched_ctx *sched_ctx = _starpu_get_sched_ctx_struct(sched_ctx_id);
  1078. _starpu_barrier_counter_increment(&sched_ctx->tasks_barrier, 0.0);
  1079. }
  1080. int _starpu_get_nsubmitted_tasks_of_sched_ctx(unsigned sched_ctx_id)
  1081. {
  1082. struct _starpu_sched_ctx *sched_ctx = _starpu_get_sched_ctx_struct(sched_ctx_id);
  1083. return _starpu_barrier_counter_get_reached_start(&sched_ctx->tasks_barrier);
  1084. }
  1085. int _starpu_check_nsubmitted_tasks_of_sched_ctx(unsigned sched_ctx_id)
  1086. {
  1087. struct _starpu_sched_ctx *sched_ctx = _starpu_get_sched_ctx_struct(sched_ctx_id);
  1088. return _starpu_barrier_counter_check(&sched_ctx->tasks_barrier);
  1089. }
  1090. unsigned _starpu_increment_nready_tasks_of_sched_ctx(unsigned sched_ctx_id, double ready_flops, struct starpu_task *task)
  1091. {
  1092. unsigned ret = 1;
  1093. struct _starpu_sched_ctx *sched_ctx = _starpu_get_sched_ctx_struct(sched_ctx_id);
  1094. if(!sched_ctx->is_initial_sched)
  1095. STARPU_PTHREAD_MUTEX_LOCK(&sched_ctx->waiting_tasks_mutex);
  1096. _starpu_barrier_counter_increment(&sched_ctx->ready_tasks_barrier, ready_flops);
  1097. if(!sched_ctx->is_initial_sched)
  1098. {
  1099. if(!_starpu_can_push_task(sched_ctx, task))
  1100. {
  1101. _starpu_push_task_to_waiting_list(sched_ctx, task);
  1102. ret = 0;
  1103. }
  1104. STARPU_PTHREAD_MUTEX_UNLOCK(&sched_ctx->waiting_tasks_mutex);
  1105. }
  1106. return ret;
  1107. }
  1108. void _starpu_decrement_nready_tasks_of_sched_ctx(unsigned sched_ctx_id, double ready_flops)
  1109. {
  1110. struct _starpu_sched_ctx *sched_ctx = _starpu_get_sched_ctx_struct(sched_ctx_id);
  1111. if(!sched_ctx->is_initial_sched)
  1112. STARPU_PTHREAD_MUTEX_LOCK(&sched_ctx->waiting_tasks_mutex);
  1113. _starpu_barrier_counter_decrement_until_empty_counter(&sched_ctx->ready_tasks_barrier, ready_flops);
  1114. if(!sched_ctx->is_initial_sched)
  1115. {
  1116. _starpu_fetch_task_from_waiting_list(sched_ctx);
  1117. STARPU_PTHREAD_MUTEX_UNLOCK(&sched_ctx->waiting_tasks_mutex);
  1118. }
  1119. }
  1120. int starpu_sched_ctx_get_nready_tasks(unsigned sched_ctx_id)
  1121. {
  1122. struct _starpu_sched_ctx *sched_ctx = _starpu_get_sched_ctx_struct(sched_ctx_id);
  1123. return _starpu_barrier_counter_get_reached_start(&sched_ctx->ready_tasks_barrier);
  1124. }
  1125. double starpu_sched_ctx_get_nready_flops(unsigned sched_ctx_id)
  1126. {
  1127. struct _starpu_sched_ctx *sched_ctx = _starpu_get_sched_ctx_struct(sched_ctx_id);
  1128. return _starpu_barrier_counter_get_reached_flops(&sched_ctx->ready_tasks_barrier);
  1129. }
  1130. int _starpu_wait_for_no_ready_of_sched_ctx(unsigned sched_ctx_id)
  1131. {
  1132. struct _starpu_sched_ctx *sched_ctx = _starpu_get_sched_ctx_struct(sched_ctx_id);
  1133. return _starpu_barrier_counter_wait_for_empty_counter(&sched_ctx->ready_tasks_barrier);
  1134. }
  1135. void starpu_sched_ctx_set_context(unsigned *sched_ctx)
  1136. {
  1137. starpu_pthread_setspecific(sched_ctx_key, (void*)sched_ctx);
  1138. }
  1139. unsigned starpu_sched_ctx_get_context()
  1140. {
  1141. unsigned *sched_ctx = (unsigned*)starpu_pthread_getspecific(sched_ctx_key);
  1142. if(sched_ctx == NULL)
  1143. return STARPU_NMAX_SCHED_CTXS;
  1144. STARPU_ASSERT(*sched_ctx < STARPU_NMAX_SCHED_CTXS);
  1145. return *sched_ctx;
  1146. }
  1147. unsigned _starpu_sched_ctx_get_current_context()
  1148. {
  1149. unsigned sched_ctx = starpu_sched_ctx_get_context();
  1150. if (sched_ctx == STARPU_NMAX_SCHED_CTXS)
  1151. return _starpu_get_initial_sched_ctx()->id;
  1152. else
  1153. return sched_ctx;
  1154. }
  1155. void starpu_sched_ctx_notify_hypervisor_exists()
  1156. {
  1157. with_hypervisor = 1;
  1158. int i, j;
  1159. for(i = 0; i < STARPU_NMAX_SCHED_CTXS; i++)
  1160. {
  1161. hyp_start_sample[i] = starpu_timing_now();
  1162. hyp_start_allow_sample[i] = 0.0;
  1163. for(j = 0; j < STARPU_NMAXWORKERS; j++)
  1164. {
  1165. flops[i][j] = 0.0;
  1166. data_size[i][j] = 0;
  1167. }
  1168. hyp_actual_start_sample[i] = 0.0;
  1169. }
  1170. }
  1171. unsigned starpu_sched_ctx_check_if_hypervisor_exists()
  1172. {
  1173. return with_hypervisor;
  1174. }
  1175. void starpu_sched_ctx_update_start_resizing_sample(unsigned sched_ctx_id, double start_sample)
  1176. {
  1177. hyp_actual_start_sample[sched_ctx_id] = start_sample;
  1178. }
  1179. unsigned _starpu_sched_ctx_allow_hypervisor(unsigned sched_ctx_id)
  1180. {
  1181. return 1;
  1182. double now = starpu_timing_now();
  1183. if(hyp_start_allow_sample[sched_ctx_id] > 0.0)
  1184. {
  1185. double allow_sample = (now - hyp_start_allow_sample[sched_ctx_id]) / 1000000.0;
  1186. if(allow_sample < 0.001)
  1187. return 1;
  1188. else
  1189. {
  1190. hyp_start_allow_sample[sched_ctx_id] = 0.0;
  1191. hyp_start_sample[sched_ctx_id] = starpu_timing_now();
  1192. return 0;
  1193. }
  1194. }
  1195. double forbid_sample = (now - hyp_start_sample[sched_ctx_id]) / 1000000.0;
  1196. if(forbid_sample > 0.01)
  1197. {
  1198. // hyp_start_sample[sched_ctx_id] = starpu_timing_now();
  1199. hyp_start_allow_sample[sched_ctx_id] = starpu_timing_now();
  1200. return 1;
  1201. }
  1202. return 0;
  1203. }
  1204. unsigned _starpu_get_nsched_ctxs()
  1205. {
  1206. struct _starpu_machine_config *config = (struct _starpu_machine_config *)_starpu_get_machine_config();
  1207. return config->topology.nsched_ctxs;
  1208. }
  1209. void starpu_sched_ctx_set_policy_data(unsigned sched_ctx_id, void* policy_data)
  1210. {
  1211. struct _starpu_sched_ctx *sched_ctx = _starpu_get_sched_ctx_struct(sched_ctx_id);
  1212. sched_ctx->policy_data = policy_data;
  1213. }
  1214. void* starpu_sched_ctx_get_policy_data(unsigned sched_ctx_id)
  1215. {
  1216. struct _starpu_sched_ctx *sched_ctx = _starpu_get_sched_ctx_struct(sched_ctx_id);
  1217. return sched_ctx->policy_data;
  1218. }
  1219. struct starpu_worker_collection* starpu_sched_ctx_create_worker_collection(unsigned sched_ctx_id, enum starpu_worker_collection_type worker_collection_type)
  1220. {
  1221. struct _starpu_sched_ctx *sched_ctx = _starpu_get_sched_ctx_struct(sched_ctx_id);
  1222. sched_ctx->workers = (struct starpu_worker_collection*)malloc(sizeof(struct starpu_worker_collection));
  1223. switch(worker_collection_type)
  1224. {
  1225. #ifdef STARPU_HAVE_HWLOC
  1226. case STARPU_WORKER_TREE:
  1227. sched_ctx->workers->has_next = worker_tree.has_next;
  1228. sched_ctx->workers->get_next = worker_tree.get_next;
  1229. sched_ctx->workers->has_next_master = worker_tree.has_next_master;
  1230. sched_ctx->workers->get_next_master = worker_tree.get_next_master;
  1231. sched_ctx->workers->add = worker_tree.add;
  1232. sched_ctx->workers->remove = worker_tree.remove;
  1233. sched_ctx->workers->init = worker_tree.init;
  1234. sched_ctx->workers->deinit = worker_tree.deinit;
  1235. sched_ctx->workers->init_iterator = worker_tree.init_iterator;
  1236. sched_ctx->workers->type = STARPU_WORKER_LIST;
  1237. break;
  1238. #endif
  1239. // case STARPU_WORKER_LIST:
  1240. default:
  1241. sched_ctx->workers->has_next = worker_list.has_next;
  1242. sched_ctx->workers->get_next = worker_list.get_next;
  1243. sched_ctx->workers->has_next_master = worker_list.has_next_master;
  1244. sched_ctx->workers->get_next_master = worker_list.get_next_master;
  1245. sched_ctx->workers->add = worker_list.add;
  1246. sched_ctx->workers->remove = worker_list.remove;
  1247. sched_ctx->workers->init = worker_list.init;
  1248. sched_ctx->workers->deinit = worker_list.deinit;
  1249. sched_ctx->workers->init_iterator = worker_list.init_iterator;
  1250. sched_ctx->workers->type = STARPU_WORKER_LIST;
  1251. break;
  1252. }
  1253. /* construct the collection of workers(list/tree/etc.) */
  1254. sched_ctx->workers->init(sched_ctx->workers);
  1255. return sched_ctx->workers;
  1256. }
  1257. void starpu_sched_ctx_display_workers(unsigned sched_ctx_id, FILE *f)
  1258. {
  1259. int *workerids = NULL;
  1260. unsigned nworkers;
  1261. unsigned i;
  1262. nworkers = starpu_sched_ctx_get_workers_list(sched_ctx_id, &workerids);
  1263. fprintf(f, "[sched_ctx %d]: %d worker%s\n", sched_ctx_id, nworkers, nworkers>1?"s":"");
  1264. for (i = 0; i < nworkers; i++)
  1265. {
  1266. char name[256];
  1267. starpu_worker_get_name(workerids[i], name, 256);
  1268. fprintf(f, "\t\t%s\n", name);
  1269. }
  1270. free(workerids);
  1271. }
  1272. unsigned starpu_sched_ctx_get_workers_list(unsigned sched_ctx_id, int **workerids)
  1273. {
  1274. struct _starpu_sched_ctx *sched_ctx = _starpu_get_sched_ctx_struct(sched_ctx_id);
  1275. struct starpu_worker_collection *workers = sched_ctx->workers;
  1276. if(!workers) return 0;
  1277. *workerids = (int*)malloc(workers->nworkers*sizeof(int));
  1278. int worker;
  1279. unsigned nworkers = 0;
  1280. struct starpu_sched_ctx_iterator it;
  1281. workers->init_iterator(workers, &it);
  1282. while(workers->has_next(workers, &it))
  1283. {
  1284. worker = workers->get_next(workers, &it);
  1285. (*workerids)[nworkers++] = worker;
  1286. }
  1287. return nworkers;
  1288. }
  1289. void starpu_sched_ctx_delete_worker_collection(unsigned sched_ctx_id)
  1290. {
  1291. struct _starpu_sched_ctx *sched_ctx = _starpu_get_sched_ctx_struct(sched_ctx_id);
  1292. sched_ctx->workers->deinit(sched_ctx->workers);
  1293. free(sched_ctx->workers);
  1294. sched_ctx->workers = NULL;
  1295. }
  1296. struct starpu_worker_collection* starpu_sched_ctx_get_worker_collection(unsigned sched_ctx_id)
  1297. {
  1298. struct _starpu_sched_ctx *sched_ctx = _starpu_get_sched_ctx_struct(sched_ctx_id);
  1299. return sched_ctx->workers;
  1300. }
  1301. int _starpu_get_workers_of_sched_ctx(unsigned sched_ctx_id, int *pus, enum starpu_worker_archtype arch)
  1302. {
  1303. struct _starpu_sched_ctx *sched_ctx = _starpu_get_sched_ctx_struct(sched_ctx_id);
  1304. struct starpu_worker_collection *workers = sched_ctx->workers;
  1305. int worker;
  1306. int npus = 0;
  1307. struct starpu_sched_ctx_iterator it;
  1308. workers->init_iterator(workers, &it);
  1309. while(workers->has_next(workers, &it))
  1310. {
  1311. worker = workers->get_next(workers, &it);
  1312. enum starpu_worker_archtype curr_arch = starpu_worker_get_type(worker);
  1313. if(curr_arch == arch || arch == STARPU_ANY_WORKER)
  1314. pus[npus++] = worker;
  1315. }
  1316. return npus;
  1317. }
  1318. starpu_pthread_rwlock_t* _starpu_sched_ctx_get_changing_ctx_mutex(unsigned sched_ctx_id)
  1319. {
  1320. return &changing_ctx_mutex[sched_ctx_id];
  1321. }
  1322. unsigned starpu_sched_ctx_get_nworkers(unsigned sched_ctx_id)
  1323. {
  1324. struct _starpu_sched_ctx *sched_ctx = _starpu_get_sched_ctx_struct(sched_ctx_id);
  1325. if(sched_ctx != NULL)
  1326. return sched_ctx->workers->nworkers;
  1327. else
  1328. return 0;
  1329. }
  1330. unsigned starpu_sched_ctx_get_nshared_workers(unsigned sched_ctx_id, unsigned sched_ctx_id2)
  1331. {
  1332. struct _starpu_sched_ctx *sched_ctx = _starpu_get_sched_ctx_struct(sched_ctx_id);
  1333. struct _starpu_sched_ctx *sched_ctx2 = _starpu_get_sched_ctx_struct(sched_ctx_id2);
  1334. struct starpu_worker_collection *workers = sched_ctx->workers;
  1335. struct starpu_worker_collection *workers2 = sched_ctx2->workers;
  1336. int worker, worker2;
  1337. int shared_workers = 0;
  1338. struct starpu_sched_ctx_iterator it1, it2;
  1339. workers->init_iterator(workers, &it1);
  1340. workers2->init_iterator(workers2, &it2);
  1341. while(workers->has_next(workers, &it1))
  1342. {
  1343. worker = workers->get_next(workers, &it1);
  1344. while(workers2->has_next(workers2, &it2))
  1345. {
  1346. worker2 = workers2->get_next(workers2, &it2);
  1347. if(worker == worker2)
  1348. shared_workers++;
  1349. }
  1350. }
  1351. return shared_workers;
  1352. }
  1353. unsigned starpu_sched_ctx_contains_worker(int workerid, unsigned sched_ctx_id)
  1354. {
  1355. struct _starpu_sched_ctx *sched_ctx = _starpu_get_sched_ctx_struct(sched_ctx_id);
  1356. struct starpu_worker_collection *workers = sched_ctx->workers;
  1357. if(workers)
  1358. {
  1359. int worker;
  1360. struct starpu_sched_ctx_iterator it;
  1361. workers->init_iterator(workers, &it);
  1362. while(workers->has_next(workers, &it))
  1363. {
  1364. worker = workers->get_next(workers, &it);
  1365. if(worker == workerid)
  1366. return 1;
  1367. }
  1368. }
  1369. return 0;
  1370. }
  1371. unsigned starpu_sched_ctx_contains_type_of_worker(enum starpu_worker_archtype arch, unsigned sched_ctx_id)
  1372. {
  1373. struct starpu_worker_collection *workers = starpu_sched_ctx_get_worker_collection(sched_ctx_id);
  1374. int worker;
  1375. struct starpu_sched_ctx_iterator it;
  1376. workers->init_iterator(workers, &it);
  1377. while(workers->has_next(workers, &it))
  1378. {
  1379. worker = workers->get_next(workers, &it);
  1380. enum starpu_worker_archtype curr_arch = starpu_worker_get_type(worker);
  1381. if(curr_arch == arch)
  1382. return 1;
  1383. }
  1384. return 0;
  1385. }
  1386. unsigned _starpu_worker_belongs_to_a_sched_ctx(int workerid, unsigned sched_ctx_id)
  1387. {
  1388. struct _starpu_machine_config *config = (struct _starpu_machine_config *)_starpu_get_machine_config();
  1389. int i;
  1390. struct _starpu_sched_ctx *sched_ctx = NULL;
  1391. for(i = 0; i < STARPU_NMAX_SCHED_CTXS; i++)
  1392. {
  1393. sched_ctx = &config->sched_ctxs[i];
  1394. if(sched_ctx && sched_ctx->id != STARPU_NMAX_SCHED_CTXS && sched_ctx->id != sched_ctx_id)
  1395. if(starpu_sched_ctx_contains_worker(workerid, sched_ctx->id))
  1396. return 1;
  1397. }
  1398. return 0;
  1399. }
  1400. unsigned starpu_sched_ctx_worker_get_id(unsigned sched_ctx_id)
  1401. {
  1402. int workerid = starpu_worker_get_id();
  1403. if(workerid != -1)
  1404. if(starpu_sched_ctx_contains_worker(workerid, sched_ctx_id))
  1405. return workerid;
  1406. return -1;
  1407. }
  1408. unsigned starpu_sched_ctx_overlapping_ctxs_on_worker(int workerid)
  1409. {
  1410. struct _starpu_worker *worker = _starpu_get_worker_struct(workerid);
  1411. return worker->nsched_ctxs > 1;
  1412. }
  1413. void starpu_sched_ctx_set_inheritor(unsigned sched_ctx_id, unsigned inheritor)
  1414. {
  1415. STARPU_ASSERT(sched_ctx_id < STARPU_NMAX_SCHED_CTXS);
  1416. STARPU_ASSERT(inheritor < STARPU_NMAX_SCHED_CTXS);
  1417. struct _starpu_sched_ctx *sched_ctx = _starpu_get_sched_ctx_struct(sched_ctx_id);
  1418. sched_ctx->inheritor = inheritor;
  1419. return;
  1420. }
  1421. unsigned starpu_sched_ctx_get_inheritor(unsigned sched_ctx_id)
  1422. {
  1423. STARPU_ASSERT(sched_ctx_id < STARPU_NMAX_SCHED_CTXS);
  1424. struct _starpu_sched_ctx *sched_ctx = _starpu_get_sched_ctx_struct(sched_ctx_id);
  1425. return sched_ctx->inheritor;
  1426. }
  1427. unsigned starpu_sched_ctx_get_hierarchy_level(unsigned sched_ctx_id)
  1428. {
  1429. STARPU_ASSERT(sched_ctx_id < STARPU_NMAX_SCHED_CTXS);
  1430. struct _starpu_sched_ctx *sched_ctx = _starpu_get_sched_ctx_struct(sched_ctx_id);
  1431. return sched_ctx->hierarchy_level;
  1432. }
  1433. void starpu_sched_ctx_finished_submit(unsigned sched_ctx_id)
  1434. {
  1435. struct _starpu_sched_ctx *sched_ctx = _starpu_get_sched_ctx_struct(sched_ctx_id);
  1436. STARPU_PTHREAD_MUTEX_LOCK(&finished_submit_mutex);
  1437. sched_ctx->finished_submit = 1;
  1438. STARPU_PTHREAD_MUTEX_UNLOCK(&finished_submit_mutex);
  1439. return;
  1440. }
  1441. #ifdef STARPU_USE_SC_HYPERVISOR
  1442. void _starpu_sched_ctx_post_exec_task_cb(int workerid, struct starpu_task *task, size_t data_size2, uint32_t footprint)
  1443. {
  1444. struct _starpu_sched_ctx *sched_ctx = _starpu_get_sched_ctx_struct(task->sched_ctx);
  1445. if(sched_ctx != NULL && task->sched_ctx != _starpu_get_initial_sched_ctx()->id &&
  1446. task->sched_ctx != STARPU_NMAX_SCHED_CTXS && sched_ctx->perf_counters != NULL)
  1447. {
  1448. flops[task->sched_ctx][workerid] += task->flops;
  1449. data_size[task->sched_ctx][workerid] += data_size2;
  1450. if(_starpu_sched_ctx_allow_hypervisor(sched_ctx->id) || task->hypervisor_tag > 0)
  1451. {
  1452. _STARPU_TRACE_HYPERVISOR_BEGIN();
  1453. sched_ctx->perf_counters->notify_post_exec_task(task, data_size[task->sched_ctx][workerid], footprint,
  1454. task->hypervisor_tag, flops[task->sched_ctx][workerid]);
  1455. _STARPU_TRACE_HYPERVISOR_END();
  1456. flops[task->sched_ctx][workerid] = 0.0;
  1457. data_size[task->sched_ctx][workerid] = 0;
  1458. }
  1459. }
  1460. }
  1461. void starpu_sched_ctx_call_pushed_task_cb(int workerid, unsigned sched_ctx_id)
  1462. {
  1463. struct _starpu_sched_ctx *sched_ctx = _starpu_get_sched_ctx_struct(sched_ctx_id);
  1464. if(sched_ctx != NULL && sched_ctx_id != _starpu_get_initial_sched_ctx()->id && sched_ctx_id != STARPU_NMAX_SCHED_CTXS
  1465. && sched_ctx->perf_counters != NULL && _starpu_sched_ctx_allow_hypervisor(sched_ctx_id))
  1466. {
  1467. _STARPU_TRACE_HYPERVISOR_BEGIN();
  1468. sched_ctx->perf_counters->notify_pushed_task(sched_ctx_id, workerid);
  1469. _STARPU_TRACE_HYPERVISOR_END();
  1470. }
  1471. }
  1472. #endif //STARPU_USE_SC_HYPERVISOR
  1473. int starpu_sched_get_min_priority(void)
  1474. {
  1475. return starpu_sched_ctx_get_min_priority(_starpu_sched_ctx_get_current_context());
  1476. }
  1477. int starpu_sched_get_max_priority(void)
  1478. {
  1479. return starpu_sched_ctx_get_max_priority(_starpu_sched_ctx_get_current_context());
  1480. }
  1481. int starpu_sched_set_min_priority(int min_prio)
  1482. {
  1483. return starpu_sched_ctx_set_min_priority(_starpu_sched_ctx_get_current_context(), min_prio);
  1484. }
  1485. int starpu_sched_set_max_priority(int max_prio)
  1486. {
  1487. return starpu_sched_ctx_set_max_priority(_starpu_sched_ctx_get_current_context(), max_prio);
  1488. }
  1489. int starpu_sched_ctx_get_min_priority(unsigned sched_ctx_id)
  1490. {
  1491. struct _starpu_sched_ctx *sched_ctx = _starpu_get_sched_ctx_struct(sched_ctx_id);
  1492. return sched_ctx->min_priority;
  1493. }
  1494. int starpu_sched_ctx_get_max_priority(unsigned sched_ctx_id)
  1495. {
  1496. struct _starpu_sched_ctx *sched_ctx = _starpu_get_sched_ctx_struct(sched_ctx_id);
  1497. return sched_ctx->max_priority;
  1498. }
  1499. int starpu_sched_ctx_set_min_priority(unsigned sched_ctx_id, int min_prio)
  1500. {
  1501. struct _starpu_sched_ctx *sched_ctx = _starpu_get_sched_ctx_struct(sched_ctx_id);
  1502. sched_ctx->min_priority = min_prio;
  1503. return 0;
  1504. }
  1505. int starpu_sched_ctx_set_max_priority(unsigned sched_ctx_id, int max_prio)
  1506. {
  1507. struct _starpu_sched_ctx *sched_ctx = _starpu_get_sched_ctx_struct(sched_ctx_id);
  1508. sched_ctx->max_priority = max_prio;
  1509. return 0;
  1510. }
  1511. int starpu_sched_ctx_min_priority_is_set(unsigned sched_ctx_id)
  1512. {
  1513. struct _starpu_sched_ctx *sched_ctx = _starpu_get_sched_ctx_struct(sched_ctx_id);
  1514. return sched_ctx->min_priority_is_set;
  1515. }
  1516. int starpu_sched_ctx_max_priority_is_set(unsigned sched_ctx_id)
  1517. {
  1518. struct _starpu_sched_ctx *sched_ctx = _starpu_get_sched_ctx_struct(sched_ctx_id);
  1519. return sched_ctx->max_priority_is_set;
  1520. }
  1521. void starpu_sched_ctx_set_priority(int *workers, int nworkers, unsigned sched_ctx_id, unsigned priority)
  1522. {
  1523. if(nworkers != -1)
  1524. {
  1525. int w;
  1526. struct _starpu_worker *worker = NULL;
  1527. for(w = 0; w < nworkers; w++)
  1528. {
  1529. worker = _starpu_get_worker_struct(workers[w]);
  1530. STARPU_PTHREAD_MUTEX_LOCK(&worker->sched_mutex);
  1531. struct _starpu_sched_ctx_list *l = NULL;
  1532. for (l = worker->sched_ctx_list; l; l = l->next)
  1533. {
  1534. if(l->sched_ctx == sched_ctx_id)
  1535. {
  1536. l->priority = priority;
  1537. break;
  1538. }
  1539. }
  1540. STARPU_PTHREAD_MUTEX_UNLOCK(&worker->sched_mutex);
  1541. }
  1542. }
  1543. return;
  1544. }
  1545. unsigned starpu_sched_ctx_get_priority(int workerid, unsigned sched_ctx_id)
  1546. {
  1547. struct _starpu_worker *worker = _starpu_get_worker_struct(workerid);
  1548. struct _starpu_sched_ctx_list *l = NULL;
  1549. for (l = worker->sched_ctx_list; l; l = l->next)
  1550. {
  1551. if(l->sched_ctx == sched_ctx_id)
  1552. {
  1553. return l->priority;
  1554. }
  1555. }
  1556. return 1;
  1557. }
  1558. unsigned _starpu_sched_ctx_last_worker_awake(struct _starpu_worker *worker)
  1559. {
  1560. struct _starpu_sched_ctx_list *l = NULL;
  1561. for (l = worker->sched_ctx_list; l; l = l->next)
  1562. {
  1563. struct _starpu_sched_ctx *sched_ctx = _starpu_get_sched_ctx_struct(l->sched_ctx);
  1564. unsigned last_worker_awake = 1;
  1565. struct starpu_worker_collection *workers = sched_ctx->workers;
  1566. struct starpu_sched_ctx_iterator it;
  1567. int workerid;
  1568. workers->init_iterator(workers, &it);
  1569. while(workers->has_next(workers, &it))
  1570. {
  1571. workerid = workers->get_next(workers, &it);
  1572. if(workerid != worker->workerid && _starpu_worker_get_status(workerid) != STATUS_SLEEPING)
  1573. {
  1574. last_worker_awake = 0;
  1575. break;
  1576. }
  1577. }
  1578. if(last_worker_awake)
  1579. return 1;
  1580. }
  1581. return 0;
  1582. }
  1583. void starpu_sched_ctx_bind_current_thread_to_cpuid(unsigned cpuid STARPU_ATTRIBUTE_UNUSED)
  1584. {
  1585. #ifdef STARPU_SIMGRID
  1586. return;
  1587. #else
  1588. struct _starpu_machine_config *config = _starpu_get_machine_config();
  1589. /* FIXME: why not factorize with _starpu_bind_thread_on_cpu? */
  1590. if (starpu_get_env_number("STARPU_WORKERS_NOBIND") > 0)
  1591. return;
  1592. #ifdef STARPU_HAVE_HWLOC
  1593. const struct hwloc_topology_support *support = hwloc_topology_get_support (config->topology.hwtopology);
  1594. if (support->cpubind->set_thisthread_cpubind)
  1595. {
  1596. hwloc_obj_t obj = hwloc_get_obj_by_depth (config->topology.hwtopology,
  1597. config->pu_depth, cpuid);
  1598. hwloc_bitmap_t set = obj->cpuset;
  1599. int ret;
  1600. hwloc_bitmap_singlify(set);
  1601. ret = hwloc_set_cpubind (config->topology.hwtopology, set,
  1602. HWLOC_CPUBIND_THREAD);
  1603. if (ret)
  1604. {
  1605. perror("hwloc_set_cpubind");
  1606. STARPU_ABORT();
  1607. }
  1608. }
  1609. #elif defined(HAVE_PTHREAD_SETAFFINITY_NP) && defined(__linux__)
  1610. int ret;
  1611. /* fix the thread on the correct cpu */
  1612. cpu_set_t aff_mask;
  1613. CPU_ZERO(&aff_mask);
  1614. CPU_SET(cpuid, &aff_mask);
  1615. starpu_pthread_t self = pthread_self();
  1616. ret = pthread_setaffinity_np(self, sizeof(aff_mask), &aff_mask);
  1617. if (ret)
  1618. {
  1619. perror("binding thread");
  1620. STARPU_ABORT();
  1621. }
  1622. #elif defined(_WIN32)
  1623. DWORD mask = 1 << cpuid;
  1624. if (!SetThreadAffinityMask(GetCurrentThread(), mask))
  1625. {
  1626. _STARPU_ERROR("SetThreadMaskAffinity(%lx) failed\n", mask);
  1627. }
  1628. #else
  1629. #warning no CPU binding support
  1630. #endif
  1631. #endif
  1632. }
  1633. unsigned starpu_sched_ctx_worker_is_master_for_child_ctx(int workerid, unsigned sched_ctx_id)
  1634. {
  1635. struct _starpu_worker *worker = _starpu_get_worker_struct(workerid);
  1636. struct _starpu_sched_ctx_list *l = NULL;
  1637. struct _starpu_sched_ctx *sched_ctx = NULL;
  1638. for (l = worker->sched_ctx_list; l; l = l->next)
  1639. {
  1640. sched_ctx = _starpu_get_sched_ctx_struct(l->sched_ctx);
  1641. if(sched_ctx-> main_master == workerid && sched_ctx->nesting_sched_ctx == sched_ctx_id)
  1642. return sched_ctx->id;
  1643. }
  1644. return STARPU_NMAX_SCHED_CTXS;
  1645. }
  1646. struct _starpu_sched_ctx *_starpu_sched_ctx_get_sched_ctx_for_worker_and_job(struct _starpu_worker *worker, struct _starpu_job *j)
  1647. {
  1648. struct _starpu_sched_ctx_list *l = NULL;
  1649. for (l = worker->sched_ctx_list; l; l = l->next)
  1650. {
  1651. struct _starpu_sched_ctx *sched_ctx = _starpu_get_sched_ctx_struct(l->sched_ctx);
  1652. if (j->task->sched_ctx == sched_ctx->id)
  1653. return sched_ctx;
  1654. }
  1655. return NULL;
  1656. }
  1657. void starpu_sched_ctx_revert_task_counters(unsigned sched_ctx_id, double ready_flops)
  1658. {
  1659. _starpu_decrement_nsubmitted_tasks_of_sched_ctx(sched_ctx_id);
  1660. _starpu_decrement_nready_tasks_of_sched_ctx(sched_ctx_id, ready_flops);
  1661. }
  1662. void starpu_sched_ctx_move_task_to_ctx(struct starpu_task *task, unsigned sched_ctx)
  1663. {
  1664. int workerid = starpu_worker_get_id();
  1665. struct _starpu_worker *worker = NULL;
  1666. if(workerid != -1)
  1667. {
  1668. worker = _starpu_get_worker_struct(workerid);
  1669. STARPU_PTHREAD_MUTEX_UNLOCK(&worker->sched_mutex);
  1670. }
  1671. task->sched_ctx = sched_ctx;
  1672. _starpu_task_submit_nodeps(task);
  1673. if(workerid != -1)
  1674. STARPU_PTHREAD_MUTEX_LOCK(&worker->sched_mutex);
  1675. }
  1676. static unsigned _worker_sleeping_in_other_ctx(unsigned sched_ctx_id, int workerid)
  1677. {
  1678. int s;
  1679. for(s = 0; s < STARPU_NMAX_SCHED_CTXS; s++)
  1680. {
  1681. struct _starpu_sched_ctx *sched_ctx = _starpu_get_sched_ctx_struct(s);
  1682. if(sched_ctx && sched_ctx->id > 0 && sched_ctx->id < STARPU_NMAX_SCHED_CTXS && sched_ctx->id != sched_ctx_id)
  1683. {
  1684. if(sched_ctx->parallel_sect[workerid])
  1685. return 1;
  1686. }
  1687. }
  1688. return 0;
  1689. }
  1690. static void _starpu_sched_ctx_get_workers_to_sleep(unsigned sched_ctx_id, int *workerids, int nworkers, int master)
  1691. {
  1692. struct _starpu_sched_ctx *sched_ctx = _starpu_get_sched_ctx_struct(sched_ctx_id);
  1693. int current_worker_id = starpu_worker_get_id();
  1694. unsigned sleeping[nworkers];
  1695. int w;
  1696. for(w = 0; w < nworkers; w++)
  1697. {
  1698. if(current_worker_id == -1 || workerids[w] != current_worker_id)
  1699. STARPU_PTHREAD_MUTEX_LOCK(&sched_ctx->parallel_sect_mutex[workerids[w]]);
  1700. sleeping[w] = _worker_sleeping_in_other_ctx(sched_ctx_id, workerids[w]);
  1701. sched_ctx->master[workerids[w]] = master;
  1702. sched_ctx->parallel_sect[workerids[w]] = 1;
  1703. if(current_worker_id == -1 || workerids[w] != current_worker_id)
  1704. STARPU_PTHREAD_MUTEX_UNLOCK(&sched_ctx->parallel_sect_mutex[workerids[w]]);
  1705. #ifndef STARPU_NON_BLOCKING_DRIVERS
  1706. starpu_wake_worker(workerids[w]);
  1707. #endif
  1708. }
  1709. int workerid;
  1710. for(w = 0; w < nworkers; w++)
  1711. {
  1712. workerid = workerids[w];
  1713. if((current_worker_id == -1 || workerid != current_worker_id) && !sleeping[w])
  1714. {
  1715. sem_wait(&sched_ctx->fall_asleep_sem[master]);
  1716. }
  1717. }
  1718. return;
  1719. }
  1720. void _starpu_sched_ctx_signal_worker_blocked(unsigned sched_ctx_id, int workerid)
  1721. {
  1722. struct _starpu_worker *worker = _starpu_get_worker_struct(workerid);
  1723. worker->slave = 1;
  1724. struct _starpu_sched_ctx *sched_ctx = _starpu_get_sched_ctx_struct(sched_ctx_id);
  1725. sched_ctx->sleeping[workerid] = 1;
  1726. int master = sched_ctx->master[workerid];
  1727. sem_post(&sched_ctx->fall_asleep_sem[master]);
  1728. return;
  1729. }
  1730. void _starpu_sched_ctx_signal_worker_woke_up(unsigned sched_ctx_id, int workerid)
  1731. {
  1732. struct _starpu_sched_ctx *sched_ctx = _starpu_get_sched_ctx_struct(sched_ctx_id);
  1733. int master = sched_ctx->master[workerid];
  1734. sem_post(&sched_ctx->wake_up_sem[master]);
  1735. sched_ctx->sleeping[workerid] = 0;
  1736. sched_ctx->master[workerid] = -1;
  1737. struct _starpu_worker *worker = _starpu_get_worker_struct(workerid);
  1738. worker->slave = 0;
  1739. return;
  1740. }
  1741. static void _starpu_sched_ctx_wake_up_workers(unsigned sched_ctx_id, int master)
  1742. {
  1743. struct _starpu_sched_ctx *sched_ctx = _starpu_get_sched_ctx_struct(sched_ctx_id);
  1744. int current_worker_id = starpu_worker_get_id();
  1745. struct starpu_worker_collection *workers = sched_ctx->workers;
  1746. struct starpu_sched_ctx_iterator it;
  1747. workers->init_iterator(workers, &it);
  1748. while(workers->has_next(workers, &it))
  1749. {
  1750. int workerid = workers->get_next(workers, &it);
  1751. int curr_master = sched_ctx->master[workerid];
  1752. if(curr_master == master && sched_ctx->parallel_sect[workerid])
  1753. {
  1754. if((current_worker_id == -1 || workerid != current_worker_id) && sched_ctx->sleeping[workerid])
  1755. {
  1756. STARPU_PTHREAD_MUTEX_LOCK(&sched_ctx->parallel_sect_mutex[workerid]);
  1757. STARPU_PTHREAD_COND_SIGNAL(&sched_ctx->parallel_sect_cond[workerid]);
  1758. STARPU_PTHREAD_MUTEX_UNLOCK(&sched_ctx->parallel_sect_mutex[workerid]);
  1759. sem_wait(&sched_ctx->wake_up_sem[master]);
  1760. }
  1761. else
  1762. sched_ctx->parallel_sect[workerid] = 0;
  1763. }
  1764. }
  1765. return;
  1766. }
  1767. void* starpu_sched_ctx_exec_parallel_code(void* (*func)(void*), void* param, unsigned sched_ctx_id)
  1768. {
  1769. int *workerids;
  1770. int nworkers = starpu_sched_ctx_get_workers_list(sched_ctx_id, &workerids);
  1771. _starpu_sched_ctx_get_workers_to_sleep(sched_ctx_id, workerids, nworkers, workerids[nworkers-1]);
  1772. /* execute parallel code */
  1773. void* ret = func(param);
  1774. /* wake up starpu workers */
  1775. _starpu_sched_ctx_wake_up_workers(sched_ctx_id, workerids[nworkers-1]);
  1776. return ret;
  1777. }
  1778. void starpu_sched_ctx_get_available_cpuids(unsigned sched_ctx_id, int **cpuids, int *ncpuids)
  1779. {
  1780. int current_worker_id = starpu_worker_get_id();
  1781. struct _starpu_sched_ctx *sched_ctx = _starpu_get_sched_ctx_struct(sched_ctx_id);
  1782. struct starpu_worker_collection *workers = sched_ctx->workers;
  1783. (*cpuids) = (int*)malloc(workers->nworkers*sizeof(int));
  1784. int w = 0;
  1785. struct starpu_sched_ctx_iterator it;
  1786. int workerid;
  1787. workers->init_iterator(workers, &it);
  1788. while(workers->has_next(workers, &it))
  1789. {
  1790. workerid = workers->get_next(workers, &it);
  1791. int master = sched_ctx->master[workerid];
  1792. if(master == current_worker_id || workerid == current_worker_id || current_worker_id == -1)
  1793. {
  1794. (*cpuids)[w++] = starpu_worker_get_bindid(workerid);
  1795. }
  1796. }
  1797. *ncpuids = w;
  1798. return;
  1799. }
  1800. static void _starpu_sched_ctx_wake_these_workers_up(unsigned sched_ctx_id, int *workerids, int nworkers)
  1801. {
  1802. struct _starpu_sched_ctx *sched_ctx = _starpu_get_sched_ctx_struct(sched_ctx_id);
  1803. int current_worker_id = starpu_worker_get_id();
  1804. int masters[nworkers];
  1805. int w;
  1806. for(w = 0; w < nworkers; w++)
  1807. {
  1808. int workerid = workerids[w];
  1809. masters[w] = sched_ctx->master[workerid];
  1810. if(current_worker_id == -1 || workerid != current_worker_id)
  1811. {
  1812. STARPU_PTHREAD_MUTEX_LOCK(&sched_ctx->parallel_sect_mutex[workerid]);
  1813. STARPU_PTHREAD_COND_SIGNAL(&sched_ctx->parallel_sect_cond[workerid]);
  1814. STARPU_PTHREAD_MUTEX_UNLOCK(&sched_ctx->parallel_sect_mutex[workerid]);
  1815. }
  1816. else
  1817. sched_ctx->parallel_sect[workerid] = 0;
  1818. sched_ctx->master[workerid] = -1;
  1819. }
  1820. int workerid;
  1821. for(w = 0; w < nworkers; w++)
  1822. {
  1823. workerid = workerids[w];
  1824. if(masters[w] != -1)
  1825. {
  1826. int master = sched_ctx->master[workerid];
  1827. if(current_worker_id == -1 || workerid != current_worker_id)
  1828. sem_wait(&sched_ctx->wake_up_sem[master]);
  1829. }
  1830. }
  1831. return;
  1832. }
  1833. static int _starpu_sched_ctx_find_master(unsigned sched_ctx_id, int *workerids, int nworkers)
  1834. {
  1835. struct _starpu_sched_ctx *sched_ctx = _starpu_get_sched_ctx_struct(sched_ctx_id);
  1836. int new_master = workerids[nworkers-1];
  1837. int current_worker_id = starpu_worker_get_id();
  1838. int current_is_in_section = 0;
  1839. int npotential_masters = 0;
  1840. int nawake_workers = 0;
  1841. int ntrue_masters = 0;
  1842. int potential_masters[nworkers];
  1843. int awake_workers[nworkers];
  1844. int true_masters[nworkers];
  1845. int i,w;
  1846. for(w = 0 ; w < nworkers ; w++)
  1847. {
  1848. if (current_worker_id == workerids[w])
  1849. current_is_in_section = 1;
  1850. int master = sched_ctx->master[workerids[w]];
  1851. if (master > -1)
  1852. {
  1853. int already_seen = 0;
  1854. //Could create a function for this. Basically searching an element in an array.
  1855. for (i = 0 ; i < npotential_masters; i++)
  1856. {
  1857. if (potential_masters[i] == master)
  1858. {
  1859. already_seen = 1;
  1860. break;
  1861. }
  1862. }
  1863. if (!already_seen)
  1864. potential_masters[npotential_masters++] = master;
  1865. }
  1866. else if (master == -1)
  1867. awake_workers[nawake_workers++] = workerids[w];
  1868. }
  1869. for (i = 0 ; i < npotential_masters ; i++) {
  1870. int master_is_in_section = 0;
  1871. //Could create a function for this. Basically searching an element in an array.
  1872. for (w = 0 ; w < nworkers ; w++)
  1873. {
  1874. if (workerids[w] == potential_masters[i])
  1875. {
  1876. master_is_in_section = 1;
  1877. break;
  1878. }
  1879. }
  1880. if (master_is_in_section)
  1881. true_masters[ntrue_masters++] = potential_masters[i];
  1882. }
  1883. if (current_is_in_section)
  1884. new_master = current_worker_id;
  1885. else
  1886. {
  1887. if (ntrue_masters > 1)
  1888. {
  1889. if (nawake_workers > 0)
  1890. new_master = awake_workers[nawake_workers - 1];
  1891. else
  1892. new_master = true_masters[ntrue_masters - 1];
  1893. }
  1894. }
  1895. return new_master;
  1896. }
  1897. static void _starpu_sched_ctx_add_workers_to_master(unsigned sched_ctx_id, int *workerids, int nworkers, int new_master)
  1898. {
  1899. struct _starpu_sched_ctx *sched_ctx = _starpu_get_sched_ctx_struct(sched_ctx_id);
  1900. int w;
  1901. int nput_to_sleep = 0;
  1902. int nwake_up = 0;
  1903. int put_to_sleep[nworkers];
  1904. int wake_up[nworkers];
  1905. for(w = 0 ; w < nworkers ; w++)
  1906. {
  1907. int master = sched_ctx->master[workerids[w]];
  1908. if (master == -1 && workerids[w] != new_master)
  1909. put_to_sleep[nput_to_sleep++] = workerids[w];
  1910. else if(master != -1 && workerids[w] == new_master)
  1911. wake_up[nwake_up++] = workerids[w];
  1912. }
  1913. if(nwake_up > 0)
  1914. _starpu_sched_ctx_wake_these_workers_up(sched_ctx_id, wake_up, nwake_up);
  1915. if(nput_to_sleep > 0)
  1916. _starpu_sched_ctx_get_workers_to_sleep(sched_ctx_id, put_to_sleep, nput_to_sleep, new_master);
  1917. }
  1918. static void _starpu_sched_ctx_set_master(struct _starpu_sched_ctx *sched_ctx, int *workerids, int nworkers, int master)
  1919. {
  1920. int i;
  1921. for(i = 0; i < nworkers; i++)
  1922. {
  1923. if(workerids[i] != master)
  1924. sched_ctx->master[workerids[i]] = master;
  1925. }
  1926. }
  1927. int starpu_sched_ctx_book_workers_for_task(unsigned sched_ctx_id, int *workerids, int nworkers)
  1928. {
  1929. int new_master = _starpu_sched_ctx_find_master(sched_ctx_id, workerids, nworkers);
  1930. _starpu_sched_ctx_add_workers_to_master(sched_ctx_id, workerids, nworkers, new_master);
  1931. return new_master;
  1932. }
  1933. void starpu_sched_ctx_unbook_workers_for_task(unsigned sched_ctx_id, int master)
  1934. {
  1935. /* wake up starpu workers */
  1936. _starpu_sched_ctx_wake_up_workers(sched_ctx_id, master);
  1937. }
  1938. struct starpu_perfmodel_arch * _starpu_sched_ctx_get_perf_archtype(unsigned sched_ctx_id)
  1939. {
  1940. struct _starpu_sched_ctx *sched_ctx = _starpu_get_sched_ctx_struct(sched_ctx_id);
  1941. return &sched_ctx->perf_arch;
  1942. }
  1943. int starpu_sched_ctx_get_worker_rank(unsigned sched_ctx_id)
  1944. {
  1945. int idx = 0;
  1946. int curr_workerid = starpu_worker_get_id();
  1947. int worker;
  1948. struct _starpu_sched_ctx *sched_ctx = _starpu_get_sched_ctx_struct(sched_ctx_id);
  1949. if(sched_ctx->sched_policy || !sched_ctx->awake_workers)
  1950. return -1;
  1951. struct starpu_worker_collection *workers = sched_ctx->workers;
  1952. struct starpu_sched_ctx_iterator it;
  1953. workers->init_iterator(workers, &it);
  1954. while(workers->has_next(workers, &it))
  1955. {
  1956. worker = workers->get_next(workers, &it);
  1957. if(worker == curr_workerid)
  1958. return idx;
  1959. idx++;
  1960. }
  1961. return -1;
  1962. }