Register

UGC NET CSE | December 2014 | Part 2 | Question: 40

• edited by
4,138 views
2 votes
2 votes

In a demand paging memory system, page table is held in registers. The time taken to service a page fault is $8$ m.sec. if an empty frame is available or if the replaced page is not modified, and it takes $20$ m.secs., if the replaced page is modified. What is the average access time to service a page fault assuming that the page to be replaced is modified $70$% of the time ?

  1. $11.6$ m.sec. 
  2. $16.4$ m.sec. 
  3. $28$ m.sec. 
  4. $14$ m.sec.
• edited by
User Avatar

1 Answer

2 votes
2 votes
Service a page fault=8msec.

Page is not modified=20m.sec.

Page replace=70% of time

the average access time to service a page fault=0.7⨉20+0.3⨉8=14+2.4=16.4ms
• edited by
User Avatar
Voting & Accepting an answer helps improve the community
Answer:
← PreviousNext →
← Previous in categoryNext in category →

Related questions

4.6k
views
1 answers
4 votes
makhdoom ghaya asked Jul 23, 2016
4,554 views
UGC NET CSE | December 2014 | Part 2 | Question: 39
For the implementation of a paging scheme, suppose the average process size be $x$ bytes, the page size be $y$ bytes, and each page entry requires $z$ bytes. The optimum page size ... \frac{x}{2}$\frac{xz}{2}$\sqrt{2xz}$\frac{\sqrt{xz}}{2}$
User Avatar
5.4k
views
1 answers
2 votes
makhdoom ghaya asked Jul 22, 2016
5,414 views
UGC NET CSE | December 2014 | Part 2 | Question: 38
Which of the following conditions does not hold good for a solution to a critical section problem ? No assumptions may be made about speeds or the ... block other processes. Processes do not wait forever to enter its critical section.
User Avatar
1.8k
views
4 answers
2 votes
makhdoom ghaya asked Jul 22, 2016
1,832 views
UGC NET CSE | December 2014 | Part 2 | Question: 37
A specific editor has $200 K$ of program text, $15 K$ of initial stack, $50 K$ of initialized data, and $70 K$ of bootstrap code. If five editors are started ... $335 K$1065 K$320 K$
User Avatar
1.1k
views
1 answers
2 votes
makhdoom ghaya asked Jul 22, 2016
1,076 views
UGC NET CSE | December 2014 | Part 2 | Question: 36
Consider the following justifications for commonly using the two-level $CPU$ scheduling:I. It is used when memory is too small to hold all the ready processes.II. Because its performance ... $IV$I$ and $II$ $III$ and $IV$I$ and $III$
User Avatar
Link Copied!