Re: [PATCH v4 1/1] sched/fair: Return all runtime when cfs_b has very little remaining.

Dave Chiluk writes: > On Mon, Jun 24, 2019 at 10:33:07AM -0700, bseg...@google.com wrote: >> This still has a similar cost as reducing min_cfs_rq_runtime to 0 - we >> now take a tg-global lock on every group se dequeue. Setting min=0 means >> that we have to take it on both enqueue and dequeue, w

Re: [PATCH v4 1/1] sched/fair: Return all runtime when cfs_b has very little remaining.

On Mon, Jun 24, 2019 at 10:33:07AM -0700, bseg...@google.com wrote: > This still has a similar cost as reducing min_cfs_rq_runtime to 0 - we > now take a tg-global lock on every group se dequeue. Setting min=0 means > that we have to take it on both enqueue and dequeue, while baseline > means we ta

Re: [PATCH v4 1/1] sched/fair: Return all runtime when cfs_b has very little remaining.

Dave Chiluk writes: > It has been observed, that highly-threaded, user-interactive > applications running under cpu.cfs_quota_us constraints can hit a high > percentage of periods throttled while simultaneously not consuming the > allocated amount of quota. This impacts user-interactive non-cpu b

[PATCH v4 1/1] sched/fair: Return all runtime when cfs_b has very little remaining.

It has been observed, that highly-threaded, user-interactive applications running under cpu.cfs_quota_us constraints can hit a high percentage of periods throttled while simultaneously not consuming the allocated amount of quota. This impacts user-interactive non-cpu bound applications, such as tho