lkml.org 
[lkml]   [2000]   [Sep]   [26]   [last100]   RSS Feed
Views: [wrap][no wrap]   [headers]  [forward] 
 
Messages in this thread
/
Date
From
SubjectRe: [patch] vmfixes-2.4.0-test9-B2
On Tue, Sep 26, 2000 at 10:00:12PM +0200, Peter Osterlund wrote:
> Therefore, no matter what algorithm you use in elevator_linus() the total
> number of seeks should be the same.

It isn't. There's a big difference between the two algorithms and all your
previous emails was completly correct about the "theorical" additional seeks
during starvation avoidance.

> an even better way to sort the requests. I think the important thing is
> trying to minimize the total amount of seek time. But doing that requires

The current algorithm only tries to minimize the total amount of seek time.
That's what the elevator reordering is there for.

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

\
 
 \ /
  Last update: 2005-03-22 12:38    [W:0.161 / U:0.252 seconds]
©2003-2018 Jasper Spaans|hosted at Digital Ocean and TransIP|Read the blog|Advertise on this site