Content-Length: 8983 | pFad | http://lwn.net/Articles/729280/

Reconsidering the scheduler's wake_wide() heuristic [LWN.net]
|
|
Subscribe / Log in / New account

Reconsidering the scheduler's wake_wide() heuristic

Reconsidering the scheduler's wake_wide() heuristic

Posted Jul 31, 2017 5:55 UTC (Mon) by josefbacik (subscriber, #90083)
Parent article: Reconsidering the scheduler's wake_wide() heuristic

Sorry for some reason I missed the follow up conversations, I'll go back and read through them shortly and respond on list.

However I did come up with a different solution while looking at a CPU imbalance problem (https://josefbacik.github.io/kernel/scheduler/cgroup/2017...). Mike is right, any messing with the heuristic here is likely to end in tears. A problem with wake_wide is overloading the waker CPU when it decides we need affinity, even on heavily loaded systems. Instead of messing with wake_wide and trying to make it smarter I just addressed the problem it sometimes creates, ping-ponging. One of my patches provides a way to detect when we are trying to wake affine something that has been recently load balanced and skip the wake affine. This gets us the same behavior as if wake_wide returned 1 and side steps the problem of trying to do a one size fits most heuristic in wake_wide.


to post comments


Copyright © 2025, Eklektix, Inc.
Comments and public postings are copyrighted by their creators.
Linux is a registered trademark of Linus Torvalds









ApplySandwichStrip

pFad - (p)hone/(F)rame/(a)nonymizer/(d)eclutterfier!      Saves Data!


--- a PPN by Garber Painting Akron. With Image Size Reduction included!

Fetched URL: http://lwn.net/Articles/729280/

Alternative Proxies:

Alternative Proxy

pFad Proxy

pFad v3 Proxy

pFad v4 Proxy