Re: [PATCH V3 00/11] block-throttle: add .high limit
From: Tejun Heo
Date: Wed Oct 05 2016 - 10:49:56 EST
On Wed, Oct 05, 2016 at 02:37:00PM +0200, Paolo Valente wrote:
> In this respect, for your generic, unpredictable scenario to make
> sense, there must exist at least one real system that meets the
> requirements of such a scenario. Or, if such a real system does not
> yet exist, it must be possible to emulate it. If it is impossible to
> achieve this last goal either, then I miss the usefulness
> of looking for solutions for such a scenario.
> That said, let's define the instance(s) of the scenario that you find
> most representative, and let's test BFQ on it/them. Numbers will give
> us the answers. For example, what about all or part of the following
> . one cyclically doing random I/O for some second and then sequential I/O
> for the next seconds
> . one doing, say, quasi-sequential I/O in ON/OFF cycles
> . one starting an application cyclically
> . one playing back or streaming a movie
> For each group, we could then measure the time needed to complete each
> phase of I/O in each cycle, plus the responsiveness in the group
> starting an application, plus the frame drop in the group streaming
> the movie. In addition, we can measure the bandwidth/iops enjoyed by
> each group, plus, of course, the aggregate throughput of the whole
> system. In particular we could compare results with throttling, BFQ,
> and CFQ.
> Then we could write resulting numbers on the stone, and stick to them
> until something proves them wrong.
> What do you (or others) think about it?
That sounds great and yeah it's lame that we didn't start with that.
Shaohua, would it be difficult to compare how bfq performs against