sched_ctx.c 84 KB

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