[PATCH 01/10] Documentation
fchecconi at gmail.com
Tue Mar 24 12:04:16 PDT 2009
> From: Vivek Goyal <vgoyal at redhat.com>
> Date: Tue, Mar 24, 2009 02:35:32PM -0400
> On Tue, Mar 24, 2009 at 07:41:01PM +0100, Fabio Checconi wrote:
> > > From: Vivek Goyal <vgoyal at redhat.com>
> > > Date: Tue, Mar 24, 2009 02:29:06PM -0400
> > >
> > ...
> > > > Does keeping the sync queue in ready tree solves the problem too? Is
> > > > it because it avoid a virtual time jump?
> > > >
> > >
> > > I have not tried the second approch yet. But that also should solve the
> > > vtime jump issue.
> > >
> > Do you mean that you intend to keep a queue with no backlog in the
> > active tree?
> Yes. Is it possible to keep a not-backlogged queue in the tree for later
> expiry. So that we don't actively wait/idle for next request to come and
> hope queue will become backlogged soon. Otherwise, it will be deleted from
> the active queue. This is just a thought, I am not even sure how would it
> interefere with bfq code.
> All this to solve the vtime jump issue for sync queues.
Of course it is possible, but if you stick with wf2q+ the virtual time
will jump anyway, and the gain would be that each scheduling decision
will have O(N logN) complexity instead of O(log N), to skip empty
Otherwise, if you'll do your own timestamping (where any new request
can get a timestamp smaller that the virtual time) then nothing from
the theory BFQ was based on can give any hint on the guarantees that
the resulting algorithm can provide.
More information about the Containers