| Message ID | 20180703083452.4909-1-ming.lei@redhat.com (mailing list archive) |
|---|---|
| State | New, archived |
| Headers | show |
On 7/3/18 2:34 AM, Ming Lei wrote: > It won't be efficient to dequeue request one by one from sw queue, > but we have to do that when queue is busy for better merge performance. > > This patch takes the Exponential Weighted Moving Average(EWMA) to figure > out if queue is busy, then only dequeue request one by one from sw queue > when queue is busy. I've started to come around to the approach, but can we add something that only triggers this busy tracking if we've even seen a BUSY condition? Basically, this: blk_mq_update_dispatch_busy(hctx, false); should be a no-op, if we've never called: blk_mq_update_dispatch_busy(hctx, true); Something ala the below, with the BLK_MQ_S_EWMA bit added, of course. static void __blk_mq_update_dispatch_busy(struct blk_mq_hw_ctx *hctx, bool busy) { unsigned int ewma = READ_ONCE(hctx->dispatch_busy); ewma *= BLK_MQ_DISPATCH_BUSY_EWMA_WEIGHT - 1; if (busy) ewma += 1 << BLK_MQ_DISPATCH_BUSY_EWMA_FACTOR; ewma /= BLK_MQ_DISPATCH_BUSY_EWMA_WEIGHT; WRITE_ONCE(hctx->dispatch_busy, ewma); } static void blk_mq_update_dispatch_busy(struct blk_mq_hw_ctx *hctx, bool busy) { if (hctx->queue->elevator) return; /* * If we've never seen a busy condition, don't do anything. */ if (!test_bit(BLK_MQ_S_EWMA_ENABLED, &hctx->state)) { if (!busy) return; set_bit(BLK_MQ_S_EWMA, &hctx->state); } __blk_mq_update_dispatch_busy(hctx, busy); }
On Tue, Jul 03, 2018 at 08:03:23AM -0600, Jens Axboe wrote: > On 7/3/18 2:34 AM, Ming Lei wrote: > > It won't be efficient to dequeue request one by one from sw queue, > > but we have to do that when queue is busy for better merge performance. > > > > This patch takes the Exponential Weighted Moving Average(EWMA) to figure > > out if queue is busy, then only dequeue request one by one from sw queue > > when queue is busy. > > I've started to come around to the approach, but can we add something > that only triggers this busy tracking if we've even seen a BUSY > condition? Basically, this: > > blk_mq_update_dispatch_busy(hctx, false); > > should be a no-op, if we've never called: > > blk_mq_update_dispatch_busy(hctx, true); > > Something ala the below, with the BLK_MQ_S_EWMA bit added, of course. > > static void __blk_mq_update_dispatch_busy(struct blk_mq_hw_ctx *hctx, bool busy) > { > unsigned int ewma = READ_ONCE(hctx->dispatch_busy); > > ewma *= BLK_MQ_DISPATCH_BUSY_EWMA_WEIGHT - 1; > if (busy) > ewma += 1 << BLK_MQ_DISPATCH_BUSY_EWMA_FACTOR; > ewma /= BLK_MQ_DISPATCH_BUSY_EWMA_WEIGHT; > > WRITE_ONCE(hctx->dispatch_busy, ewma); > } How about doing it in the following(simpler) way? By adding the check at the entry of __blk_mq_update_dispatch_busy(). if (!ewma && !busy) return; Thanks, Ming
On 7/3/18 8:11 AM, Ming Lei wrote: > On Tue, Jul 03, 2018 at 08:03:23AM -0600, Jens Axboe wrote: >> On 7/3/18 2:34 AM, Ming Lei wrote: >>> It won't be efficient to dequeue request one by one from sw queue, >>> but we have to do that when queue is busy for better merge performance. >>> >>> This patch takes the Exponential Weighted Moving Average(EWMA) to figure >>> out if queue is busy, then only dequeue request one by one from sw queue >>> when queue is busy. >> >> I've started to come around to the approach, but can we add something >> that only triggers this busy tracking if we've even seen a BUSY >> condition? Basically, this: >> >> blk_mq_update_dispatch_busy(hctx, false); >> >> should be a no-op, if we've never called: >> >> blk_mq_update_dispatch_busy(hctx, true); >> >> Something ala the below, with the BLK_MQ_S_EWMA bit added, of course. >> >> static void __blk_mq_update_dispatch_busy(struct blk_mq_hw_ctx *hctx, bool busy) >> { >> unsigned int ewma = READ_ONCE(hctx->dispatch_busy); >> >> ewma *= BLK_MQ_DISPATCH_BUSY_EWMA_WEIGHT - 1; >> if (busy) >> ewma += 1 << BLK_MQ_DISPATCH_BUSY_EWMA_FACTOR; >> ewma /= BLK_MQ_DISPATCH_BUSY_EWMA_WEIGHT; >> >> WRITE_ONCE(hctx->dispatch_busy, ewma); >> } > > How about doing it in the following(simpler) way? By adding the check > at the entry of __blk_mq_update_dispatch_busy(). > > if (!ewma && !busy) > return; That might be better indeed, though still would need the read once. The test_bit, for a constant bit, is basically free.
On Tue, Jul 03, 2018 at 08:13:45AM -0600, Jens Axboe wrote: > On 7/3/18 8:11 AM, Ming Lei wrote: > > On Tue, Jul 03, 2018 at 08:03:23AM -0600, Jens Axboe wrote: > >> On 7/3/18 2:34 AM, Ming Lei wrote: > >>> It won't be efficient to dequeue request one by one from sw queue, > >>> but we have to do that when queue is busy for better merge performance. > >>> > >>> This patch takes the Exponential Weighted Moving Average(EWMA) to figure > >>> out if queue is busy, then only dequeue request one by one from sw queue > >>> when queue is busy. > >> > >> I've started to come around to the approach, but can we add something > >> that only triggers this busy tracking if we've even seen a BUSY > >> condition? Basically, this: > >> > >> blk_mq_update_dispatch_busy(hctx, false); > >> > >> should be a no-op, if we've never called: > >> > >> blk_mq_update_dispatch_busy(hctx, true); > >> > >> Something ala the below, with the BLK_MQ_S_EWMA bit added, of course. > >> > >> static void __blk_mq_update_dispatch_busy(struct blk_mq_hw_ctx *hctx, bool busy) > >> { > >> unsigned int ewma = READ_ONCE(hctx->dispatch_busy); > >> > >> ewma *= BLK_MQ_DISPATCH_BUSY_EWMA_WEIGHT - 1; > >> if (busy) > >> ewma += 1 << BLK_MQ_DISPATCH_BUSY_EWMA_FACTOR; > >> ewma /= BLK_MQ_DISPATCH_BUSY_EWMA_WEIGHT; > >> > >> WRITE_ONCE(hctx->dispatch_busy, ewma); > >> } > > > > How about doing it in the following(simpler) way? By adding the check > > at the entry of __blk_mq_update_dispatch_busy(). > > > > if (!ewma && !busy) > > return; > > That might be better indeed, though still would need the read once. > The test_bit, for a constant bit, is basically free. We can remove both READ_ONCE() and WRITE_ONCE(), I used it just for document benefit since there is concurrent access on this shared variable, but looks smp_read_barrier_depends() is added to READ_ONCE() recently. Both the 32-bit read/write on hctx->dispatch_busy is atomic, meantime not see any problem can be caused if compiler optimization is involved on this read/write. So I will remove READ_ONCE()/WRITE_ONCE() in V5, and add the above check if you don't object. Thanks, Ming
On 7/3/18 8:34 AM, Ming Lei wrote: > On Tue, Jul 03, 2018 at 08:13:45AM -0600, Jens Axboe wrote: >> On 7/3/18 8:11 AM, Ming Lei wrote: >>> On Tue, Jul 03, 2018 at 08:03:23AM -0600, Jens Axboe wrote: >>>> On 7/3/18 2:34 AM, Ming Lei wrote: >>>>> It won't be efficient to dequeue request one by one from sw queue, >>>>> but we have to do that when queue is busy for better merge performance. >>>>> >>>>> This patch takes the Exponential Weighted Moving Average(EWMA) to figure >>>>> out if queue is busy, then only dequeue request one by one from sw queue >>>>> when queue is busy. >>>> >>>> I've started to come around to the approach, but can we add something >>>> that only triggers this busy tracking if we've even seen a BUSY >>>> condition? Basically, this: >>>> >>>> blk_mq_update_dispatch_busy(hctx, false); >>>> >>>> should be a no-op, if we've never called: >>>> >>>> blk_mq_update_dispatch_busy(hctx, true); >>>> >>>> Something ala the below, with the BLK_MQ_S_EWMA bit added, of course. >>>> >>>> static void __blk_mq_update_dispatch_busy(struct blk_mq_hw_ctx *hctx, bool busy) >>>> { >>>> unsigned int ewma = READ_ONCE(hctx->dispatch_busy); >>>> >>>> ewma *= BLK_MQ_DISPATCH_BUSY_EWMA_WEIGHT - 1; >>>> if (busy) >>>> ewma += 1 << BLK_MQ_DISPATCH_BUSY_EWMA_FACTOR; >>>> ewma /= BLK_MQ_DISPATCH_BUSY_EWMA_WEIGHT; >>>> >>>> WRITE_ONCE(hctx->dispatch_busy, ewma); >>>> } >>> >>> How about doing it in the following(simpler) way? By adding the check >>> at the entry of __blk_mq_update_dispatch_busy(). >>> >>> if (!ewma && !busy) >>> return; >> >> That might be better indeed, though still would need the read once. >> The test_bit, for a constant bit, is basically free. > > We can remove both READ_ONCE() and WRITE_ONCE(), I used it just for > document benefit since there is concurrent access on this shared variable, > but looks smp_read_barrier_depends() is added to READ_ONCE() recently. > > Both the 32-bit read/write on hctx->dispatch_busy is atomic, meantime > not see any problem can be caused if compiler optimization is involved > on this read/write. > > So I will remove READ_ONCE()/WRITE_ONCE() in V5, and add the above check > if you don't object. Yep, that sounds great to me.
diff --git a/block/blk-mq-debugfs.c b/block/blk-mq-debugfs.c index 1c4532e92938..dd87c274a6b8 100644 --- a/block/blk-mq-debugfs.c +++ b/block/blk-mq-debugfs.c @@ -637,6 +637,14 @@ static int hctx_active_show(void *data, struct seq_file *m) return 0; } +static int hctx_dispatch_busy_show(void *data, struct seq_file *m) +{ + struct blk_mq_hw_ctx *hctx = data; + + seq_printf(m, "%u\n", hctx->dispatch_busy); + return 0; +} + static void *ctx_rq_list_start(struct seq_file *m, loff_t *pos) __acquires(&ctx->lock) { @@ -798,6 +806,7 @@ static const struct blk_mq_debugfs_attr blk_mq_debugfs_hctx_attrs[] = { {"queued", 0600, hctx_queued_show, hctx_queued_write}, {"run", 0600, hctx_run_show, hctx_run_write}, {"active", 0400, hctx_active_show}, + {"dispatch_busy", 0400, hctx_dispatch_busy_show}, {}, }; diff --git a/block/blk-mq-sched.c b/block/blk-mq-sched.c index f5745acc2d98..7856dc5db0eb 100644 --- a/block/blk-mq-sched.c +++ b/block/blk-mq-sched.c @@ -219,15 +219,8 @@ void blk_mq_sched_dispatch_requests(struct blk_mq_hw_ctx *hctx) } } else if (has_sched_dispatch) { blk_mq_do_dispatch_sched(hctx); - } else if (q->mq_ops->get_budget) { - /* - * If we need to get budget before queuing request, we - * dequeue request one by one from sw queue for avoiding - * to mess up I/O merge when dispatch runs out of resource. - * - * TODO: get more budgets, and dequeue more requests in - * one time. - */ + } else if (READ_ONCE(hctx->dispatch_busy)) { + /* dequeue request one by one from sw queue if queue is busy */ blk_mq_do_dispatch_ctx(hctx); } else { blk_mq_flush_busy_ctxs(hctx, &rq_list); diff --git a/block/blk-mq.c b/block/blk-mq.c index 174637d09923..7b0bb437cf10 100644 --- a/block/blk-mq.c +++ b/block/blk-mq.c @@ -1073,6 +1073,32 @@ static bool blk_mq_mark_tag_wait(struct blk_mq_hw_ctx **hctx, return true; } +#define BLK_MQ_DISPATCH_BUSY_EWMA_WEIGHT 8 +#define BLK_MQ_DISPATCH_BUSY_EWMA_FACTOR 4 +/* + * Update dispatch busy with the Exponential Weighted Moving Average(EWMA): + * - EWMA is one simple way to compute running average value + * - weight(7/8 and 1/8) is applied so that it can decrease exponentially + * - take 4 as factor for avoiding to get too small(0) result, and this + * factor doesn't matter because EWMA decreases exponentially + */ +static void blk_mq_update_dispatch_busy(struct blk_mq_hw_ctx *hctx, bool busy) +{ + unsigned int ewma; + + if (hctx->queue->elevator) + return; + + ewma = READ_ONCE(hctx->dispatch_busy); + + ewma *= BLK_MQ_DISPATCH_BUSY_EWMA_WEIGHT - 1; + if (busy) + ewma += 1 << BLK_MQ_DISPATCH_BUSY_EWMA_FACTOR; + ewma /= BLK_MQ_DISPATCH_BUSY_EWMA_WEIGHT; + + WRITE_ONCE(hctx->dispatch_busy, ewma); +} + #define BLK_MQ_RESOURCE_DELAY 3 /* ms units */ /* @@ -1209,8 +1235,10 @@ bool blk_mq_dispatch_rq_list(struct request_queue *q, struct list_head *list, else if (needs_restart && (ret == BLK_STS_RESOURCE)) blk_mq_delay_run_hw_queue(hctx, BLK_MQ_RESOURCE_DELAY); + blk_mq_update_dispatch_busy(hctx, true); return false; - } + } else + blk_mq_update_dispatch_busy(hctx, false); /* * If the host/device is unable to accept more work, inform the diff --git a/include/linux/blk-mq.h b/include/linux/blk-mq.h index e3147eb74222..399e0a610ea3 100644 --- a/include/linux/blk-mq.h +++ b/include/linux/blk-mq.h @@ -35,9 +35,10 @@ struct blk_mq_hw_ctx { struct sbitmap ctx_map; struct blk_mq_ctx *dispatch_from; + unsigned int dispatch_busy; - struct blk_mq_ctx **ctxs; unsigned int nr_ctx; + struct blk_mq_ctx **ctxs; wait_queue_entry_t dispatch_wait; atomic_t wait_index;
It won't be efficient to dequeue request one by one from sw queue, but we have to do that when queue is busy for better merge performance. This patch takes the Exponential Weighted Moving Average(EWMA) to figure out if queue is busy, then only dequeue request one by one from sw queue when queue is busy. Fixes: b347689ffbca ("blk-mq-sched: improve dispatching from sw queue") Cc: Kashyap Desai <kashyap.desai@broadcom.com> Cc: Laurence Oberman <loberman@redhat.com> Cc: Omar Sandoval <osandov@fb.com> Cc: Christoph Hellwig <hch@lst.de> Cc: Bart Van Assche <bart.vanassche@wdc.com> Cc: Hannes Reinecke <hare@suse.de> Reported-by: Kashyap Desai <kashyap.desai@broadcom.com> Tested-by: Kashyap Desai <kashyap.desai@broadcom.com> Signed-off-by: Ming Lei <ming.lei@redhat.com> --- block/blk-mq-debugfs.c | 9 +++++++++ block/blk-mq-sched.c | 11 ++--------- block/blk-mq.c | 30 +++++++++++++++++++++++++++++- include/linux/blk-mq.h | 3 ++- 4 files changed, 42 insertions(+), 11 deletions(-)