[<prev] [next>] [<thread-prev] [thread-next>] [day] [month] [year] [list]
Message-ID: <1488848390.3125.14.camel@sandisk.com>
Date: Tue, 7 Mar 2017 01:00:03 +0000
From: Bart Van Assche <Bart.VanAssche@...disk.com>
To: "tj@...nel.org" <tj@...nel.org>,
"paolo.valente@...aro.org" <paolo.valente@...aro.org>,
"axboe@...nel.dk" <axboe@...nel.dk>
CC: "ulf.hansson@...aro.org" <ulf.hansson@...aro.org>,
"linux-kernel@...r.kernel.org" <linux-kernel@...r.kernel.org>,
"fchecconi@...il.com" <fchecconi@...il.com>,
"avanzini.arianna@...il.com" <avanzini.arianna@...il.com>,
"linux-block@...r.kernel.org" <linux-block@...r.kernel.org>,
"linus.walleij@...aro.org" <linus.walleij@...aro.org>,
"broonie@...nel.org" <broonie@...nel.org>
Subject: Re: [PATCH RFC 00/14] Add the BFQ I/O Scheduler to blk-mq
On Sat, 2017-03-04 at 17:01 +0100, Paolo Valente wrote:
> Finally, a few details on the patchset.
>
> The first two patches introduce BFQ-v0, which is more or less the
> first version of BFQ submitted a few years ago [1]. The remaining
> patches turn progressively BFQ-v0 into BFQ-v8r8, the current version
> of BFQ.
Hello Paolo,
Thank you for having done the work to improve, test, fix and post the
BFQ scheduler as a patch series. However, from what I have seen in the
patches there is a large number of tunable constants in the code for
which no scientific approach exists to chose an optimal value.
Additionally, the complexity of the code is huge. Just like for CFQ,
sooner or later someone will run into a bug or a performance issue
and will post a patch to fix it. However, the complexity of BFQ is
such that a source code review alone won't be sufficient to verify
whether or not such a patch negatively affects a workload or device
that has not been tested by the author of the patch. This makes me
wonder what process should be followed to verify future BFQ patches?
Thanks,
Bart.
Powered by blists - more mailing lists