Helge Hafting <helgehaf@idb.hist.no> said:
[...]
> Even better: dynamically use the best algorithm depending on the number
> of runnable processes. The only problem I see with this is that calling
> the scheduler through a pointer (or if-statement) will have a overhead of
> its own - every time.
You do realize the scheduler was written (and rewritten several times) to
squeeze the last cycle out of it for "normal" cases, don't you?
-- Horst von Brand vonbrand@sleipnir.valparaiso.cl Casilla 9G, Viņa del Mar, Chile +56 32 672616- To unsubscribe from this list: send the line "unsubscribe linux-kernel" in the body of a message to majordomo@vger.rutgers.edu Please read the FAQ at http://www.tux.org/lkml/
This archive was generated by hypermail 2b29 : Sun Jan 23 2000 - 21:00:27 EST