[lkml]   [2007]   [Apr]   [15]   [last100]   RSS Feed
Views: [wrap][no wrap]   [headers]  [forward] 
Messages in this thread
    SubjectRe: [Announce] [patch] Modular Scheduler Core and Completely Fair Scheduler [CFS]
    On Sat, 14 Apr 2007, William Lee Irwin III wrote:

    > The two basic attacks on such large priority spaces are the near future
    > vs. far future subdivisions and subdividing the priority space into
    > (most often regular) intervals. Subdividing the priority space into
    > intervals is the most obvious; you simply use some O(lg(n)) priority
    > queue as the bucket discipline in the "time ring," queue by the upper
    > bits of the queue priority in the time ring, and by the lower bits in
    > the O(lg(n)) bucket discipline.

    Sure. If you really need sub-millisecond precision, you can replace the
    bucket's list_head with an rb_root. It may be not necessary though for a
    cpu scheduler (still, didn't read Ingo's code yet).

    - 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: 2007-04-15 06:21    [W:0.020 / U:16.304 seconds]
    ©2003-2016 Jasper Spaans. hosted at Digital OceanAdvertise on this site