Andrea Arcangeli <andrea@suse.de> 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: peter.osterlund@mailbox.swipnet.se Sköndalsvägen 35 f90-pos@nada.kth.se 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 majordomo@vger.kernel.org Please read the FAQ at http://www.tux.org/lkml/
This archive was generated by hypermail 2b29 : Sat Sep 30 2000 - 21:00:16 EST