On Fri, Apr 28 2000, Kip Matthew Macy wrote:
> Is it necessary for the elevator sorting code to be hard-coded into the
> kernel?
>
> Elevator sorting offers little or no benefit to higher performance I./O
> devices - An
> extreme example would be RAID controllers that have on card memory that
> can do
> reordering more intelligently themselves. A more general example would
> be a typical
> IDE drive with a 2MB buffer that automatically reorders writes to
> minimize head
> movement.
You raise some good points, and I am making the elevator code more
modular as we speak. That will give different drivers the opportunity
to select the elevator (or not select) the one they want. But elevator
reordering is really not that expensive and can work on much larger
sets of data then the typical drive.
-- * Jens Axboe <axboe@suse.de> * Linux CD/DVD-ROM, SuSE Labs * http://kernel.dk- 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/
This archive was generated by hypermail 2b29 : Sun Apr 30 2000 - 21:00:16 EST