[lkml]   [2000]   [Jan]   [23]   [last100]   RSS Feed
Views: [wrap][no wrap]   [headers]  [forward] 
Messages in this thread
SubjectRe: Interesting analysis of linux kernel threading by IBM
Horst von Brand:
> Say which hard facts?
Simple. Let's play the game of optimizing.

The IBM guy looked at sched.c and did some tweaking which seemed an
obvious improvement for him (don't always compute goodness for all
running processes.) Actualy there are a couple of guys looking at
sched.c and try to change O(n) to O(log(n)). If you find any place
where you thingk you might introduce such a change then go for it.

Keep in mind that the absolut numbers of an O(log(n)) algorithm might
be worse than for O(n) in the average case. Then say good by to
averaging and do resource adaptive algorithms and mind the overhead.

More or less this is the game called optimizing.
Let's play it. We will see...


-- Michael Schulz, Uni Hamburg

To unsubscribe from this list: send the line "unsubscribe linux-kernel" in
the body of a message to
Please read the FAQ at

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