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 [EMAIL PROTECTED] More majordomo info at http://vger.kernel.org/majordomo-info.html Please read the FAQ at http://www.tux.org/lkml/
