> > From: MOLNAR Ingo <mingo@chiara.csoma.elte.hu>
> > Date: Thu, 12 Nov 1998 03:39:28 +0100 (CET)
> > Subject: [patch] Re: elevator algorithm bug in ll_rw_blk.c
> >
> > On Wed, 11 Nov 1998, Philip Gladstone wrote:
> >
> > > I.e. if you have a queue: 10 20 5 and you insert 25, then
> > > you should get 10 20 25 5 and not 10 20 5 25 as currently.
> >
> > nicely spotted ... unless i'm missing something, this was probably one of
> > the oldest Linux bugs :)
>
> I vaguely recall reading in some operating system book that this is modified version of the elevator algorithm
> meant increase fairness. Otherwise, the access to block 5 might be delayed a *long* time if lots of high-value
> blocks are requested.
But it will never be starved. I do not have hard figures, but I'd
make an educated guess that the modification Philip proposed will
be beneficial more often than not.
-
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/