[lkml]   [2000]   [Sep]   [19]   [last100]   RSS Feed
Views: [wrap][no wrap]   [headers]  [forward] 
Messages in this thread
SubjectRe: An elevator algorithm
Jens Axboe <> writes:

> > modification Peter suggested there can be more and we should track the one
> > more on the back of the queue. I don't think it's worthwhile.
> Agree, I don't think the added complexity would be worth it.

So that leaves two choices:

1. Perfect elevator (CSCAN) without the O(1) optimization. (My second
2. Suboptimal elevator with the O(1) optimization. (Andrea's suggested
modification to my second patch.)

Since the request queue can not be very long, minimizing disk head
movements ought to be more important than saving a few CPU cycles, so
I vote for the first alternative.

Peter Österlund Email:
Sköndalsvägen 35
S-128 66 Sköndal Home page:
Sweden Phone: +46 8 942647

To unsubscribe from this list: send the line "unsubscribe linux-kernel" in
the body of a message to
Please read the FAQ at

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