RFC sched/fair: Complete EEVDF
Get series with b4
b4 am [email protected]Versions newest first
- v1 RFC Latest10 patches 66 repliesIn review
Patches in v1 No applies recorded yet
| # | Subject and files | Size | Replies | Applied |
|---|---|---|---|---|
| 1/10 | sched/eevdf: Add feature commentskernel/ | +7 | 0 replies | |
| 2/10 | sched/eevdf: Remove min_vruntime_copykernel/ kernel/ | +2 | 0 replies | |
| 3/10 | sched/fair: Cleanup pick_task_fair() vs throttlekernel/ | +3 | 1 reply | |
| 4/10 | sched/fair: Cleanup pick_task_fair()s currkernel/ | +2 | 0 replies | |
| 5/10 | sched/fair: Unify pick_{,next_}_task_fair()kernel/ | +8 | 1 reply | |
| 6/10 | sched: Allow sched_class::dequeue_task() to failkernel/ kernel/ kernel/ +4 more | +19 | 0 replies | |
| 7/10 | sched/fair: Re-organize dequeue_task_fair()kernel/ | +55 | 0 replies | |
| 8/10 | sched/fair: Implement delayed dequeueinclude/ kernel/ kernel/ +2 more | +167 | 51 replies | |
| 9/10 | sched/eevdf: Allow shorter slices to wakeup-preemptkernel/ kernel/ | +12 | 0 replies | |
| 10/10 | sched/eevdf: Use sched_attr::sched_runtime to set request/slice suggestioninclude/ kernel/ kernel/ +1 more | +36 | 12 replies |
Reviews trailers per patch
1 of 10 patches has a Reviewed-by or Acked-by.
| Patch | Mike Galbraith | Ben Segall |
|---|---|---|
| 1/10 | ||
| 2/10 | ||
| 3/10 | R-b | |
| 4/10 | ||
| 5/10 | ||
| 6/10 | ||
| 7/10 | ||
| 8/10 | ||
| 9/10 | T-b | |
| 10/10 |
Trailers given in replies are filled; those carried in the patches from earlier versions are outlined with dashes.
Cover letter [RFC][PATCH 00/10] sched/fair: Complete EEVDF
Hi all,
I'm slowly crawling back out of the hole and trying to get back to work. Availability is still low on my end, but I'll try and respond to some email.
Anyway, in order to get my feet wet again with sitting behind a computer, find here a few patches that should functionally complete the EEVDF journey.
This very much includes the new interface that exposes the extra parameter that EEVDF has. I've chosen to use sched_attr::sched_runtime for this over a nice-like value because some workloads actually know their slice length (can be dynamically measured in the same way as for deadline using CLOCK_THREAD_CPUTIME_ID) and using the real request size is much more effective than some relative measure.
[[ using too short a request size will increase job preemption overhead,
using too long a request size will decrease timeliness ]]
The whole delayed-dequeue thing is I think a fundamental thing that was missing from the EEVDF paper. Without something like this EEVDF will simply not work right. IIRC this was mentioned to me many years ago when people worked on BFQ iosched and ran into this same issue. Time had erased the critical aspect of this note and I had to re-discover it again.
Also, I think Ben expressed concern that preserving lag over long periods doesn't make sense a while back.
The implementation presented here is one that should work with our cgroup mess and keeps most of the ugly inside fair.c unlike previous versions which puked all over the core scheduler code.
Critically cfs-cgroup throttling is not tested, and cgroups are only tested in so far that a systemd infected machine now boots (took a bit).
Other than that, it works well enough to build the next kernel and it passes the few trivial latency-slice tests I ran.
Anyway, please have a poke and let me know...