diff options
| author | Uladzislau Rezki (Sony) <urezki@gmail.com> | 2024-01-02 19:46:29 +0100 |
|---|---|---|
| committer | Andrew Morton <akpm@linux-foundation.org> | 2024-01-31 01:33:23 -0800 |
| commit | 7db166b4aa0d930d041ae9ff1ad1f706c608449e (patch) | |
| tree | 6a54c1f7f3ad8c8ac7dd4120a0c86d6737b59409 /mm/shrinker.c | |
| parent | 431c0b3265072b7c8258abb137a154a15d5c1aab (diff) | |
| download | linux-7db166b4aa0d.tar.gz | |
mm: vmalloc: offload free_vmap_area_lock lock
Notice: this object is not reachable from any branch.
Concurrent access to a global vmap space is a bottle-neck. We can
simulate a high contention by running a vmalloc test suite.
To address it, introduce an effective vmap node logic. Each node behaves
as independent entity. When a node is accessed it serves a request
directly(if possible) from its pool.
This model has a size based pool for requests, i.e. pools are serialized
and populated based on object size and real demand. A maximum object size
that pool can handle is set to 256 pages.
This technique reduces a pressure on the global vmap lock.
Link: https://lkml.kernel.org/r/20240102184633.748113-8-urezki@gmail.com
Signed-off-by: Uladzislau Rezki (Sony) <urezki@gmail.com>
Cc: Baoquan He <bhe@redhat.com>
Cc: Christoph Hellwig <hch@lst.de>
Cc: Dave Chinner <david@fromorbit.com>
Cc: Joel Fernandes (Google) <joel@joelfernandes.org>
Cc: Kazuhito Hagio <k-hagio-ab@nec.com>
Cc: Liam R. Howlett <Liam.Howlett@oracle.com>
Cc: Lorenzo Stoakes <lstoakes@gmail.com>
Cc: Matthew Wilcox (Oracle) <willy@infradead.org>
Cc: Oleksiy Avramchenko <oleksiy.avramchenko@sony.com>
Cc: Paul E. McKenney <paulmck@kernel.org>
Signed-off-by: Andrew Morton <akpm@linux-foundation.org>
Notice: this object is not reachable from any branch.
Diffstat (limited to 'mm/shrinker.c')
0 files changed, 0 insertions, 0 deletions