summaryrefslogtreecommitdiffstats
path: root/crypto/cast_common.c
diff options
context:
space:
mode:
authorArianna Avanzini <avanzini.arianna@gmail.com>2017-04-12 18:23:17 +0200
committerJens Axboe <axboe@fb.com>2017-04-19 08:30:26 -0600
commit1de0c4cd9ea65f99910ae0b77fce2cd1a8e5de01 (patch)
treede7568a1b6f30c53eb10016e98dae4d7233f5831 /crypto/cast_common.c
parent36eca894832351feed9072d0f97eb06fc9482ca4 (diff)
downloadlinux-1de0c4cd9ea65f99910ae0b77fce2cd1a8e5de01.tar.bz2
block, bfq: reduce idling only in symmetric scenarios
A seeky queue (i..e, a queue containing random requests) is assigned a very small device-idling slice, for throughput issues. Unfortunately, given the process associated with a seeky queue, this behavior causes the following problem: if the process, say P, performs sync I/O and has a higher weight than some other processes doing I/O and associated with non-seeky queues, then BFQ may fail to guarantee to P its reserved share of the throughput. The reason is that idling is key for providing service guarantees to processes doing sync I/O [1]. This commit addresses this issue by allowing the device-idling slice to be reduced for a seeky queue only if the scenario happens to be symmetric, i.e., if all the queues are to receive the same share of the throughput. [1] P. Valente, A. Avanzini, "Evolution of the BFQ Storage I/O Scheduler", Proceedings of the First Workshop on Mobile System Technologies (MST-2015), May 2015. http://algogroup.unimore.it/people/paolo/disk_sched/mst-2015.pdf Signed-off-by: Arianna Avanzini <avanzini.arianna@gmail.com> Signed-off-by: Riccardo Pizzetti <riccardo.pizzetti@gmail.com> Signed-off-by: Samuele Zecchini <samuele.zecchini92@gmail.com> Signed-off-by: Paolo Valente <paolo.valente@linaro.org> Signed-off-by: Jens Axboe <axboe@fb.com>
Diffstat (limited to 'crypto/cast_common.c')
0 files changed, 0 insertions, 0 deletions