On Sat, Dec 08, 2001 at 11:58:22AM +0000, Alan Cox wrote:
> Which version of the scheduler do you behave like ?
The 'current'. In this case 2.5.0. This work was mostly
interested in changing data structure layout and algorithms
used to make scheduling decisions. We still wanted to make
the same decision, just more efficiently when faced with
a high rate of scheduling decisions or large number of runnable
tasks. Like I said earlier, this design constraint was
both good and bad.
> I have the core bits of a scheduler that behaves roughly like Linux 2.4 with
> the recent Ingo cache change [in fact that came from working out what the
> Linus scheduler does].
> Uniprocessor scheduling is working fine (I've not tackled the RT stuff tho)
> SMP I'm pondering bits still.
> Currently I do the following
> Two sets of 8 queues per processor, and a bitmask of non empty queues.
I assume the queue a task is assigned to is based on its priority?
Or am I way off. Are there 8 ranges of priorities for runnable tasks?
Just curious how you came up with 8. We also dabbled with a scheduler
that had queues based on task priority. One issue was that we couldn't
seem to come up with an optimal number of queues to represent all task
-- Mike - To unsubscribe from this list: send the line "unsubscribe linux-kernel" in the body of a message to firstname.lastname@example.org More majordomo info at http://vger.kernel.org/majordomo-info.html Please read the FAQ at http://www.tux.org/lkml/
This archive was generated by hypermail 2b29 : Sat Dec 15 2001 - 21:00:15 EST