BFQ: simple elevator

[Mulyadi Santosa]

On 3/20/13, Raymond Jennings <shentino at gmail.com> wrote:
> I've been pondering making a very simple IO scheduler
>
> one step above noop, just keeps everything in a big heap sorted by
> position and a single cursor bouncing from head to tail shaving off
> requests in a loop of ascending and descending sweeps.

pardon me for any possible sillyness, but what happen if there are
incoming I/O operation at very nearby sectors (or perhaps at the same
sector?)? I suppose, the elevator will prioritize them first over the
rest? (i.e starving will happen...)

-- 
regards,

Mulyadi Santosa
Freelance Linux trainer and consultant

blog: the-hydra.blogspot.com
training: mulyaditraining.blogspot.com