Question: The shadow-paging scheme requires the page table to be copied. Suppose the page table is represented as a B+-tree. a. Suggest how to share as
The shadow-paging scheme requires the page table to be copied. Suppose the page table is represented as a B+-tree.
a. Suggest how to share as many nodes as possible between the new copy and the shadow copy of the B+-tree, assuming that updates are made only to leaf entries, with no insertions or deletions.
b. Even with the above optimization, logging is much cheaper than a shadow copy scheme, for transactions that perform small updates. Explain why.
Step by Step Solution
3.40 Rating (169 Votes )
There are 3 Steps involved in it
a When a page is updated the old page can be marked as dirty and a new page can be creat... View full answer
Get step-by-step solutions from verified subject matter experts
