lkml.org 
[lkml]   [2015]   [Jan]   [6]   [last100]   RSS Feed
Views: [wrap][no wrap]   [headers]  [forward] 
 
Messages in this thread
/
Date
From
SubjectRe: [PATCH] Repost sched-rt: Reduce rq lock contention by eliminating locking of non-feasible target
On Tue, Jan 06, 2015 at 11:01:51AM -0800, Tim Chen wrote:
> Didn't get any response for this patch probably due to the holidays.
> Reposting it as we will like to get it merged to help our database
> workload.
>
> This patch added checks that prevent futile attempts to move rt tasks
> to cpu with active tasks of equal or higher priority. This reduces
> run queue lock contention and improves the performance of a well
> known OLTP benchmark by 0.7%.

Don't immediately see anything wrong with this, Steve?

Juri, do we want to do a similar thing to the dl bits?

> Signed-off-by: Tim Chen <tim.c.chen@linux.intel.com>
> ---
> kernel/sched/rt.c | 9 ++++++++-
> 1 file changed, 8 insertions(+), 1 deletion(-)
>
> diff --git a/kernel/sched/rt.c b/kernel/sched/rt.c
> index ee15f5a..0e4382e 100644
> --- a/kernel/sched/rt.c
> +++ b/kernel/sched/rt.c
> @@ -1337,7 +1337,8 @@ select_task_rq_rt(struct task_struct *p, int cpu, int sd_flag, int flags)
> curr->prio <= p->prio)) {
> int target = find_lowest_rq(p);
>
> - if (target != -1)
> + if (target != -1 &&
> + p->prio < cpu_rq(target)->rt.highest_prio.curr)
> cpu = target;
> }
> rcu_read_unlock();
> @@ -1613,6 +1614,12 @@ static struct rq *find_lock_lowest_rq(struct task_struct *task, struct rq *rq)
> break;
>
> lowest_rq = cpu_rq(cpu);
> +
> + if (lowest_rq->rt.highest_prio.curr <= task->prio) {
> + /* target rq has tasks of equal or higher priority, try again */
> + lowest_rq = NULL;
> + continue;
> + }
>
> /* if the prio of this runqueue changed, try again */
> if (double_lock_balance(rq, lowest_rq)) {
> --
> 1.8.3.1
>
>


\
 
 \ /
  Last update: 2015-01-06 20:41    [W:0.096 / U:0.624 seconds]
©2003-2020 Jasper Spaans|hosted at Digital Ocean and TransIP|Read the blog|Advertise on this site