| From | (Alan Cox) | Subject | Re: elevator algorithm bug in ll_rw_blk.c | Date | Sun, 15 Nov 1998 17:40:52 +0000 (GMT) |
| |
> > that single IO request is complete, the driver then moves on to the > > *next* request in the queue. It doesn't start again at the > > beginning. So, we do correctly service the higher numbered requests > > before going back to the low ones. > > But that's a *one-way* elevator. Ideal elevators are two-way, aren't they?
If you go for the shortest movement alone you starve the edges of the disks. If you watch a real elevator you'll see they too use the elevator algorithm
- 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/
|