lkml.org 
[lkml]   [2000]   [Jan]   [22]   [last100]   RSS Feed
Views: [wrap][no wrap]   [headers]  [forward] 
 
Messages in this thread
/
SubjectRe: Interesting analysis of linux kernel threading by IBM
Date
From
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/

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