Re: Disk scheduling policy (Re: NEW_BUFQ_STRATEGY)

* Jason Thorpe <[email protected]> [031201 14:00] wrote:
> 
> On Dec 1, 2003, at 12:07 PM, Thor Lancelot Simon wrote:
> 
> >| In 6.5.8, the queues are split. Doing this permits queuing delayed 
> >writes
> >| into one queue, while synchronous writes and reads are entered into 
> >another
> >| queue. In 6.5.8 the disk driver will alternate between queues. This 
> 
> This is a pretty cool, and fairly simple, algorithm.  I bet it could be 
> implemented as a back-end to the new bufq code pretty easily.

If you keep the bufs on two queues, a combined queue and seperate
queues you'll pay double the sorting cost, but only have to disrupt
the elevator algorithm when you reach a tuneable threshold.  In fact
you could keep a single queue and split it when the io becomes
too saturated as well by keeping counts of the mix in the single
queue.



-- 
- Alfred Perlstein
- Research Engineering Development Inc.
- email: [email protected] cell: 408-480-4684