Messages in this thread | | | Date | Tue, 03 Aug 2004 10:33:36 +1000 | From | Peter Williams <> | Subject | Re: [PATCH] V-3.0 Single Priority Array O(1) CPU Scheduler Evaluation |
| |
William Lee Irwin III wrote: > On Mon, Aug 02, 2004 at 04:31:46PM +1000, Peter Williams wrote: > >>3. Priority based O(1) scheduler with active/expired arrays replaced by >>a single array and an O(1) promotion mechanism plus scheduling >>statistics with new interactive bonus mechanism and throughput bonus >>mechanism: > > > Hmm. Given do_promotions() I'd expect fenceposts, not iteration over > the priority levels of the runqueue.
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?
Peter -- Peter Williams pwil3058@bigpond.net.au
"Learning, n. The kind of ignorance distinguishing the studious." -- Ambrose Bierce
- 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/
| |