summaryrefslogtreecommitdiff
path: root/crypto/geniv.c
diff options
context:
space:
mode:
authorDavide Zini <davidezini2@gmail.com>2023-01-03 17:55:03 +0300
committerJens Axboe <axboe@kernel.dk>2023-01-30 01:18:33 +0300
commit1bd43e19de1b99179b9beb92b14697e113326d00 (patch)
tree0cecc0987d120351aef71e6aba24d47299f9b8ac /crypto/geniv.c
parent2d31c684a053b46f75b230899d00c0f56708243d (diff)
downloadlinux-1bd43e19de1b99179b9beb92b14697e113326d00.tar.xz
block, bfq: balance I/O injection among underutilized actuators
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. Reviewed-by: Damien Le Moal <damien.lemoal@opensource.wdc.com> Signed-off-by: Paolo Valente <paolo.valente@linaro.org> Signed-off-by: Davide Zini <davidezini2@gmail.com> Link: https://lore.kernel.org/r/20230103145503.71712-9-paolo.valente@linaro.org Signed-off-by: Jens Axboe <axboe@kernel.dk>
Diffstat (limited to 'crypto/geniv.c')
0 files changed, 0 insertions, 0 deletions