Messages in this thread | | | From | Nathan Lynch <> | Subject | Re: [PATCH v3] drivers/base/memory.c: cache blocks in radix tree to accelerate lookup | Date | Thu, 19 Dec 2019 12:09:03 -0600 |
| |
Scott Cheloha <cheloha@linux.vnet.ibm.com> writes:
> Searching for a particular memory block by id is slow because each block > device is kept in an unsorted linked list on the subsystem bus. > > Lookup is much faster if we cache the blocks in a radix tree. Memory > subsystem initialization and hotplug/hotunplug is at least a little faster > for any machine with more than ~100 blocks, and the speedup grows with > the block count. > > Signed-off-by: Scott Cheloha <cheloha@linux.vnet.ibm.com> > Acked-by: David Hildenbrand <david@redhat.com>
Acked-by: Nathan Lynch <nathanl@linux.ibm.com>
Thanks Scott.
| |