lkml.org 
[lkml]   [2007]   [Apr]   [14]   [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]
    On Sat, 14 Apr 2007, Davide Libenzi wrote:

    > Haven't looked at the scheduler code yet, but for a similar problem I use
    > a time ring. The ring has Ns (2 power is better) slots (where tasks are
    > queued - in my case they were som sort of timers), and it has a current
    > base index (Ib), a current base time (Tb) and a time granularity (Tg). It
    > also has a bitmap with bits telling you which slots contains queued tasks.
    > An item (task) that has to be scheduled at time T, will be queued in the slot:
    >
    > S = Ib + min((T - Tb) / Tg, Ns - 1);

    ... mod Ns, of course ;)


    - Davide


    -
    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-15 01:29    [W:0.020 / U:1.804 seconds]
    ©2003-2016 Jasper Spaans. hosted at Digital OceanAdvertise on this site