Auto-Adaptive scheduler and semaphore patch ( 2.2.14 ) ...

[Davide Libenzi]

Tuesday, January 25, 2000 9:41 PM
David Lang <dlang en diginsite.com> wrote :
> if your new code reorders stuff  to fit the cache better, but the old code
> does not then your new code will do better in comparisen then if both sets
> get teh optimization.

OK, You mean task_struct fields reordering.
ASAP I'll code my patch without task struct fields reorganization.


> if you dynamicly change from one to the other how can you benchmark the
> two to see where the proper place to switch over is? Also the test that
> you have in to use one or the other is pure overhead, for benchmarking it
> would be better to have two kernels, one with each scheduler and no test
> to choose between them.

Even if the patch must be evaluated for a relative high number of processes
in RQ
I'd like to measure the global patch with conventional benchmarks.


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 en vger.rutgers.edu
Please read the FAQ at http://www.tux.org/lkml/