Messages in this thread | | | Date | Sat, 5 Jan 2002 18:02:05 -0800 (PST) | From | Davide Libenzi <> | Subject | Re: [announce] [patch] ultra-scalable O(1) SMP and UP scheduler |
| |
On Sun, 6 Jan 2002, Ingo Molnar wrote:
> And George Anzinger has a nice idea to help those platforms which have > slow bitsearch functions, we can keep a floating pointer of the highest > priority queue which can be made NULL if the last task from a priority > level was used up or can be increased if a higher priority task is added, > this pointer will be correct in most of the time, and we can fall back to > the bitsearch if it's NULL.
Ingo, you don't need that many queues, 32 are more than sufficent. If you look at the distribution you'll see that it matters ( for interactive feel ) only the very first ( top ) queues, while lower ones can very easily tollerate a FIFO pickup w/out bad feelings.
- 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/
| |