BFQ: simple elevator

Raymond Jennings shentino at gmail.com
Wed Mar 20 11:54:23 EDT 2013


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.

Any gotchas I need to be aware of or can I simply fork off of deadline
and simplify it to omit batching?



More information about the Kernelnewbies mailing list