On 02-10-2007 08:06, Ingo Molnar wrote:... From kernel/sched_fair.c: "/* * Targeted preemption latency for CPU-bound tasks: * (default: 20ms, units: nanoseconds) * * NOTE: this latency value is not the same as the concept of * 'timeslice length' - timeslices in CFS are of variable length. * (to see the precise effective timeslice length of your workload, * run vmstat and monitor the context-switches field) ..." So, no notion of something, which are(!) of variable length, and which precise effective timeslice lenght can be seen in nanoseconds? (But not timeslice!) Well, I start to think, this new scheduler could be too simple yet... Nevertheless, it seems, this 1% is important enough to boast a little: "( another detail: due to nanosec accounting and timeline sorting, sched_yield() support is very simple under CFS, and in fact under CFS sched_yield() behaves much better than under any other scheduler i have tested so far. )" [Documentation/sched-design-CFS.txt] Cheers, Jarek P. -
| Andrew Morton | Re: -mm merge plans for 2.6.23 -- sys_fallocate |
| david | Re: Dual-Licensing Linux Kernel with GPL V2 and GPL V3 |
| Linus Torvalds | Linux 2.6.27-rc5 |
| David Miller | Re: [PATCH] net: Fix the prototype of call_netdevice_notifiers |
git: | |
| Gerrit Renker | [PATCH 27/37] dccp: Integration of dynamic feature activation - part 2 (server side) |
| David Miller | Re: [GIT]: Networking |
| Jarek Poplawski | [PATCH] pkt_sched: Destroy gen estimators under rtnl_lock(). |
