On Wed, May 18, 2011 at 1:41 PM, Prasad Joshi <prasadjoshi...@gmail.com> wrote:
> On Wed, May 18, 2011 at 11:27 AM, Pekka Enberg <penb...@kernel.org> wrote:
>> On Wed, May 18, 2011 at 1:17 PM, Prasad Joshi <prasadjoshi...@gmail.com>
>> wrote:
>>> QCOW uses two tables level1 (L1) table and level2
>>> (L2) table. The L1 table points to offset of L2
>>> table. When a QCOW image is probed, the L1 table is
>>> cached in the memory to avoid reading it from disk
>>> on every reference. This caching imporves the
>>> performance. The similar performance improvment can
>>> be observed when L2 tables are also cached. It is
>>> impossible to cache all of the L2 tables because of
>>> the memory constraint. The patch adds L2 table
>>> caching capability for upto 128 L2 tables, it uses
>>> combination of RB tree and List to manage the L2
>>> cached tables. The link list implementation helps
>>> in building simple LRU structure and RB tree helps
>>> in improving the search time during read/write
>>> operations.
>>
>> Can you please split that text into more readable paragraphs?
>
> Okay will do.
And oh, what happened to the actual benchmark numbers? It's the most
interesting part of this patch.
Pekka
--
To unsubscribe from this list: send the line "unsubscribe kvm" in
the body of a message to majord...@vger.kernel.org
More majordomo info at http://vger.kernel.org/majordomo-info.html
