sched_ctx.c 92 KB

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