On 08/13/2014 08:23 AM, Benoît Canet wrote: > The throttle group support use a cooperative round robin scheduling algorithm. > > The principle of the algorithm are simple:
s/are/is/ > - Each BDS of the group is used as a token in a circular way. > - The active BDS compute if a wait must be done and arm the right timer. s/compute/computes/ s/arm/arms/ > - If a wait must be done the token timer will be armed so the token will > become > the next active BDS. > > Signed-off-by: Benoit Canet <benoit.ca...@nodalink.com> > --- > +++ b/qapi/block-core.json > @@ -886,6 +886,9 @@ > # > # @iops_size: #optional an I/O size in bytes (Since 1.7) > # > +# > +# @group: #optional throttle group name (Since 2.2) Extra blank comment line. Interface seems okay; I haven't looked closely at the code. -- Eric Blake eblake redhat com +1-919-301-3266 Libvirt virtualization library http://libvirt.org
signature.asc
Description: OpenPGP digital signature
