Messages in this thread |  | | Date | Sun, 17 Sep 2000 22:53:17 +0200 (CEST) | From | Peter Osterlund <> | Subject | Re: An elevator algorithm (patch) |
| |
On Sun, 17 Sep 2000, Andrea Arcangeli wrote:
: And with the default latency values ("infinite") with the test2 : elevator if you're using scsi as your device, the patch can't make : runtime differences either.
The test2 elevator (assuming it is the same as the test8 version) in the infinite latency case will always send the request with the lowest sector number to the drive. (The request queue will always be sorted, since the elevator function degenerates to insertion sort.) Do you really suggest that this is as good as a real elevator algorithm?
-- 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/
|  |