starpu_replay_sched.c 10 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412413414415416417418419420421422423424425426427428429430431432433434435436437438439440441
  1. /* StarPU --- Runtime system for heterogeneous multicore architectures.
  2. *
  3. * Copyright (C) 2017 Erwan Leria
  4. * Copyright (C) 2017 CNRS
  5. * Copyright (C) 2016-2017 Université de Bordeaux
  6. *
  7. * StarPU is free software; you can redistribute it and/or modify
  8. * it under the terms of the GNU Lesser General Public License as published by
  9. * the Free Software Foundation; either version 2.1 of the License, or (at
  10. * your option) any later version.
  11. *
  12. * StarPU is distributed in the hope that it will be useful, but
  13. * WITHOUT ANY WARRANTY; without even the implied warranty of
  14. * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.
  15. *
  16. * See the GNU Lesser General Public License in COPYING.LGPL for more details.
  17. */
  18. /*
  19. * This reads a sched.rec file and mangles submitted tasks according to the hint
  20. * from that file.
  21. */
  22. #include <starpu.h>
  23. #include <unistd.h>
  24. #include <stdio.h>
  25. #include <math.h>
  26. #include <common/uthash.h>
  27. #include <common/list.h>
  28. #include <common/utils.h>
  29. #include <limits.h>
  30. /*
  31. sched.rec files look like this:
  32. SubmitOrder: 1234
  33. Priority: 12
  34. SpecificWorker: 1
  35. Workers: 0 1 2
  36. DependsOn: 1235
  37. Prefetch: 1234
  38. DependsOn: 1233
  39. MemoryNode: 1
  40. Parameters: 1
  41. */
  42. #define CPY(src, dst, n) memcpy(dst, src, n * sizeof(*dst))
  43. #if 0
  44. #define debug(fmt, ...) fprintf(stderr, fmt, ##__VA_ARGS__)
  45. #else
  46. #define debug(fmt, ...) (void)0
  47. #endif
  48. static unsigned long submitorder; /* Also use as prefetchtag */
  49. static int priority;
  50. static int eosw;
  51. static unsigned workerorder;
  52. static int memnode;
  53. /* FIXME: MAXs */
  54. static uint32_t workers[STARPU_NMAXWORKERS/32];
  55. static unsigned nworkers;
  56. static unsigned dependson[STARPU_NMAXBUFS];
  57. static unsigned ndependson;
  58. static unsigned params[STARPU_NMAXBUFS];
  59. static unsigned nparams;
  60. static enum sched_type
  61. {
  62. NormalTask,
  63. PrefetchTask,
  64. } sched_type;
  65. static struct starpu_codelet cl_prefetch =
  66. {
  67. .where = STARPU_NOWHERE,
  68. .nbuffers = 1,
  69. .modes = { STARPU_R },
  70. };
  71. static struct task
  72. {
  73. UT_hash_handle hh;
  74. unsigned long submitorder;
  75. int priority;
  76. int memnode;
  77. unsigned dependson[STARPU_NMAXBUFS];
  78. unsigned ndependson;
  79. struct starpu_task *depends_tasks[STARPU_NMAXBUFS];
  80. /* For real tasks */
  81. int eosw;
  82. unsigned workerorder;
  83. uint32_t workers[STARPU_NMAXWORKERS/32];
  84. unsigned nworkers;
  85. /* For prefetch tasks */
  86. unsigned params[STARPU_NMAXBUFS];
  87. unsigned nparams;
  88. struct starpu_task *pref_task; /* Actual prefetch task */
  89. } *mangled_tasks, *prefetch_tasks;
  90. LIST_TYPE(dep,
  91. struct task *task;
  92. unsigned i;
  93. );
  94. struct deps
  95. {
  96. UT_hash_handle hh;
  97. unsigned long submitorder;
  98. struct dep_list list;
  99. } *dependencies = NULL;
  100. static void reset(void)
  101. {
  102. submitorder = 0;
  103. priority = INT_MIN;
  104. eosw = -1;
  105. memset(&workers, 0, sizeof(workers));
  106. nworkers = 0;
  107. ndependson = 0;
  108. sched_type = NormalTask;
  109. nparams = 0;
  110. memnode = -1;
  111. workerorder = 0;
  112. }
  113. /* TODO : respecter l'ordre de soumission des tâches SubmitOrder */
  114. static void checkField(char * s)
  115. {
  116. /* Record various information */
  117. #define TEST(field) (!strncmp(s, field": ", strlen(field) + 2))
  118. if (TEST("SubmitOrder"))
  119. {
  120. s = s + strlen("SubmitOrder: ");
  121. submitorder = strtol(s, NULL, 10);
  122. }
  123. else if (TEST("Priority"))
  124. {
  125. s = s + strlen("Priority: ");
  126. priority = strtol(s, NULL, 10);
  127. }
  128. else if (TEST("SpecificWorker"))
  129. {
  130. s = s + strlen("SpecificWorker: ");
  131. eosw = strtol(s, NULL, 10);
  132. }
  133. else if (TEST("Workers"))
  134. {
  135. s = s + strlen("Workers: ");
  136. char * delim = " ";
  137. char * token = strtok(s, delim);
  138. int i = 0;
  139. while (token != NULL)
  140. {
  141. int k = strtol(token, NULL, 10);
  142. STARPU_ASSERT_MSG(k < STARPU_NMAXWORKERS, "%d is bigger than maximum %d\n", k, STARPU_NMAXWORKERS);
  143. workers[k/(sizeof(*workers)*8)] |= (1 << (k%(sizeof(*workers)*8)));
  144. i++;
  145. token = strtok(NULL, delim);
  146. }
  147. nworkers = i;
  148. }
  149. else if (TEST("DependsOn"))
  150. {
  151. /* NOTE : dependsons (in the sched.rec) should be the submit orders of the dependencies,
  152. otherwise it can occur an undefined behaviour
  153. (contrary to the tasks.rec where dependencies are jobids */
  154. unsigned i = 0;
  155. char * delim = " ";
  156. char * token = strtok(s+strlen("DependsOn: "), delim);
  157. while (token != NULL)
  158. {
  159. dependson[i] = strtol(token, NULL, 10);
  160. i++;
  161. token = strtok(NULL, delim);
  162. }
  163. ndependson = i;
  164. }
  165. else if (TEST("Prefetch"))
  166. {
  167. s = s + strlen("Prefetch: ");
  168. submitorder = strtol(s, NULL, 10);
  169. sched_type = PrefetchTask;
  170. }
  171. else if (TEST("Parameters"))
  172. {
  173. s = s + strlen("Parameters: ");
  174. char * delim = " ";
  175. char * token = strtok(s, delim);
  176. int i = 0;
  177. while (token != NULL)
  178. {
  179. params[i] = strtol(token, NULL, 10);
  180. i++;
  181. token = strtok(NULL, delim);
  182. }
  183. nparams = i;
  184. }
  185. else if (TEST("MemoryNode"))
  186. {
  187. s = s + strlen("MemoryNode: ");
  188. memnode = strtol(s, NULL, 10);
  189. }
  190. else if (TEST("Workerorder"))
  191. {
  192. s = s + strlen("Workerorder: ");
  193. workerorder = strtol(s, NULL, 10);
  194. }
  195. }
  196. void schedRecInit(const char * filename)
  197. {
  198. FILE * f = fopen(filename, "r");
  199. if(f == NULL)
  200. {
  201. fprintf(stderr,"unable to open file %s: %s\n", filename, strerror(errno));
  202. return;
  203. }
  204. size_t lnsize = 128;
  205. char *s;
  206. _STARPU_MALLOC(s, sizeof(*s) * lnsize);
  207. int eof = 0;
  208. reset();
  209. while(!eof && !feof(f))
  210. {
  211. char *ln;
  212. /* Get the line */
  213. if (!fgets(s, lnsize, f))
  214. {
  215. eof = 1;
  216. }
  217. while (!(ln = strchr(s, '\n')))
  218. {
  219. _STARPU_REALLOC(s, lnsize * 2);
  220. if (!fgets(s + lnsize-1, lnsize+1, f))
  221. {
  222. eof = 1;
  223. break;
  224. }
  225. lnsize *= 2;
  226. }
  227. if ((ln == s || eof) && submitorder)
  228. {
  229. /* Empty line, doit */
  230. struct task * task;
  231. unsigned i;
  232. _STARPU_MALLOC(task, sizeof(*task));
  233. task->submitorder = submitorder;
  234. task->priority = priority;
  235. task->memnode = memnode;
  236. CPY(dependson, task->dependson, ndependson);
  237. task->ndependson = ndependson;
  238. /* Also record submitorder of tasks that this one will need to depend on */
  239. for (i = 0; i < ndependson; i++)
  240. {
  241. struct dep *dep;
  242. struct starpu_task *starpu_task;
  243. _STARPU_MALLOC(dep, sizeof(*dep));
  244. dep->task = task;
  245. dep->i = i;
  246. struct deps *deps;
  247. HASH_FIND(hh, dependencies, &task->dependson[i], sizeof(submitorder), deps);
  248. if (!deps)
  249. {
  250. /* No task depends on this one yet, add a cell for it */
  251. _STARPU_MALLOC(deps, sizeof(*deps));
  252. dep_list_init(&deps->list);
  253. deps->submitorder = task->dependson[i];
  254. HASH_ADD(hh, dependencies, submitorder, sizeof(submitorder), deps);
  255. }
  256. dep_list_push_back(&deps->list, dep);
  257. /* Create the intermediate task */
  258. starpu_task = dep->task->depends_tasks[i] = starpu_task_create();
  259. starpu_task->cl = NULL;
  260. starpu_task->destroy = 0;
  261. starpu_task->no_submitorder = 1;
  262. }
  263. switch (sched_type)
  264. {
  265. case NormalTask:
  266. /* A new task to mangle, record what needs to be done */
  267. task->eosw = eosw;
  268. task->workerorder = workerorder;
  269. CPY(workers, task->workers, STARPU_NMAXWORKERS/32);
  270. task->nworkers = nworkers;
  271. STARPU_ASSERT(nparams == 0);
  272. debug("adding mangled task %lu\n", submitorder);
  273. HASH_ADD(hh, mangled_tasks, submitorder, sizeof(submitorder), task);
  274. break;
  275. case PrefetchTask:
  276. STARPU_ASSERT(memnode >= 0);
  277. STARPU_ASSERT(eosw == -1);
  278. STARPU_ASSERT(workerorder == 0);
  279. STARPU_ASSERT(nworkers == 0);
  280. CPY(params, task->params, nparams);
  281. task->nparams = nparams;
  282. /* TODO: more params */
  283. STARPU_ASSERT_MSG(nparams == 1, "only supports one parameter at a time");
  284. debug("adding prefetch task for %lu\n", submitorder);
  285. HASH_ADD(hh, prefetch_tasks, submitorder, sizeof(submitorder), task);
  286. break;
  287. default:
  288. STARPU_ASSERT(0);
  289. break;
  290. }
  291. reset();
  292. }
  293. else checkField(s);
  294. }
  295. fclose(f);
  296. }
  297. static void do_prefetch(void *arg)
  298. {
  299. unsigned node = (uintptr_t) arg;
  300. starpu_data_idle_prefetch_on_node(starpu_task_get_current()->handles[0], node, 1);
  301. }
  302. void applySchedRec(struct starpu_task *starpu_task, unsigned long submit_order)
  303. {
  304. struct task *task;
  305. struct deps *deps;
  306. int ret;
  307. HASH_FIND(hh, dependencies, &submit_order, sizeof(submit_order), deps);
  308. if (deps)
  309. {
  310. struct dep *dep;
  311. for (dep = dep_list_begin(&deps->list);
  312. dep != dep_list_end(&deps->list);
  313. dep = dep_list_next(dep))
  314. {
  315. debug("task %lu is %d-th dep for %lu\n", submit_order, dep->i, dep->task->submitorder);
  316. /* Some task will depend on this one, make the dependency */
  317. starpu_task_declare_deps_array(dep->task->depends_tasks[dep->i], 1, &starpu_task);
  318. ret = starpu_task_submit(dep->task->depends_tasks[dep->i]);
  319. STARPU_ASSERT(ret == 0);
  320. }
  321. }
  322. HASH_FIND(hh, prefetch_tasks, &submit_order, sizeof(submit_order), task);
  323. if (task)
  324. {
  325. /* We want to submit a prefetch for this task */
  326. debug("task %lu has a prefetch for parameter %d to node %d\n", submit_order, task->params[0], task->memnode);
  327. struct starpu_task *pref_task;
  328. pref_task = task->pref_task = starpu_task_create();
  329. pref_task->cl = &cl_prefetch;
  330. pref_task->destroy = 1;
  331. pref_task->no_submitorder = 1;
  332. pref_task->callback_arg = (void*)(uintptr_t) task->memnode;
  333. pref_task->callback_func = do_prefetch;
  334. /* TODO: more params */
  335. pref_task->handles[0] = starpu_task->handles[task->params[0]];
  336. /* Make it depend on intermediate tasks */
  337. if (task->ndependson)
  338. {
  339. debug("%u dependencies\n", task->ndependson);
  340. starpu_task_declare_deps_array(pref_task, task->ndependson, task->depends_tasks);
  341. }
  342. ret = starpu_task_submit(pref_task);
  343. STARPU_ASSERT(ret == 0);
  344. }
  345. HASH_FIND(hh, mangled_tasks, &submit_order, sizeof(submit_order), task);
  346. if (task == NULL)
  347. /* Nothing to do for this */
  348. return;
  349. debug("mangling task %lu\n", submit_order);
  350. if (task->eosw >= 0)
  351. {
  352. debug("execute on a specific worker %d\n", task->eosw);
  353. starpu_task->workerid = task->eosw;
  354. starpu_task->execute_on_a_specific_worker = 1;
  355. }
  356. if (task->workerorder > 0)
  357. {
  358. debug("workerorder %d\n", task->workerorder);
  359. starpu_task->workerorder = task->workerorder;
  360. }
  361. if (task->priority != INT_MIN)
  362. {
  363. debug("priority %d\n", task->priority);
  364. starpu_task->priority = task->priority;
  365. }
  366. if (task->nworkers)
  367. {
  368. debug("%u workers %x\n", task->nworkers, task->workers[0]);
  369. starpu_task->workerids_len = sizeof(task->workers) / sizeof(task->workers[0]);
  370. _STARPU_MALLOC(starpu_task->workerids, task->nworkers * sizeof(*starpu_task->workerids));
  371. CPY(task->workers, starpu_task->workerids, STARPU_NMAXWORKERS/32);
  372. }
  373. if (task->ndependson)
  374. {
  375. debug("%u dependencies\n", task->ndependson);
  376. starpu_task_declare_deps_array(starpu_task, task->ndependson, task->depends_tasks);
  377. }
  378. /* And now, let it go! */
  379. }