Andrea Arcangeli <[EMAIL PROTECTED]> writes:

> The new elevator ordering algorithm returns me much better numbers
> than the CSCAN one with tiobench.

Do you know why? Is it because the average seek distance becomes
smaller with your algorithm? (I later realized that request merging is
done before the elevator function kicks in, so your algorithm should
not produce more seeks than a CSCAN algorithm. Unfortunately I didn't
realize this when I wrote my CSCAN patch.)

Btw, does anyone know how the seek time depends on the seek distance
on modern disk hardware?

-- 
Peter �sterlund          Email:     [EMAIL PROTECTED]
Sk�ndalsv�gen 35                    [EMAIL PROTECTED]
S-128 66 Sk�ndal         Home page: http://home1.swipnet.se/~w-15919
Sweden                   Phone:     +46 8 942647

-
To unsubscribe from this list: send the line "unsubscribe linux-kernel" in
the body of a message to [EMAIL PROTECTED]
Please read the FAQ at http://www.tux.org/lkml/

Reply via email to