lkml.org 
[lkml]   [2007]   [Apr]   [18]   [last100]   RSS Feed
Views: [wrap][no wrap]   [headers]  [forward] 
 
Messages in this thread
/
Date
From
SubjectRe: [Announce] [patch] Modular Scheduler Core and Completely Fair Scheduler [CFS]

* Linus Torvalds <torvalds@linux-foundation.org> wrote:

> For example, maybe we can approximate it by spreading out the
> statistics: right now you have things like
>
> - last_ran, wait_runtime, sum_wait_runtime..
>
> be per-thread things. [...]

yes, yes, yes! :) My thinking is "struct sched_group" embedded into
_arbitrary_ other resource containers and abstractions, which
sched_group's are then in a simple hierarchy and are driven by the core
scheduling machinery.

> [...] Maybe some of those can be spread out, so that you put a part of
> them in the "struct vm_struct" thing (to approximate processes), part
> of them in the "struct user" struct (to approximate the user-level
> thing), and part of it in a per-container thing for when/if we support
> that kind of thing?

yes.

Ingo
-
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/

\
 
 \ /
  Last update: 2007-04-18 21:47    [W:0.307 / U:0.240 seconds]
©2003-2020 Jasper Spaans|hosted at Digital Ocean and TransIP|Read the blog|Advertise on this site