>The processor will mark Accessed and Dirty bits for us in page
>table entries.  So our algorithm could be to periodically look
>at what's been used, and mark some unused pages as not-present and
>mark them as swappable in the host.  This way if the host swaps
>them out, there won't be a conflict with the monitor/guest, since
>a trap will occur on any access to them.
[snip]
>Anyways, this is just a classic swapping algorithm reiterated
>for Nth time.  We just make sure that any page is swappable by
>at most one of either the host or monitor/guest.

Hmm... I have my doubts about this.  It doesn't sound very efficient.
We should consider well whether this is worth the trouble.

-- Ramon


Reply via email to