The Gateway to Computer Science Excellence
+1 vote

Consider, 2 level paging , with Process P, Inner page table PTi, and outer page table PTo.

Now we know that P and PTi  are divided in various pages but PTo is in 1 page only.

So in order to run process P, we need few pages of P , few pages of PTi and complete PTo in main memory.

If PTi asks for a page of P which is not present in main memory , then thats a PAGE FAULT and that particular page of P will be loaded in.

Now the question is :

Q1)  If PTo asks for a page of PTi which is not present in main memory , then ,is that also a PAGE FAULT ?

Please explain.

If YES, then can it be extended to all k page tables ( for k-level paging) where PTk is the outermost page table of within 1 page.

If No, then why ?

Q2) If answer to above question is YES, then consider the two images below:

             Case 1 gives formula for EMAT , in case of no page fault ,which is correct.

             EMAT formula considering page faults( as per Q1 assuming YES)  is given in CASE 2

             but most of the EMAT formulas online and in books gave formula given in  CASE 3

         Why they have used formula given in case 3 and not in case 2 in case of page faults?

in Operating System by (25 points)
retagged by | 380 views

Please log in or register to answer this question.

Related questions

Quick search syntax
tags tag:apple
author user:martin
title title:apple
content content:apple
exclude -tag:apple
force match +apple
views views:100
score score:10
answers answers:2
is accepted isaccepted:true
is closed isclosed:true
50,737 questions
57,280 answers
104,841 users