lkml.org 
[lkml]   [2011]   [Nov]   [18]   [last100]   RSS Feed
Views: [wrap][no wrap]   [headers]  [forward] 
 
Messages in this thread
/
SubjectRe: [PATCH v2 0/6] KVM: optimize memslots searching
From
Date
On Fri, 2011-11-18 at 17:16 +0800, Xiao Guangrong wrote:
> This is the more work base on my v1 patchset which is posted some months ago,
> it can be found at:
> https://lkml.org/lkml/2011/2/22/68
>
> Change log:
> - sort memslots base on its size and do the line search instead of binary
> search base on gfn, it is from Avi's idea.
> - in order to reduce cache footprint, memslots are sorted in the array of
> kvm->memslots->memslots[] and introduce a table to map slot id to index in
> the array
>
> There is the performance result:
>
> autotest for RHEL.6.1 setup/boot/reboot/shutdown(average):
> ept=1: before: 449.5 after: 447.8
> ept=0: before: 532.7 after: 529.8
>
> kernbench(average):
> ept=1: before: 127.94 after: 126.98
> ept=0: before: 196.85 after: 189.66

Hi,

Do these patches depend on any other patches? Looks like they don't
apply on kvm-next.

--

Sasha.



\
 
 \ /
  Last update: 2011-11-18 10:45    [W:0.088 / U:0.108 seconds]
©2003-2014 Jasper Spaans. Advertise on this site