search for: unbatched

...e. This leaves the pte unchanged in memory, and the hardware may make asynchronous changes to it. It implements pte_rmw_commit() using a hypercall which preserves the state of the Access/Dirty bits to update the pte. This allows the whole change_pte_range() loop to be run without any synchronous unbatched traps into the hypervisor. With this change in place, an mprotect microbenchmark goes from being 50x worse than native to around 7x, which is acceptible. I believe that other virtualization systems, whether they use direct paging like Xen, or a shadow pagetable scheme (vmi, kvm, lguest), can make...

...e. This leaves the pte unchanged in memory, and the hardware may make asynchronous changes to it. It implements pte_rmw_commit() using a hypercall which preserves the state of the Access/Dirty bits to update the pte. This allows the whole change_pte_range() loop to be run without any synchronous unbatched traps into the hypervisor. With this change in place, an mprotect microbenchmark goes from being 50x worse than native to around 7x, which is acceptible. I believe that other virtualization systems, whether they use direct paging like Xen, or a shadow pagetable scheme (vmi, kvm, lguest), can make...

...e. This leaves the pte unchanged in memory, and the hardware may make asynchronous changes to it. It implements pte_rmw_commit() using a hypercall which preserves the state of the Access/Dirty bits to update the pte. This allows the whole change_pte_range() loop to be run without any synchronous unbatched traps into the hypervisor. With this change in place, an mprotect microbenchmark goes from being 50x worse than native to around 7x, which is acceptible. I believe that other virtualization systems, whether they use direct paging like Xen, or a shadow pagetable scheme (vmi, kvm, lguest), can make...

...te unchanged in memory, and the hardware may make asynchronous changes to it. It implements ptep_modify_prot_commit() using a batched hypercall which preserves the state of the Access/Dirty bits when updating the pte. This allows the whole change_pte_range() loop to be run without any synchronous unbatched traps into the hypervisor. With this change in place, an mprotect microbenchmark goes from being 50x worse than native to around 7x, which is acceptible. I believe that other virtualization systems, whether they use direct paging like Xen, or a shadow pagetable scheme (vmi, kvm, lguest), can make...

...te unchanged in memory, and the hardware may make asynchronous changes to it. It implements ptep_modify_prot_commit() using a batched hypercall which preserves the state of the Access/Dirty bits when updating the pte. This allows the whole change_pte_range() loop to be run without any synchronous unbatched traps into the hypervisor. With this change in place, an mprotect microbenchmark goes from being 50x worse than native to around 7x, which is acceptible. I believe that other virtualization systems, whether they use direct paging like Xen, or a shadow pagetable scheme (vmi, kvm, lguest), can make...

...te unchanged in memory, and the hardware may make asynchronous changes to it. It implements ptep_modify_prot_commit() using a batched hypercall which preserves the state of the Access/Dirty bits when updating the pte. This allows the whole change_pte_range() loop to be run without any synchronous unbatched traps into the hypervisor. With this change in place, an mprotect microbenchmark goes from being 50x worse than native to around 7x, which is acceptible. I believe that other virtualization systems, whether they use direct paging like Xen, or a shadow pagetable scheme (vmi, kvm, lguest), can make...