0
$\begingroup$

In multi-level paging with virtual memory, If I am using local page replacement algorithm (which I think is practically used), then there is no priority followed and pages at higher level can be removed before pages at low level and vice-versa. It's completely random (means not dependent on their page table level), so any page can be removed before any page depending upon the page replacement algorithm I am using.

So, now if I want to calculate effective memory access time, then I have to consider probability of page fault at each level. Right?

$\endgroup$

Your Answer

By clicking “Post Your Answer”, you agree to our terms of service, privacy policy and cookie policy

Browse other questions tagged or ask your own question.