lkml.org 
[lkml]   [2007]   [May]   [21]   [last100]   RSS Feed
Views: [wrap][no wrap]   [headers]  [forward] 
 
Messages in this thread
    /
    Date
    From
    SubjectRe: [patch] CFS scheduler, -v12
    On Sat, May 19, 2007 at 03:27:54PM +0200, Dmitry Adamushko wrote:
    > Just an(quick) another idea. Say, the load balancer would consider not
    > only p->load_weight but also something like Tw(task) =
    > (time_spent_on_runqueue / total_task's_runtime) * some_scale_constant
    > as an additional "load" component (OTOH, when a task starts, it takes
    > some time for this parameter to become meaningful). I guess, it could
    > address the scenarios your have described (but maybe break some others
    > as well :) ...
    > Any hints on why it's stupid?

    I guess I'll take time out from coding to chime in.

    cfs should probably consider aggregate lag as opposed to aggregate
    weighted load. Mainline's convergence to proper CPU bandwidth
    distributions on SMP (e.g. N+1 tasks of equal nice on N cpus) is
    incredibly slow and probably also fragile in the presence of arrivals
    and departures partly because of this. Tong Li's DWRR repairs the
    deficit in mainline by synchronizing epochs or otherwise bounding epoch
    dispersion. This doesn't directly translate to cfs. In cfs cpu should
    probably try to figure out if its aggregate lag (e.g. via minimax) is
    above or below average, and push to or pull from the other half
    accordingly.


    -- wli
    -
    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-05-21 10:33    [W:5.672 / U:0.580 seconds]
    ©2003-2020 Jasper Spaans|hosted at Digital Ocean and TransIP|Read the blog|Advertise on this site