Messages in this thread | | | From | "Davide Libenzi" <> | Subject | Re: Interesting analysis of linux kernel threading by IBM | Date | Fri, 21 Jan 2000 10:09:54 +0100 |
| |
Hi Helge,
Friday, January 21, 2000 9:03 AM Helge Hafting <helgehaf@idb.hist.no> wrote : > 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 don't need to change the scheduler under normal environments since the patch perform equally in these cases giving better results under high load.
Cheers, Davide.
-- All this stuff is IMVHO
- 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/
| |