MQ-Deadline Scheduler Optimized For Much Better Scalability

Written by Michael Larabel in Linux Storage on 19 January 2024 at 04:48 PM EST. 16 Comments
LINUX STORAGE
Days after delivering a nice boost to Linux I/O performance, Linux storage expert Jens Axboe has tackled another storage-related bottleneck within the kernel.

Poor scalability out of the multi-queue deadline I/O scheduler (mq-deadline) has long been known but Axboe has stepped up to address this poor spot for Linux.

Jens Axboe has overcome the significant locking contention within MQ-Deadline by serializing the dispatch of requests and serializing the request insertion. As a result he's seeing much lower locking contention on both a null block device and an NVMe drive with many hardware queues. With his patches he's seeing up to a 106~112% improvement over the current MQ-Deadline performance.

MQ-Deadline optimization results


The work was posted yesterday as a "request for comments" for kernel developers. Those using the MQ-Deadline I/O scheduler and wanting to learn more or test out the two patches can see this linux-block thread for the details.
Related News
About The Author
Michael Larabel

Michael Larabel is the principal author of Phoronix.com and founded the site in 2004 with a focus on enriching the Linux hardware experience. Michael has written more than 20,000 articles covering the state of Linux hardware support, Linux performance, graphics drivers, and other topics. Michael is also the lead developer of the Phoronix Test Suite, Phoromatic, and OpenBenchmarking.org automated benchmarking software. He can be followed via Twitter, LinkedIn, or contacted via MichaelLarabel.com.

Popular News This Week