Re: [PATCH V6 8/8] block, bfq: balance I/O injection among underutilized actuators

[Paolo Valente]

> Il giorno 10 nov 2022, alle ore 16:25, Arie van der Hoeven <arie.vanderhoeven@xxxxxxxxxxx> ha scritto:
> 
> Checking in on this series and what we can communicate to partners as to potential integration into Linux.  Is 6.1 viable?

Hi Arie,
definitely too late for 6.1.

Jens, could you enqueue this for 6.2?  Unless Damien, or anybody else
still sees issues to address.

Thanks,
Paolo

> 
> We have at least one big partner whose launch schedule is gated on these changes.
> 
> Regards,  --Arie
> 
> 
> From: Paolo Valente <paolo.valente@xxxxxxxxxx>
> Sent: Thursday, November 3, 2022 9:26 AM
> To: Jens Axboe <axboe@xxxxxxxxx>
> Cc: linux-block@xxxxxxxxxxxxxxx <linux-block@xxxxxxxxxxxxxxx>; linux-kernel@xxxxxxxxxxxxxxx <linux-kernel@xxxxxxxxxxxxxxx>; Arie van der Hoeven <arie.vanderhoeven@xxxxxxxxxxx>; Rory Chen <rory.c.chen@xxxxxxxxxxx>; Davide Zini <davidezini2@xxxxxxxxx>; Paolo Valente <paolo.valente@xxxxxxxxxx>
> Subject: [PATCH V6 8/8] block, bfq: balance I/O injection among underutilized actuators
> 
> 
> This message has originated from an External Source. Please use proper judgment and caution when opening attachments, clicking links, or responding to this email.
> 
> 
> From: Davide Zini <davidezini2@xxxxxxxxx>
> 
> Upon the invocation of its dispatch function, BFQ returns the next I/O
> request of the in-service bfq_queue, unless some exception holds. One
> such exception is that there is some underutilized actuator, different
> from the actuator for which the in-service queue contains I/O, and
> that some other bfq_queue happens to contain I/O for such an
> actuator. In this case, the next I/O request of the latter bfq_queue,
> and not of the in-service bfq_queue, is returned (I/O is injected from
> that bfq_queue). To find such an actuator, a linear scan, in
> increasing index order, is performed among actuators.
> 
> Performing a linear scan entails a prioritization among actuators: an
> underutilized actuator may be considered for injection only if all
> actuators with a lower index are currently fully utilized, or if there
> is no pending I/O for any lower-index actuator that happens to be
> underutilized.
> 
> This commits breaks this prioritization and tends to distribute
> injection uniformly across actuators. This is obtained by adding the
> following condition to the linear scan: even if an actuator A is
> underutilized, A is however skipped if its load is higher than that of
> the next actuator.
> 
> Signed-off-by: Paolo Valente <paolo.valente@xxxxxxxxxx>
> Signed-off-by: Davide Zini <davidezini2@xxxxxxxxx>
> ---
> block/bfq-iosched.c | 18 +++++++++++++-----
> 1 file changed, 13 insertions(+), 5 deletions(-)
> 
> diff --git a/block/bfq-iosched.c b/block/bfq-iosched.c
> index db91f1a651d3..c568a5a112a7 100644
> --- a/block/bfq-iosched.c
> +++ b/block/bfq-iosched.c
> @@ -4813,10 +4813,16 @@ bfq_find_active_bfqq_for_actuator(struct bfq_data *bfqd,
> 
> /*
>  * Perform a linear scan of each actuator, until an actuator is found
> - * for which the following two conditions hold: the load of the
> - * actuator is below the threshold (see comments on actuator_load_threshold
> - * for details), and there is a queue that contains I/O for that
> - * actuator. On success, return that queue.
> + * for which the following three conditions hold: the load of the
> + * actuator is below the threshold (see comments on
> + * actuator_load_threshold for details) and lower than that of the
> + * next actuator (comments on this extra condition below), and there
> + * is a queue that contains I/O for that actuator. On success, return
> + * that queue.
> + *
> + * Performing a plain linear scan entails a prioritization among
> + * actuators. The extra condition above breaks this prioritization and
> + * tends to distribute injection uniformly across actuators.
>  */
> static struct bfq_queue *
> bfq_find_bfqq_for_underused_actuator(struct bfq_data *bfqd)
> @@ -4824,7 +4830,9 @@ bfq_find_bfqq_for_underused_actuator(struct bfq_data *bfqd)
>        int i;
> 
>        for (i = 0 ; i < bfqd->num_actuators; i++)
> -               if (bfqd->rq_in_driver[i] < bfqd->actuator_load_threshold) {
> +               if (bfqd->rq_in_driver[i] < bfqd->actuator_load_threshold &&
> +                   (i == bfqd->num_actuators - 1 ||
> +                    bfqd->rq_in_driver[i] < bfqd->rq_in_driver[i+1])) {
>                        struct bfq_queue *bfqq =
>                                bfq_find_active_bfqq_for_actuator(bfqd, i);
> 
> --
> 2.20.1
> 
> Seagate Internal