lkml.org 
[lkml]   [2001]   [Dec]   [9]   [last100]   RSS Feed
Views: [wrap][no wrap]   [headers]  [forward] 
 
Messages in this thread
/
SubjectRe: [RFC][PATCH] 2.5.0 Multi-Queue Scheduler
Date
From
> 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

8 queues makes it economical to compute the ffz by lookup. (Well
actually 9 queues including idle). To go to 32 queues means I have to
rely on hardware ffz or for other processors on a multiply, 26bit shift and
64 way lookup.

While
queue = queue_lookup[(0x0450FBAF*runnable)>>26];

makes for glorious obfuscating scheduling its not good for speed ;)

> 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
> priorities.

For now I'm ignoring real time. The priority is a combination of two things
->count, which is computed as before and means a higher priority task gets
a bit more time, and ->queue which when a task wakes is based on ->count.
Everyone who exceeds their quantum ends up in the lowest priority queue
next time around.

Tasks with roughly the same priority will not neccessarily run in strict
priority order but they will get appropriate extra time and run before
anything measurably different in priority.

Incidentally you can test the "approximate order" behaviour simply by
hacking goodness. I couldn't tell the difference before or after so I feel
its probably acceptable.

Alan
-
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/

\
 
 \ /
  Last update: 2005-03-22 13:18    [W:0.218 / U:1.908 seconds]
©2003-2020 Jasper Spaans|hosted at Digital Ocean and TransIP|Read the blog|Advertise on this site