[<prev] [next>] [<thread-prev] [thread-next>] [day] [month] [year] [list]
Message-ID: <f67ca79c-ad34-59dd-835f-e7bc9dcaef58@redhat.com>
Date: Tue, 6 Dec 2016 09:40:47 +0100
From: David Hildenbrand <david@...hat.com>
To: Liang Li <liang.z.li@...el.com>, kvm@...r.kernel.org
Cc: virtio-dev@...ts.oasis-open.org, mhocko@...e.com, mst@...hat.com,
dave.hansen@...el.com, qemu-devel@...gnu.org,
linux-kernel@...r.kernel.org, linux-mm@...ck.org,
kirill.shutemov@...ux.intel.com, pbonzini@...hat.com,
akpm@...ux-foundation.org,
virtualization@...ts.linux-foundation.org, dgilbert@...hat.com
Subject: Re: [PATCH kernel v5 0/5] Extend virtio-balloon for fast
(de)inflating & fast live migration
Am 30.11.2016 um 09:43 schrieb Liang Li:
> This patch set contains two parts of changes to the virtio-balloon.
>
> One is the change for speeding up the inflating & deflating process,
> the main idea of this optimization is to use bitmap to send the page
> information to host instead of the PFNs, to reduce the overhead of
> virtio data transmission, address translation and madvise(). This can
> help to improve the performance by about 85%.
Do you have some statistics/some rough feeling how many consecutive bits
are usually set in the bitmaps? Is it really just purely random or is
there some granularity that is usually consecutive?
IOW in real examples, do we have really large consecutive areas or are
all pages just completely distributed over our memory?
Thanks!
--
David
Powered by blists - more mailing lists