sched_ctx.c 73 KB

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