[Date Prev][Date Next][Thread Prev][Thread Next][Date Index][Thread Index]
Re: [Qemu-devel] [Qemu-block] [PATCH 5/7] qcow2: use a hash to look for
|
From: |
Alberto Garcia |
|
Subject: |
Re: [Qemu-devel] [Qemu-block] [PATCH 5/7] qcow2: use a hash to look for entries in the L2 cache |
|
Date: |
Fri, 08 May 2015 18:48:25 +0200 |
|
User-agent: |
Notmuch/0.13.2 (http://notmuchmail.org) Emacs/23.2.1 (i486-pc-linux-gnu) |
On Fri 08 May 2015 05:46:57 PM CEST, Max Reitz wrote:
> Let's assume the cache is full. Now this hash algorithm (direct mapped
> cache) basically becomes futile, because the LRU algorithm (fully
> associative cache) takes over
That's right, although in that scenario I guess there's no good
algorithm.
Anyway and summarizing that I wrote in a different e-mail, I just
thought that starting the lookup always from the beginning was the worst
alternative and it was very easy to improve it a bit, but I don't think
it has a big impact on the performance. Otherwise I would have evaluated
a different data structure.
Berto
- Re: [Qemu-devel] [Qemu-block] [PATCH 6/7] qcow2: make qcow2_cache_put() a void function, (continued)
- [Qemu-devel] [PATCH 4/7] qcow2: remove qcow2_cache_find_entry_to_replace(), Alberto Garcia, 2015/05/06
- [Qemu-devel] [PATCH 7/7] qcow2: style fixes in qcow2-cache.c, Alberto Garcia, 2015/05/06
- [Qemu-devel] [PATCH 5/7] qcow2: use a hash to look for entries in the L2 cache, Alberto Garcia, 2015/05/06
- [Qemu-devel] [PATCH 2/7] qcow2: simplify qcow2_cache_put() and qcow2_cache_entry_mark_dirty(), Alberto Garcia, 2015/05/06
- [Qemu-devel] [PATCH 3/7] qcow2: use an LRU algorithm to replace entries from the L2 cache, Alberto Garcia, 2015/05/06
- [Qemu-devel] [PATCH 1/7] qcow2: use one single memory block for the L2/refcount cache tables, Alberto Garcia, 2015/05/06