sched_ctx.c 72 KB

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