Messages in this thread | | | Date | Fri, 19 Mar 1999 13:22:11 +0100 (CET) | From | Rik van Riel <> | Subject | Re: disk head scheduling |
| |
On Fri, 19 Mar 1999, Mark H. Wood wrote: > On Fri, 19 Mar 1999, Ingo Molnar wrote: > > On Thu, 18 Mar 1999, Yasushi Saito wrote: > > > What I tried to implement was two-way elevator seeking (SCAN). In my > > > > the bigger problem is that dumber devices will just execute non-forwards > > ordered requests. Most modern harddisks will either cache a full track, or > > Well of course a 2-way elevator should sort by *ascending* sector within > descending track. I take it this is difficult?
Modern devices never give you the physical layout of the disk, so yes, it is extremely difficult, if not impossible...
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/
| |