[<prev] [next>] [<thread-prev] [thread-next>] [day] [month] [year] [list]
Message-ID: <5499867C.1010201@oracle.com>
Date: Tue, 23 Dec 2014 08:13:00 -0700
From: Khalid Aziz <khalid.aziz@...cle.com>
To: Ingo Molnar <mingo@...nel.org>
CC: Thomas Gleixner <tglx@...utronix.de>,
Peter Zijlstra <peterz@...radead.org>, corbet@....net,
mingo@...hat.com, hpa@...or.com, riel@...hat.com,
akpm@...ux-foundation.org, rientjes@...gle.com, ak@...ux.intel.com,
mgorman@...e.de, raistlin@...ux.it,
kirill.shutemov@...ux.intel.com, atomlin@...hat.com,
avagin@...nvz.org, gorcunov@...nvz.org, serge.hallyn@...onical.com,
athorlton@....com, oleg@...hat.com, vdavydov@...allels.com,
daeseok.youn@...il.com, keescook@...omium.org,
yangds.fnst@...fujitsu.com, sbauer@....utah.edu,
vishnu.ps@...sung.com, axboe@...com, paulmck@...ux.vnet.ibm.com,
linux-kernel@...r.kernel.org, linux-doc@...r.kernel.org,
linux-api@...r.kernel.org
Subject: Re: [PATCH RESEND v4] sched/fair: Add advisory flag for borrowing
a timeslice
On 12/23/2014 03:52 AM, Ingo Molnar wrote:
>
>
> to implement what Thomas suggested in the discussion: a proper
> futex like spin mechanism? That looks like a totally acceptable
> solution to me, without the disadvantages of your proposed
> solution.
Hi Ingo,
Thank you for taking the time to respond. It is indeed possible to
implement a futex like spin mechanism. Futex like mechanism will be
clean and elegant. That is where I had started when I was given this
problem to solve. Trouble I run into is the primary application I am
looking at to help with this solution is Database which implements its
own locking mechanism without using POSIX semaphore or futex. Since the
locking is entirely in userspace, kernel has no clue when the userspace
has acquired one of these locks. So I can see only two ways to solve
this - find a solution in userspace entirely, or have userspace tell the
kernel when it acquires one of these locks. I will spend more time on
finding a way to solve it in userspace and see if I can find a way to
leverage futex mechanism without causing significant change to database
code. There may be a way to use priority inheritance to avoid
contention. Database performance people tell me that their testing has
shown the cost of making any system calls in this code easily offsets
any gains from optimizing for contention avoidance, so that is one big
challenge. Database rewriting their locking code is extremely unlikely
scenario. Am I missing a third option here?
Thanks,
Khalid
--
To unsubscribe from this list: send the line "unsubscribe linux-kernel" in
the body of a message to majordomo@...r.kernel.org
More majordomo info at http://vger.kernel.org/majordomo-info.html
Please read the FAQ at http://www.tux.org/lkml/
Powered by blists - more mailing lists