sched_ctx.c 80 KB

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