Messages in this thread | | | From | Davide Libenzi <> | Subject | Re: Interesting analysis of linux kernel threading by IBM | Date | Sun, 23 Jan 2000 21:15:15 +0100 |
| |
On Sat, 22 Jan 2000, michael_schulz@public.uni-hamburg.de wrote: > 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.
It's exactly what I've done today.
I've modified my cluster-scheduler to boot after a tunable workload and after a tunable delay.
I'll post results and patch next days.
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/
| |