Re: Elevator vs first-come-first-served

Stephen C. Tweedie (sct@redhat.com)
Mon, 16 Nov 1998 22:20:55 GMT


Hi,

On Mon, 16 Nov 1998 06:16:00 -0500 (EST), Robert Minichino
<rmini@joni.pasture.net> said:

> The modified elevator algorithm as currently used is more than
> adequate for most workstation and light server use; it's reasonably
> fair, and most workstation disk drives do little to no reordering
> (buffers on typical IDE drives range from 64-512k). However, with an
> intelligent caching disk controller (either on the HBA, or a SCSI-SCSI
> RAID controller), the sorting of disk blocks can actually decrease
> performance.

For such disks, just enable tagged command queueing: we already let the
disks reorder as many commands as we can fit into the tagged command
queue.

--Stephen

-
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/