sched_ctx.c 87 KB

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