qemu-devel
[Top][All Lists]
Advanced

[Date Prev][Date Next][Thread Prev][Thread Next][Date Index][Thread Index]

Re: [Qemu-devel] [RFC] optimize is_dup_page for zero pages


From: Peter Lieven
Subject: Re: [Qemu-devel] [RFC] optimize is_dup_page for zero pages
Date: Tue, 12 Mar 2013 12:20:51 +0100

Am 12.03.2013 um 12:11 schrieb Paolo Bonzini <address@hidden>:

> Il 12/03/2013 11:51, Peter Lieven ha scritto:
>> Hi,
>> 
>> a second patch to optimize live migration. I have generated some
>> artifical load
>> testing for zero pages. Ordinary dup or non dup pages are not affected.
>> 
>> savings for zero pages (test case):
>> non SSE2:    30s -> 26s
>> SSE2:        27s -> 21s
>> 
>> optionally I would suggest optimizing buffer_is_zero to use SSE2 if addr
>> is 16 byte aligned and length is 128 byte aligned.
>> in this case bdrv functions could also benefit from it.
>> 
>> Peter
>> 
>> diff --git a/arch_init.c b/arch_init.c
>> index 98e2bc6..e1051e6 100644
>> --- a/arch_init.c
>> +++ b/arch_init.c
>> @@ -164,9 +164,37 @@ int qemu_read_default_config_files(bool userconfig)
>>     return 0;
>> }
>> 
>> -static int is_dup_page(uint8_t *page)
>> +#if __SSE2__
>> +static int is_zero_page_sse2(u_int8_t *page)
>> {
>>     VECTYPE *p = (VECTYPE *)page;
>> +    VECTYPE zero = _mm_setzero_si128();
>> +    int i;
>> +    for (i = 0; i < (TARGET_PAGE_SIZE / sizeof(VECTYPE)); i+=8) {
>> +               VECTYPE tmp0 = _mm_or_si128(p[i+0],p[i+1]);
>> +               VECTYPE tmp1 = _mm_or_si128(p[i+2],p[i+3]);
>> +               VECTYPE tmp2 = _mm_or_si128(p[i+4],p[i+5]);
>> +               VECTYPE tmp3 = _mm_or_si128(p[i+6],p[i+7]);
>> +               VECTYPE tmp01 = _mm_or_si128(tmp0,tmp1);
>> +               VECTYPE tmp23 = _mm_or_si128(tmp2,tmp3);
> 
> You can use the normal "|" C operator, then the result will be portable
> to Altivec or !SSE2 as well.
> 
> The problem is that find_zero_bit has a known case when there are a lot
> of zero bytes---namely, the final passes of migration.  For is_dup_page,
> it is reasonable to assume that:

for find_zero_bit it would also be possible to change to use an optimized
version, but the code will get more and more complicated.

> 
> * zero pages remain zero, and thus are only processed once

you are right this will be the case.

> 
> * non-zero pages are modified often, and thus are processed multiple times.
> 
> Your patch adds overhead in the case where a page is non-zero, which
> will be the common case in any non-artificial benchmark.  It _is_
> possible that the net result is positive because you warm the cache with
> the first 128 bytes of the page.  But without more benchmarking, it is
> reasonable to optimize is_dup_page for the case where the for loop rolls
> very few times.

Ok, good point. However, it will only enter the zero check if the first byte 
(or maybe could change
this to first 32 or 64 bit) is zero.

What about using this patch for buffer_is_zero optimization?

Peter


> 
> Paolo




reply via email to

[Prev in Thread] Current Thread [Next in Thread]