lkml.org 
[lkml]   [1999]   [Mar]   [18]   [last100]   RSS Feed
Views: [wrap][no wrap]   [headers]  [forward] 
 
Messages in this thread
/
Date
From
SubjectRe: disk head scheduling
On Thu, 18 Mar 1999, Arvind Sankar wrote:
> On Thu, Mar 18, 1999 at 10:52:44PM +0100, Ingo Molnar wrote:
> > On Thu, 18 Mar 1999, Arvind Sankar wrote:
> >
> > the sorting (the elevator algorithm) is per-device. The queue is
> > technically one queue, but thats just an implementation matter. (and of
> > course it matters in the case when we hit the queue length limit)
>
> ah. But it is per major-device linking. It would be nice to have per physical
> device linking, then we could do a two-way elevator algorithm.

A two-way elevator? We don't need/want that. For one, a
full seek only takes as long as some 5 t-t-t seeks.
Secondly, just how do you plan on letting the disk spin
backwards?

Rik -- Open Source: you deserve to be in control of your data.
+-------------------------------------------------------------------+
| Linux Memory Management site: http://humbolt.geo.uu.nl/Linux-MM/ |
| Nederlandse Linux documentatie: http://www.nl.linux.org/ |
+-------------------------------------------------------------------+

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

\
 
 \ /
  Last update: 2005-03-22 13:50    [from the cache]
©2003-2011 Jasper Spaans