[lkml]   [2004]   [Aug]   [2]   [last100]   RSS Feed
Views: [wrap][no wrap]   [headers]  [forward] 
Messages in this thread
    SubjectRe: [PATCH] V-3.0 Single Priority Array O(1) CPU Scheduler Evaluation
    William Lee Irwin III wrote:
    >> Hmm. Given do_promotions() I'd expect fenceposts, not iteration over
    >> the priority levels of the runqueue.

    On Tue, Aug 03, 2004 at 10:33:36AM +1000, Peter Williams wrote:
    > I don't understand what you mean. Do you mean something like the more
    > complex promotion mechanism in the (earlier) EBS scheduler where tasks
    > only get promoted if they've been on a queue without being serviced
    > within a given time?

    An array of size N can be rotated in O(1) time if an integer is kept
    along with it to represent an offset that has to be added to externally-
    visible indices mod N to recover the true index.

    -- wli
    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 14:04    [W:0.025 / U:0.316 seconds]
    ©2003-2016 Jasper Spaans. hosted at Digital OceanAdvertise on this site