summaryrefslogtreecommitdiffstats
path: root/block/blk-sysfs.c
diff options
context:
space:
mode:
authorPaolo Valente2017-04-19 16:48:24 +0200
committerJens Axboe2017-04-19 16:48:24 +0200
commitea25da48086d3bbebf3a2eeff387ea00ed96f5c4 (patch)
tree1e7858910a647ae1a174ad019304bc3ffc2b5926 /block/blk-sysfs.c
parentblock, bfq: remove all get and put of I/O contexts (diff)
downloadkernel-qcow2-linux-ea25da48086d3bbebf3a2eeff387ea00ed96f5c4.tar.gz
kernel-qcow2-linux-ea25da48086d3bbebf3a2eeff387ea00ed96f5c4.tar.xz
kernel-qcow2-linux-ea25da48086d3bbebf3a2eeff387ea00ed96f5c4.zip
block, bfq: split bfq-iosched.c into multiple source files
The BFQ I/O scheduler features an optimal fair-queuing (proportional-share) scheduling algorithm, enriched with several mechanisms to boost throughput and reduce latency for interactive and real-time applications. This makes BFQ a large and complex piece of code. This commit addresses this issue by splitting BFQ into three main, independent components, and by moving each component into a separate source file: 1. Main algorithm: handles the interaction with the kernel, and decides which requests to dispatch; it uses the following two further components to achieve its goals. 2. Scheduling engine (Hierarchical B-WF2Q+ scheduling algorithm): computes the schedule, using weights and budgets provided by the above component. 3. cgroups support: handles group operations (creation, destruction, move, ...). Signed-off-by: Paolo Valente <paolo.valente@linaro.org> Signed-off-by: Jens Axboe <axboe@fb.com>
Diffstat (limited to 'block/blk-sysfs.c')
0 files changed, 0 insertions, 0 deletions