[lkml]   [2002]   [Jan]   [5]   [last100]   RSS Feed
Views: [wrap][no wrap]   [headers]  [forward] 
Messages in this thread
    SubjectRe: [announce] [patch] ultra-scalable O(1) SMP and UP scheduler
    On Sun, 6 Jan 2002, Ingo Molnar wrote:

    > On Sun, 6 Jan 2002, Alan Cox wrote:
    > > 64 queues costs a tiny amount more than 32 queues. If you can get it
    > > down to eight or nine queues with no actual cost (espcially for non
    > > realtime queues) then it represents a huge win since an 8bit ffz can
    > > be done by lookup table and that is fast on all processors
    > i'm afraid that while 32 might work, 8 will definitely not be enough. In
    > the interactivity-detection scheme i added it's important for interactive
    > tasks to have some room (in terms of priority levels) to go up without
    > hitting the levels of the true CPU abusers.
    > we can do 32-bit ffz by doing 4x 8-bit ffz's though:
    > if (likely(byte[0]))
    > return ffz8[byte[0]];
    > else if (byte[1])
    > return ffz8[byte[1]];
    > else if (byte[2]
    > return ffz8[byte[2]];
    > else if (byte[3]
    > return ffz8[byte[3]];
    > else
    > return -1;
    > and while this is still 4 branches, it's better than a loop of 32. But i
    > also think that George Anzinger's idea works well too to reduce the cost
    > of bitsearching. Or those platforms that decide to do so could search the
    > arrray directly as well - if it's 32 queues then it's a cache footprint of
    > 4 cachelines, which can be searched directly without any problem.

    dyn_prio -> [0..15]

    each time a task exaust its ts you decrease dyn_prio.

    queue = dyn_prio >> 1

    You get 16 consecutive CPU hog steps before falling in the hell of CPU
    bound tasks

    - Davide

    To unsubscribe from this list: send the line "unsubscribe linux-kernel" in
    the body of a message to
    More majordomo info at
    Please read the FAQ at

     \ /
      Last update: 2005-03-22 13:15    [W:0.021 / U:5.968 seconds]
    ©2003-2017 Jasper Spaans. hosted at Digital OceanAdvertise on this site