lkml.org 
[lkml]   [2017]   [Aug]   [14]   [last100]   RSS Feed
Views: [wrap][no wrap]   [headers]  [forward] 
 
Messages in this thread
    /
    Date
    From
    SubjectRe: [PATCH 1/2] sched/wait: Break up long wake list walk
    On Mon, Aug 14, 2017 at 06:48:06PM -0700, Linus Torvalds wrote:
    > On Mon, Aug 14, 2017 at 5:52 PM, Tim Chen <tim.c.chen@linux.intel.com> wrote:
    > > We encountered workloads that have very long wake up list on large
    > > systems. A waker takes a long time to traverse the entire wake list and
    > > execute all the wake functions.
    > >
    > > We saw page wait list that are up to 3700+ entries long in tests of large
    > > 4 and 8 socket systems. It took 0.8 sec to traverse such list during
    > > wake up. Any other CPU that contends for the list spin lock will spin
    > > for a long time. As page wait list is shared by many pages so it could
    > > get very long on systems with large memory.
    >
    > I really dislike this patch.
    >
    > The patch seems a band-aid for really horrible kernel behavior, rather
    > than fixing the underlying problem itself.
    >
    > Now, it may well be that we do end up needing this band-aid in the
    > end, so this isn't a NAK of the patch per se. But I'd *really* like to
    > see if we can fix the underlying cause for what you see somehow..

    We could try it and it may even help in this case and it may
    be a good idea in any case on such a system, but:

    - Even with a large hash table it might be that by chance all CPUs
    will be queued up on the same page
    - There are a lot of other wait queues in the kernel and they all
    could run into a similar problem
    - I suspect it's even possible to construct it from user space
    as a kind of DoS attack

    Given all that I don't see any alternative to fixing wait queues somehow.
    It's just that systems are so big that now that they're starting to
    stretch the tried old primitives.

    Now in one case (on a smaller system) we debugged we had

    - 4S system with 208 logical threads
    - during the test the wait queue length was 3700 entries.
    - the last CPUs queued had to wait roughly 0.8s

    This gives a budget of roughly 1us per wake up.

    It could be that we could find some way to do "bulk wakeups"
    in the scheduler that are much cheaper, and switch to them if
    there are a lot of entries in the wait queues.

    With that it may be possible to do a wake up in less than 1us.

    But even with that it will be difficult to beat the scaling
    curve. If systems get bigger again (and they will be) it
    could easily break again, as the budget gets smaller and smaller.

    Also disabling interrupts for that long is just nasty.

    Given all that I still think a lock breaker of some form is needed.

    -Andi

    \
     
     \ /
      Last update: 2017-08-15 04:28    [W:3.497 / U:0.028 seconds]
    ©2003-2020 Jasper Spaans|hosted at Digital Ocean and TransIP|Read the blog|Advertise on this site