Messages in this thread | | | Date | Tue, 29 Jun 2004 13:10:17 +0200 | From | Pavel Machek <> | Subject | Re: [PATCH] Staircase Scheduler v6.3 for 2.6.7-rc2 |
| |
Hi!
> This is an update of the scheduler policy mechanism rewrite using the > infrastructure of the current O(1) scheduler. Slight changes from the > original design require a detailed description. The change to the original > design has enabled all known corner cases to be abolished and cpu > distribution to be much better maintained. It has proven to be stable in my > testing and is ready for more widespread public testing now. > > > Aims: > - Interactive by design rather than have interactivity bolted on. > - Good scalability. > - Simple predictable design. > - Maintain appropriate cpu distribution and fairness. > - Low scheduling latency for normal policy tasks. > - Low overhead. > - Making renicing processes actually matter for CPU distribution (nice 0 gets > 20 times what nice +20 gets) > - Resistant to priority inversion
How do you solve priority inversion?
Can you do "true idle threads" now? (I.e. nice +infinity?) Pavel -- People were complaining that M$ turns users into beta-testers... ...jr ghea gurz vagb qrirybcref, naq gurl frrz gb yvxr vg gung jnl! - To unsubscribe from this list: send the line "unsubscribe linux-kernel" in the body of a message to majordomo@vger.kernel.org More majordomo info at http://vger.kernel.org/majordomo-info.html Please read the FAQ at http://www.tux.org/lkml/
| |