From: Tao Cui <cui.tao@linux.dev>
To: tj@kernel.org, josef@toxicopanda.com, axboe@kernel.dk,
ameryhung@gmail.com
Cc: cui.tao@linux.dev, cgroups@vger.kernel.org,
linux-block@vger.kernel.org, linux-kernel@vger.kernel.org,
bpf@vger.kernel.org, andrii@kernel.org, eddyz87@gmail.com,
ast@kernel.org, daniel@iogearbox.net,
linux-kselftest@vger.kernel.org, cuitao@kylinos.cn
Subject: Re: [RFC PATCH v5 0/5] blk-iocost: BPF struct_ops cost model
Date: Fri, 18 Sep 2026 13:48:31 +0800 [thread overview]
Message-ID: <a314cf09-c9c8-4ac2-9721-04ba19f4b857@linux.dev> (raw)
In-Reply-To: <20260918031751.1255420-1-cui.tao@linux.dev>
Hi,
在 2026/9/18 11:17, Tao Cui 写道:
> From: Tao Cui <cuitao@kylinos.cn>
>
> This is v5 of the RFC. The changes since v4 are listed in the
> changelog at the bottom.
>
Please ignore that change in v5; v6 is authoritative and
removes the extra put.
It was based on a bad measurement: a SIGKILLed loader never
unregistered its model, and the leftover reference was mistaken for
a racing-writers leak. The single iocost_bpf_model_put(old) was
already balanced.
v6 will follow shortly.
Thanks,
Tao
> Why a pluggable model at all
> ----------------------------
>
> When iocost landed in 2019, its commit message already promised that
> "a later patch will also allow using bpf progs for cost models", and
> the code has carried the split for it ever since: calc_vtime_cost()
> is a dispatcher whose only implementation is calc_vtime_cost_builtin().
> Seven years later the builtin linear model is still the only one.
> This series fills that slot, following the TCP congestion control
> model registration pattern: builtin algorithms remain the default
> while new ones can be prototyped in BPF.
>
> The measured problems
> ---------------------
>
> The builtin model prices each IO with a binary sequential/random base
> picked by a single per-cgroup cursor and a 16MB seek threshold, plus
> a per-page cost. On a virtio-blk device with the HDD autop profile,
> a 4k IO costs ~24us when judged sequential and ~2.7ms when judged
> random, a 112x spread, so a wrong judgement becomes a wrong price.
> Three classes of mispricing, all measured:
>
> 1. Heuristic rigidity. Two legitimate sequential readers in one
> cgroup (a database with multiple tablespaces, a threaded backup)
> ping-pong the single cursor and are all priced random: a
> measured 89x overcharge collapses throughput under the same
> weight. Random IO within a hot window smaller than the 16MB
> threshold is priced sequential: measured 107x undercharge, an
> accounting escape for hotspot workloads. No setting of the six
> builtin parameters seems able to fix this: telling the streams
> apart requires per-IO state tracking, which looks like logic
> rather than coefficients.
>
> 2. Device nonlinearity. SLC-cache phases, SMR band placement and
> shared controllers (multiple NVMe namespaces multiplexing one
> device) make the real cost of an identical IO vary by an order
> of magnitude over time or across namespaces. A static
> 6-parameter linear model has no way to express that.
>
> 3. Unpriced operations. Flush and zone append fall through to a
> cost of zero and bypass throttling entirely, and the same pattern
> extends to device quirks the builtin model was never taught.
>
> Mispricing feeds directly into the control loop: vtime budgets,
> surplus donation and the vrate feedback all consume the model's
> output, so a wrong model can skew the whole controller.
>
> How
> ---
>
> A bound BPF model fully owns pricing for every IO on the device:
> it is called from the bio charging path and prices every operation
> including flushes. The completion-time request sizing for the
> latency met/missed accounting still uses the builtin coefficients
> (the request's bio, and with it the issuing cgroup, is gone by then);
> extending the model there is left open by this interface. The builtin
> cursor is not exposed; a model is expected to track its own stream
> state. Model state keyed by the blkcg alone is shared across every
> device the model is bound to, unlike the builtin cursor which is
> per (cgroup, device).
>
> u64 calc_cost(u64 opf, u64 nbytes, sector_t sector,
> struct blkcg *blkcg, u64 model_flags)
>
> opf is the full bio->bi_opf (the operation must be extracted with a
> mask, and the REQ_* flag bits, including PREFLUSH/FUA, are part of
> it); model_flags carries iocost-specific metadata which is not part
> of the bio operation flags, such as whether the cost calculation
> is for a merged request; the return value is vtime, clamped to 1
> second of device time per IO. blkcg is passed so the model can key
> per-cgroup state; state stored in BPF_MAP_TYPE_CGRP_STORAGE
> follows the cgroup lifetime, and optional blkcg_online()/
> blkcg_offline() callbacks mirror the css lifecycle for models
> which want eager setup or teardown.
>
> The registration and binding model follows the TCP congestion
> control model registration pattern: registering a struct_ops makes
> the model available by its name, while io.cost.model binds one
> registered model to a device with "model=<name>" and restores the
> builtin model with "model=linear". Unregistering a model removes
> it from the registry so it can no longer be selected by name;
> devices already using the model keep using it until they are
> switched back to the builtin model, at which point the reference
> is released. A model which does not implement calc_cost is
> rejected at load. Sleepable models are rejected at verification,
> since calc_cost() runs under RCU read lock. Patch overview:
>
> 1/5: the BPF struct_ops cost model support: Kconfig, ops
> definition, name registry, registration, io.cost.model
> binding, unified dispatch and verifier checks
> 2/5: selftest with the 2x example model (the full builtin linear
> HDD formula at double cost) plus a runner and the selftest
> kernel config entries
> 3/5: add an iocost_ioc_tick tracepoint emitting the per-period
> controller state, so model quality can be evaluated without
> drgn (existing events are state-change driven and silent in
> steady state)
> 4/5: a second example model which replaces the single-cursor
> sequentiality heuristic with per-cgroup multi-stream detection
> keyed by the cgroup, the first consumer of the state interface
> 5/5: document the model=<name> binding in cgroup-v2.rst
>
> Does it work
> ------------
>
> Mechanism, verified functionally (QEMU, virtio-blk with the HDD
> profile, sequential-read workload from a 1%-weight cgroup, builtin
> vs the 2x example model):
>
> - per-IO charge: 2882us -> 5722us, a factor of 1.985x; the
> completed IO count halves and total cost.usage is conserved,
> i.e. the model output drives both charging and budgeting
> - edge cases: binding an unknown model name fails with ENOENT
> and nothing is applied; unregistering a bound model leaves the
> device correctly priced (2x) until it is switched back; the
> readback shows the bound model name; the selftest runner
> checks the write error and errno of every step, including the
> restoration
>
> Workload-shape verification added in this revision (same setup,
> 4k IOs at weight 1000, builtin vs the 2x example model):
>
> - flush-heavy workload (read/write/fsync alternating): priced
> 1.99x the builtin, i.e. flushes no longer reset the cursor
> and misjudge the following IO as random
> - non-page-multiple IO (6 KiB): priced ~2x, matching the
> builtin's truncating page count
> - first IO from a high LBA (past 16 MiB): priced 2.01x, i.e.
> a fresh cgroup's zero cursor no longer misjudges the first IO
> as random
>
> Payoff, demonstrated with the multi-stream example model (4/5) on
> the same setup, 4k IOs at weight 1000, builtin vs the model:
>
> - two sequential readers in one cgroup: priced 1961us/op by builtin
> (both judged random by the single cursor) and 23us/op by the
> model (each stream keeps its own slot); the completed IO count
> rises by two orders of magnitude
> - random IO inside an 8M window: priced 24us/op by builtin
> (undercharge, an accounting escape) and 2607us/op by the model
> - single-stream sequential and whole-disk random pricing are
> unchanged, so the model fixes both directions of mispricing
> without introducing a new one
>
> Non-interference, measured on enterprise NVMe: no measurable
> overhead when the BPF model is not attached.
>
> Changes in v5 (fixes from the v4 review):
> - a model which is unregistered but still bound to a device keeps
> working by name for io.cost.model writes until the last device
> unbinds: a coefficient-only write on such a device used to fail
> with ENOENT because the name lookup only searched the registry
> - the notify-list detach condition in iocost_bpf_model_put() is
> corrected for a registered model bound to several devices: the
> first unbind no longer removes the model from the lifecycle list
> while other devices are still bound, which also leaked the BPF map
> reference of the remaining bindings
> - the 2x example model advances its cursor for merged bios too,
> matching the builtin backmerge behaviour, so a long merged stream
> no longer drifts past the 16MB seek threshold and misprices the
> following IO as random
> - a concurrent-write leak is fixed: two racing io.cost.model writes
> resolving the same model each took a reference on it, but the write
> whose commit found the model already bound (old == new) did not drop
> one, leaking a map reference; that path now puts the redundant
> reference
> - the cgroup-v2 documentation covers the BPF readback: the
> nested-key table lists "bpf" as a ctrl value and a bound model name
> as a model value, and the text notes that writing "ctrl=bpf" is
> accepted so a saved configuration can be restored as-is
> - multi-line comments use the opening marker on its own line
>
> Link: https://lore.kernel.org/r/20260908100143.47598-1-cui.tao@linux.dev # v1
> Link: https://lore.kernel.org/r/20260910125817.223354-1-cui.tao@linux.dev # v2
> Link: https://lore.kernel.org/r/20260914073356.791518-1-cui.tao@linux.dev # v3
> Link: https://lore.kernel.org/r/20260916072302.1068871-1-cui.tao@linux.dev # v4
>
> Tao Cui (5):
> blk-iocost: add BPF struct_ops cost model support
> selftests/bpf: add iocost cost model test
> blk-iocost: add iocost_ioc_tick tracepoint for per-period device
> summary
> selftests/bpf: add multi-stream sequentiality example model
> docs: cgroup-v2: document io.cost model=<name> binding
>
> Documentation/admin-guide/cgroup-v2.rst | 19 +
> block/Kconfig | 9 +
> block/Makefile | 1 +
> block/blk-cgroup.c | 4 +
> block/blk-iocost-bpf.c | 321 ++++++++++++++++++
> block/blk-iocost.c | 228 +++++++++++++--
> include/linux/blk-iocost.h | 86 +++++
> include/trace/events/iocost.h | 45 +++
> tools/testing/selftests/bpf/config | 2 +
> .../selftests/bpf/prog_tests/iocost_model.c | 200 ++++++++++++
> .../selftests/bpf/progs/iocost_model.c | 135 ++++++++
> tools/testing/selftests/bpf/progs/iocost_ms.c | 156 +++++++++
> 12 files changed, 1198 insertions(+), 19 deletions(-)
> create mode 100644 block/blk-iocost-bpf.c
> create mode 100644 include/linux/blk-iocost.h
> create mode 100644 tools/testing/selftests/bpf/prog_tests/iocost_model.c
> create mode 100644 tools/testing/selftests/bpf/progs/iocost_model.c
> create mode 100644 tools/testing/selftests/bpf/progs/iocost_ms.c
>
prev parent reply other threads:[~2026-09-18 5:48 UTC|newest]
Thread overview: 10+ messages / expand[flat|nested] mbox.gz Atom feed top
2026-09-18 3:17 [RFC PATCH v5 0/5] blk-iocost: BPF struct_ops cost model Tao Cui
2026-09-18 3:17 ` [RFC PATCH v5 1/5] blk-iocost: add BPF struct_ops cost model support Tao Cui
2026-09-18 3:29 ` sashiko-bot
2026-09-18 15:43 ` Alexei Starovoitov
2026-09-19 7:34 ` Tao Cui
2026-09-18 3:17 ` [RFC PATCH v5 2/5] selftests/bpf: add iocost cost model test Tao Cui
2026-09-18 3:17 ` [RFC PATCH v5 3/5] blk-iocost: add iocost_ioc_tick tracepoint for per-period device summary Tao Cui
2026-09-18 3:17 ` [RFC PATCH v5 4/5] selftests/bpf: add multi-stream sequentiality example model Tao Cui
2026-09-18 3:17 ` [RFC PATCH v5 5/5] docs: cgroup-v2: document io.cost model=<name> binding Tao Cui
2026-09-18 5:48 ` Tao Cui [this message]
Reply instructions:
You may reply publicly to this message via plain-text email
using any one of the following methods:
* Save the following mbox file, import it into your mail client,
and reply-to-all from there: mbox
Avoid top-posting and favor interleaved quoting:
https://en.wikipedia.org/wiki/Posting_style#Interleaved_style
* Reply using the --to, --cc, and --in-reply-to
switches of git-send-email(1):
git send-email \
--in-reply-to=a314cf09-c9c8-4ac2-9721-04ba19f4b857@linux.dev \
--to=cui.tao@linux.dev \
--cc=ameryhung@gmail.com \
--cc=andrii@kernel.org \
--cc=ast@kernel.org \
--cc=axboe@kernel.dk \
--cc=bpf@vger.kernel.org \
--cc=cgroups@vger.kernel.org \
--cc=cuitao@kylinos.cn \
--cc=daniel@iogearbox.net \
--cc=eddyz87@gmail.com \
--cc=josef@toxicopanda.com \
--cc=linux-block@vger.kernel.org \
--cc=linux-kernel@vger.kernel.org \
--cc=linux-kselftest@vger.kernel.org \
--cc=tj@kernel.org \
/path/to/YOUR_REPLY
https://kernel.org/pub/software/scm/git/docs/git-send-email.html
* If your mail client supports setting the In-Reply-To header
via mailto: links, try the mailto: link
Be sure your reply has a Subject: header at the top and a blank line
before the message body.
This is an external index of several public inboxes,
see mirroring instructions on how to clone and mirror
all data and code used by this external index.