Paris7/work-stealing-scheduler
Archived
1
0
Fork 0
Code Issues Pull requests Projects Releases Packages Wiki Activity

Revert "random task" as it's not efficient compared to simply taking the top task

Browse source 
This reverts commit 274c2d6160.
This commit is contained in:
Mylloon 2024-04-20 21:15:46 +02:00
parent a7d1ca5964
commit 9ebd5e0a2d
Signed by: Anri
GPG key ID: A82D63DFF8D1317F
1 changed files with 1 additions and 10 deletions
Show stats Download patch file Download diff file Expand all files Collapse all files

11
src/sched.c
View file

@ -71,9 +71,6 @@ sched_init(int nthreads, int qlen, taskfunc f, void *closure)
return -1; return -1;
} }
// Initialise l'aléatoire
srand(time(NULL));
pthread_t threads[nthreads]; pthread_t threads[nthreads];
for(int i = 0; i < nthreads; ++i) { for(int i = 0; i < nthreads; ++i) {
if(pthread_create(&threads[i], NULL, sched_worker, &sched) != 0) { if(pthread_create(&threads[i], NULL, sched_worker, &sched) != 0) {
@ -158,13 +155,7 @@ sched_worker(void *arg)
continue; continue;
} }
// Extrait une tâche aléatoire de la liste // Extrait la tâche de la pile
int random_index = rand() % (s->top + 1);
struct task_info echange = s->tasks[random_index];
s->tasks[random_index] = s->tasks[s->top];
s->tasks[s->top] = echange;
taskfunc f = s->tasks[s->top].f; taskfunc f = s->tasks[s->top].f;
void *closure = s->tasks[s->top].closure; void *closure = s->tasks[s->top].closure;
s->top--; s->top--;