diff options
author | Luca Abeni <luca.abeni@unitn.it> | 2015-10-16 04:06:21 -0400 |
---|---|---|
committer | Ingo Molnar <mingo@kernel.org> | 2015-10-20 04:13:36 -0400 |
commit | 5aa5050787f449e7eaef2c5ec93c7b357aa7dcdc (patch) | |
tree | 415d7714d29be706d5713a6a2447500eba8d9c00 | |
parent | 0baabb385eb4bce699ddab0db015112be6cf1e6a (diff) |
sched/deadline: Fix migration of SCHED_DEADLINE tasks
Commit:
9d5142624256 ("sched/deadline: Reduce rq lock contention by eliminating locking of non-feasible target")
broke select_task_rq_dl() and find_lock_later_rq(), because it introduced
a comparison between the local task's deadline and dl.earliest_dl.curr of
the remote queue.
However, if the remote runqueue does not contain any SCHED_DEADLINE
task its earliest_dl.curr is 0 (always smaller than the deadline of
the local task) and the remote runqueue is not selected for pushing.
As a result, if an application creates multiple SCHED_DEADLINE
threads, they will never be pushed to runqueues that do not already
contain SCHED_DEADLINE tasks.
This patch fixes the issue by checking if dl.dl_nr_running == 0.
Signed-off-by: Luca Abeni <luca.abeni@unitn.it>
Signed-off-by: Peter Zijlstra (Intel) <peterz@infradead.org>
Cc: Juri Lelli <juri.lelli@arm.com>
Cc: Linus Torvalds <torvalds@linux-foundation.org>
Cc: Mike Galbraith <efault@gmx.de>
Cc: Peter Zijlstra <peterz@infradead.org>
Cc: Thomas Gleixner <tglx@linutronix.de>
Cc: Wanpeng Li <wanpeng.li@linux.intel.com>
Fixes: 9d5142624256 ("sched/deadline: Reduce rq lock contention by eliminating locking of non-feasible target")
Link: http://lkml.kernel.org/r/1444982781-15608-1-git-send-email-luca.abeni@unitn.it
Signed-off-by: Ingo Molnar <mingo@kernel.org>
-rw-r--r-- | kernel/sched/deadline.c | 8 |
1 files changed, 5 insertions, 3 deletions
diff --git a/kernel/sched/deadline.c b/kernel/sched/deadline.c index fc8f01083527..142df2668e5d 100644 --- a/kernel/sched/deadline.c +++ b/kernel/sched/deadline.c | |||
@@ -1066,8 +1066,9 @@ select_task_rq_dl(struct task_struct *p, int cpu, int sd_flag, int flags) | |||
1066 | int target = find_later_rq(p); | 1066 | int target = find_later_rq(p); |
1067 | 1067 | ||
1068 | if (target != -1 && | 1068 | if (target != -1 && |
1069 | dl_time_before(p->dl.deadline, | 1069 | (dl_time_before(p->dl.deadline, |
1070 | cpu_rq(target)->dl.earliest_dl.curr)) | 1070 | cpu_rq(target)->dl.earliest_dl.curr) || |
1071 | (cpu_rq(target)->dl.dl_nr_running == 0))) | ||
1071 | cpu = target; | 1072 | cpu = target; |
1072 | } | 1073 | } |
1073 | rcu_read_unlock(); | 1074 | rcu_read_unlock(); |
@@ -1417,7 +1418,8 @@ static struct rq *find_lock_later_rq(struct task_struct *task, struct rq *rq) | |||
1417 | 1418 | ||
1418 | later_rq = cpu_rq(cpu); | 1419 | later_rq = cpu_rq(cpu); |
1419 | 1420 | ||
1420 | if (!dl_time_before(task->dl.deadline, | 1421 | if (later_rq->dl.dl_nr_running && |
1422 | !dl_time_before(task->dl.deadline, | ||
1421 | later_rq->dl.earliest_dl.curr)) { | 1423 | later_rq->dl.earliest_dl.curr)) { |
1422 | /* | 1424 | /* |
1423 | * Target rq has tasks of equal or earlier deadline, | 1425 | * Target rq has tasks of equal or earlier deadline, |