On 08/08/2011 04:29 PM, Anthony Liguori wrote:
One thing that strikes me about this algorithm is that it's very good
for a particular type of workload--shockingly good really.
Poking bytes at random places in memory is fairly generic. If you have
a lot of small objects, and modify a subset of them, this is the pattern
you get.
I think workload aware migration compression is possible for a lot of
different types of workloads. That makes me a bit wary of QEMU
growing quite a lot of compression mechanisms.
It makes me think that this logic may really belong at a higher level
where more information is known about the workload. For instance, I
can imagine XBZRLE living in something like libvirt.
A better model would be plugin based.
--
error compiling committee.c: too many arguments to function
--
libvir-list mailing list
libvir-list@xxxxxxxxxx
https://www.redhat.com/mailman/listinfo/libvir-list