On Wed, Dec 04, 2019 at 11:05:47AM +0100, Paolo Bonzini wrote: > On 03/12/19 19:46, Sean Christopherson wrote: > > Rather than reserve entries, what if vCPUs reserved an entire ring? Create > > a pool of N=nr_vcpus rings that are shared by all vCPUs. To mark pages > > dirty, a vCPU claims a ring, pushes the pages into the ring, and then > > returns the ring to the pool. If pushing pages hits the soft limit, a > > request is made to drain the ring and the ring is not returned to the pool > > until it is drained. > > > > Except for acquiring a ring, which likely can be heavily optimized, that'd > > allow parallel processing (#1), and would provide a facsimile of #2 as > > pushing more pages onto a ring would naturally increase the likelihood of > > triggering a drain. And it might be interesting to see the effect of using > > different methods of ring selection, e.g. pure round robin, LRU, last used > > on the current vCPU, etc... > > If you are creating nr_vcpus rings, and draining is done on the vCPU > thread that has filled the ring, why not create nr_vcpus+1? The current > code then is exactly the same as pre-claiming a ring per vCPU and never > releasing it, and using a spinlock to claim the per-VM ring. Because I really don't like kvm_get_running_vcpu() :-) Binding the rings to vCPUs also makes for an inflexible API, e.g. the amount of memory required for the rings scales linearly with the number of vCPUs, or maybe there's a use case for having M:N vCPUs:rings. That being said, I'm pretty clueless when it comes to implementing and tuning the userspace side of this type of stuff, so feel free to ignore my thoughts on the API.
