sched_ctx.c 68 KB

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