Fix raid rebuild performance regression
Subsystems (2)
Jens Axboe
maintainercover Fix raid rebuild performance regression
Hi,
This should fix the reported RAID rebuild regression, while also providing better performance for other workloads particularly on rotating storage.
Signature · 1 line
Jens Axboe
Jens Axboe
maintainerPATCH 1/2 block: ensure plug merging checks the correct queue at least once
Song reports that a RAID rebuild workload runs much slower recently, and it is seeing a lot less merging than it did previously. The reason is that a previous commit reduced the amount of work we do for plug merging. RAID rebuild interleaves requests between disks, so a last-entry check in plug merging always misses a merge opportunity since we always find a different disk than what we are looking for.
Modify the logic such that it's still a one-hit cache, but ensure that we check enough to find the right target before giving up.
--- block/blk-merge.c | 20 ++++++++++++++------ 1 file changed, 14 insertions(+), 6 deletions(-)
block/blk-merge.c +14 -6
@@ -1087,12 +1087,20 @@ bool blk_attempt_plug_merge(struct request_queue *q, struct bio *bio,if (!plug ||rq_list_empty (plug->mq_list))return false; -/* check the previously added entry for a quick merge attempt */ - rq =rq_list_peek (&plug->mq_list); -if (rq->q == q) { -if (blk_attempt_bio_merge (q, rq, bio, nr_segs, false) == -BIO_MERGE_OK ) -return true; +rq_list_for_each (&plug->mq_list, rq) { +if (rq->q == q) { +if (blk_attempt_bio_merge (q, rq, bio, nr_segs, false) == +BIO_MERGE_OK ) +return true; +break ; + } + +/* +* Only keep iterating plug list for merges if we have multiple +* queues +*/ +if (!plug->multiple_queues) +break ; }return false; }
Signature · 1 line
2.35.1
Jens Axboe
maintainerPATCH 2/2 block: flush plug based on hardware and software queue order
In reply to Jens AxboeWe used to sort the plug list if we had multiple queues before dispatching requests to the IO scheduler. This usually isn't needed, but for certain workloads that interleave requests to disks, it's a less efficient to process the plug list one-by-one if everything is interleaved.
Don't sort the list, but skip through it and flush out entries that have the same target at the same time.
--- block/blk-mq.c | 59 ++++++++++++++++++++++++-------------------------- 1 file changed, 28 insertions(+), 31 deletions(-)
block/blk-mq.c +28 -31
@@ -2573,13 +2573,36 @@ static void __blk_mq_flush_plug_list(struct request_queue *q, q->mq_ops->queue_rqs (&plug->mq_list); } +static void blk_mq_dispatch_plug_list (struct blk_plug *plug,bool from_sched) +{ +struct blk_mq_hw_ctx *this_hctx =NULL ; +struct blk_mq_ctx *this_ctx =NULL ; +struct request *requeue_list =NULL ; +unsigned int depth =0 ; +LIST_HEAD (list); + +do { +struct request *rq =rq_list_pop (&plug->mq_list); + +if (!this_hctx) { + this_hctx = rq->mq_hctx; + this_ctx = rq->mq_ctx; + }else if (this_hctx != rq->mq_hctx || this_ctx != rq->mq_ctx) { +rq_list_add (&requeue_list, rq); +continue ; + } +list_add_tail (&rq->queuelist, &list); + depth++; + }while (!rq_list_empty (plug->mq_list)); + + plug->mq_list = requeue_list; +trace_block_unplug (this_hctx->queue, depth, !from_sched); +blk_mq_sched_insert_requests (this_hctx, this_ctx, &list, from_sched); +} +void blk_mq_flush_plug_list (struct blk_plug *plug,bool from_schedule) { -struct blk_mq_hw_ctx *this_hctx; -struct blk_mq_ctx *this_ctx;struct request *rq; -unsigned int depth; -LIST_HEAD (list);if (rq_list_empty (plug->mq_list))return ;
@@ -2615,35 +2638,9 @@ void blk_mq_flush_plug_list(struct blk_plug *plug, bool from_schedule)return ; } - this_hctx =NULL ; - this_ctx =NULL ; - depth =0 ;do { - rq =rq_list_pop (&plug->mq_list); - -if (!this_hctx) { - this_hctx = rq->mq_hctx; - this_ctx = rq->mq_ctx; - }else if (this_hctx != rq->mq_hctx || this_ctx != rq->mq_ctx) { -trace_block_unplug (this_hctx->queue, depth, - !from_schedule); -blk_mq_sched_insert_requests (this_hctx, this_ctx, - &list, from_schedule); - depth =0 ; - this_hctx = rq->mq_hctx; - this_ctx = rq->mq_ctx; - - } - -list_add (&rq->queuelist, &list); - depth++; +blk_mq_dispatch_plug_list (plug, from_schedule); }while (!rq_list_empty (plug->mq_list)); - -if (!list_empty (&list)) { -trace_block_unplug (this_hctx->queue, depth, !from_schedule); -blk_mq_sched_insert_requests (this_hctx, this_ctx, &list, - from_schedule); - } } void blk_mq_try_issue_list_directly(struct blk_mq_hw_ctx *hctx,
Signature · 1 line
2.35.1
Quoted 6 lines · Jens Axboe
Hi,
This should fix the reported RAID rebuild regression, while also providing better performance for other workloads particularly on rotating storage.
Thanks for the fix!
Hi, this is your Linux kernel regression tracker.
Quoted 4 lines · Jens Axboe
This should fix the reported RAID rebuild regression, while also providing better performance for other workloads particularly on rotating storage.
Nitpicking: From the list of CCed people it seems these patches are fixing this regression:
https://lore.kernel.org/linux-raid/[email protected]/
Then the patch descriptions for the two commits should include a link tag to the report, as per using lore.kernel.org/r/, as explained in 'Documentation/process/submitting-patches.rst' and 'Documentation/process/5.Posting.rst'. And the original reporters likely should be honored with a "Reported-by", too. The former would my regression tracking life a lot easier, as regzbot relies on those links that are useful for other purposes, too (as explained in the docs).
Ciao, Thorsten (wearing his 'the Linux kernel's regression tracker' hat)
P.S.: As the Linux kernel's regression tracker I'm getting a lot of reports on my table. I can only look briefly into most of them and lack knowledge about most of the areas they concern. I thus unfortunately will sometimes get things wrong or miss something important. I hope that's not the case here; if you think it is, don't hesitate to tell me in a public reply, it's in everyone's interest to set the public record straight.
#regzbot ^backmonitor:
https://lore.kernel.org/linux-raid/[email protected]/